A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem
Lan Duy Nguyen, Reihaneh Safavi–Naini, Kaoru Kurosawa · 2005
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.