Cryptology ePrint Archive: Report 2005/162

A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem

Lan Nguyen and Rei Safavi-Naini and Kaoru Kurosawa

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.

Category / Keywords: public-key cryptography / privacy, verifiable shuffles, mix-nets, Paillier

Publication Info: In Journal of Universal Computer Science

Date: received 30 May 2005, last revised 27 Jun 2005

Contact author: ldn01 at uow edu au

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20050627:092432 (All versions of this report)

Short URL: ia.cr/2005/162

Discussion forum: Show discussion | Start new discussion