Paper 2005/162
A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem
Lan Nguyen, 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.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. In Journal of Universal Computer Science
- Keywords
- privacyverifiable shufflesmix-netsPaillier
- Contact author(s)
- ldn01 @ uow edu au
- History
- 2005-06-27: revised
- 2005-06-04: received
- See all versions
- Short URL
- https://ia.cr/2005/162
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2005/162,
author = {Lan Nguyen and Rei Safavi-Naini and Kaoru Kurosawa},
title = {A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem},
howpublished = {Cryptology {ePrint} Archive, Paper 2005/162},
year = {2005},
url = {https://eprint.iacr.org/2005/162}
}
