JUCS - Journal of Universal Computer Science 11(6): 986-1010, doi: 10.3217/jucs-011-06-0986
A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem
expand article infoLan Nguyen‡, Reihaneh Safavi-Naini§, Kaoru Kurosawa|
‡ University of Wollongong, Australia§ Centre for Computer Security Research, University of Wollongong, Wollongong, Australia| Ibaraki University, Japan

Corresponding author: Lan Nguyen ( ldn01@uow.edu.au )

© Lan Nguyen, Reihaneh Safavi-Naini, Kaoru Kurosawa.
This article is freely available under the J.UCS Open Content License.
Citation: Nguyen L, Safavi-Naini R, Kurosawa K (2005) A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem. JUCS - Journal of Universal Computer Science 11(6): 986-1010. https://doi.org/10.3217/jucs-011-06-0986
Open Access
Abstract
We propose a variant of the Paillier cryptosystem that improves efficiency in encryption, re-encryption and decryption while preserving the homomorphic property. We then use this variant to construct a new verifiable shuffle system and prove its security. We show that the new shuffle scheme has the least number of rounds and exponentiations compared to all known shuffle schemes. Finally, we show how to construct a publicly verifiable mix-net using the shuffle system.
Keywords
privacy, verifiable shuffles, mix-nets, Paillier's public-key system