Welcome to the resource topic for 2005/162
Title:
A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem
Authors: Lan Nguyen, Rei Safavi-Naini, 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.
ePrint: https://eprint.iacr.org/2005/162
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .