International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Lan Nguyen
Rei Safavi-Naini
Kaoru Kurosawa
Download:
URL: http://eprint.iacr.org/2005/162
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2005-12498,
  title={A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography / privacy, verifiable shuffles, mix-nets, Paillier},
  url={http://eprint.iacr.org/2005/162},
  note={In Journal of Universal Computer Science ldn01@uow.edu.au 12961 received 30 May 2005, last revised 27 Jun 2005},
  author={Lan Nguyen and Rei Safavi-Naini and Kaoru Kurosawa},
  year=2005
}