Article citationsMore >>

S. Weber, “A Coercion-Resistant Cryptographic Voting Protocol -Evaluation and Prototype Implementation,” Diploma thesis, Darmstadt University of Technology; 2006.

has been cited by the following article:


Simplified Verifiable Re-encryption Mix-nets

1Graduate School of Engineering, University of Fukui, Fukui, Japan

Information Security and Computer Fraud. 2013, Vol. 1 No. 1, 1-7
DOI: 10.12691/iscf-1-1-1
Copyright © 2013 Science and Education Publishing

Cite this paper:
Shinsuke Tamura, Shuji Taniguchi. Simplified Verifiable Re-encryption Mix-nets. Information Security and Computer Fraud. 2013; 1(1):1-7. doi: 10.12691/iscf-1-1-1.

Correspondence to: Shinsuke Tamura, Graduate School of Engineering, University of Fukui, Fukui, Japan. Email:


Under the assumption that numbers of data that are encrypted and decrypted are sufficiently large and final decryption results of individual data can be publicly disclosed, a simplified mechanism for implementing re-encryption type verifiable mix-nets is proposed. Different from already proposed mechanisms, in which mix-servers prove their honest encryptions while concealing their encryption parameters, mix-servers in the proposed scheme simply disclose their aggregate encryption parameter values. As a consequence anyone can verify encryption results without interacting with mix-servers. Also, its primary verification procedures examine only aggregate behavior of mix-servers, in other words, it does not examine correct encryptions of individual data. Therefore computation volumes required for mix-servers to prove their correct behaviors are reduced substantially. In addition, the proposed scheme can cope with various attacks from malicious entities more effectively than optimistic verifiable mix-nets that also examine only aggregate behaviors of mix-nets.