Filling the gap between voters and cryptography in e-voting

被引：0

作者：

Han W. ^{[1
]}

Zheng D. ^{[2
]}

Chen K.-F. ^{[1
]}

机构：

[1] Department of Computer Science and Engineering, Shanghai Jiaotong University

[2] School of Information Security Engineering, Shanghai Jiaotong University

来源：

Journal of Shanghai Jiaotong University (Science) | 2009年 / 14 E卷 / 03期

关键词：

E-voting; Homomorphic commitment; Homomorphic encryption; Threshold decryption;

D O I：

10.1007/s12204-009-0257-2

中图分类号：

学科分类号：

摘要：

Cryptography is an important tool in the design and implementation of e-voting schemes since it can provide verifiability, which is not provided in the traditional voting. But in the real life, most voters can neither understand the profound theory of cryptography nor perform the complicated cryptographic computation. An e-voting system is presented in this paper to leverage the use of cryptography. It combines the advantages of voting scheme of Moran-Naor and voting scheme based on homomorphic encryption. It makes use of the cryptographic technique, but it hides the details of cryptographic computation from voters. Compared with voting scheme of Moran-Naor, the new system has three advantages: the ballots can be recovered when the voting machine breaks down, the costly cut-and-choose zero-knowledge proofs for shuffling votes made by the voting machine are avoided and the partial tally result in each voting machine can be kept secret.

引用

页码：257 / 260

页数：3

共 15 条

[1]

Neff C.A., Practical high certainty intent verification for encrypted votes, (2004)

[2]

Moran T., Naor M., Receipt-free universally-verifiable voting with everlasting privacy, Proceedings of CRYPTO 2006, pp. 373-392, (2006)

[3]

Fujisaki E., Okamoto T., Statistical zero knowledge protocols to prove modular polynomial relations, Proceedings of CRYPTO 1997, pp. 16-30, (1997)

[4]

Damgard I., Fujisaki E., A statistically-hiding integer commitment scheme based on groups with hidden order, Proceedings of ASIACRYPT 2002, pp. 125-142, (2002)

[5]

Cramer R., Gennaro R., Schoenmakers B., A secure and optimally efficient multi-authority election scheme, Proceedings of EUROCRYPT 1997, pp. 103-118, (1997)

[6]

Elgamal T., A public key cryptosystem and a signature scheme based on discrete logarithms, Proceedings of CRYPTO 1984, pp. 10-18, (1984)

[7]

Paillier P., Public-key cryptosystems based on composite degree residuosity class, Proceedings of EUROCRYPT 1999, pp. 223-239, (1999)

[8]

Pedersen T.P., A threshold cryptosystem without a trusted third party, Proceedings of EUROCRYPT 1991, pp. 522-526, (1991)

[9]

Fouque P.A., Poupard G., Stern J., Sharing decryption in the context of voting or lotteries, Proceedings of FC 2000, pp. 90-104, (2001)

[10]

Damgard I., Jurik M., A generalisation, a simplification and some applications of Paillier's probabilistic public-key system, Proceedings of PKC 2001, pp. 119-136, (2001)

← 1 2 →