id: 05217329
dt: j
an: 05217329
au: Nguyen, L.; Safavi-Naini, R.; Kurosawa, K.
ti: A provably secure and efficient verifiable shuffle based on a variant of
    the Paillier cryptosystem.
so: J. UCS 11, No. 6, 986-1010, electronic only (2005).
py: 2005
pu: IICM, Institute for Information Processing and Computer Supported New
    Media, Technische Universität Graz, Graz; Springer-Verlag, Heidelberg
la: EN
cc: 
ut: Paillier’s public-key system; mix-nets; privacy
ci: 
li: http://www.jucs.org/jucs_11_6/a_provably_secure_and
ab: Summary: 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.
rv: