@article {IOPORT.05217329,
    author       = {Nguyen, L. and Safavi-Naini, R. and Kurosawa, K.},
    title        = {A provably secure and efficient verifiable shuffle based on a variant of the Paillier cryptosystem.},
    year         = {2005},
    journal      = {Journal of Universal Computer Science [electronic only]},
    volume       = {11},
    number       = {6},
    issn         = {0948-6968},
    pages        = {986-1010, electronic only},
    publisher    = {IICM, Institute for Information Processing and Computer Supported New Media, Technische Universit\"at Graz, Graz; Springer-Verlag, Heidelberg},
    abstract     = {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.},
    identifier   = {05217329},
}