Coercion Resistance In A Practical Secret Voting Scheme For Large Scale Elections
2017 14TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS AND NETWORKS & 2017 11TH INTERNATIONAL CONFERENCE ON FRONTIER OF COMPUTER SCIENCE AND TECHNOLOGY & 2017 THIRD INTERNATIONAL SYMPOSIUM OF CREATIVE COMPUTING (ISPAN-FCST-ISCC)(2017)
摘要
We propose a novel framework to combine efficient coercion resistance with increased levels of privacy in electronic voting. Our scheme can be considered as an extension of the blind signature based voting protocol of Fujioka, Okamoto and Ohta (FOO) that aims to merge it with the well known coercion resistance framework proposed by Juels, Catalano and Jakobsson (JCJ), where each voter can cast multiple votes, authenticated using anonymous credentials. Our proposal has an additional benefit, since it deals with coercion resistance in a more efficient manner, by taking advantage of the function splitting architecture between the participating authorities from FOO to reduce the quadratic complexity of identifying and removing coerced votes, which are cast with fake credentials, as in JCJ. To this end we utilise a method of converting digital signatures to group signatures due to Petersen.
更多查看译文
关键词
electronic voting, coercion resistance, everlasting privacy, blind signatures, group signatures
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络