Journal of the ACM (JACM)
Receipt-free secret-ballot elections (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A verifiable secret shuffle and its application to e-voting
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
An Efficient Scheme for Proving a Shuffle
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Number-theoretic constructions of efficient pseudo-random functions
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
International Journal of Information Security
Implementing STV securely in Pret a Voter
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Verifiable Rotation of Homomorphic Encryptions
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Shuffle-sum: coercion-resistant verifiable tallying for STV voting
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Receipt-free mix-type voting scheme: a practical solution to the implementation of a voting booth
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Verifiable shuffle of large size ciphertexts
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Ballot permutations in prêt à voter
EVT/WOTE'09 Proceedings of the 2009 conference on Electronic voting technology/workshop on trustworthy elections
Prêt à voter with re-encryption mixes
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Prêt à Voter with Paillier encryption
Mathematical and Computer Modelling: An International Journal
Pretty good democracy for more expressive voting schemes
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Using Prêt à Voter in Victorian state elections
EVT/WOTE'12 Proceedings of the 2012 international conference on Electronic Voting Technology/Workshop on Trustworthy Elections
| Hi-index | 0.00 |
We consider the problem of verifiable parallel shuffling in which the same shuffle is simultaneously performed on two or more lists of input ciphertexts, each list encrypted under a different key. We present three parallelisations of shuffle proofs from different paradigms. The properties of each protocol are analyzed and contrasted, and their suitability for electronic voting discussed. We show how parallel shuffling solves the problem of verifiable distributed ballot construction in the Prêt à Voter electronic voting scheme. In conjunction with the use of a new cryptographic primitive for partially-homomorphic addition, the incorporation of parallel shuffling is shown to produce schemes with superior privacy properties to existing protocols. We additionally present several original attacks on Prêt à Voter and demonstrate that our modified schemes are immune.