%0 Conference Paper %1 DBLP:conf/asiacrypt/GrothL07 %A Groth, Jens %A Lu, Steve %B ASIACRYPT %D 2007 %K crypto %P 51-67 %R 10.1007/978-3-540-76900-2_4 %T A Non-interactive Shuffle with Pairing Based Verifiability %V 4833/2007 %X A shuffle is a permutation and re-encryption of a set of ciphertexts. Shuffles are for instance used in mix-nets for anonymous broadcast and voting. One way to make a shuffle verifiable is to give a zero-knowledge proof of correctness. All currently known practical zero-knowledge proofs for correctness of a shuffle rely on interaction. We give the first efficient non-interactive zero-knowledge proof for correctness of a shuffle.

@inproceedings{DBLP:conf/asiacrypt/GrothL07, abstract = {A shuffle is a permutation and re-encryption of a set of ciphertexts. Shuffles are for instance used in mix-nets for anonymous broadcast and voting. One way to make a shuffle verifiable is to give a zero-knowledge proof of correctness. All currently known practical zero-knowledge proofs for correctness of a shuffle rely on interaction. We give the first efficient non-interactive zero-knowledge proof for correctness of a shuffle.}, added-at = {2010-02-28T03:49:08.000+0100}, author = {Groth, Jens and Lu, Steve}, bibsource = {DBLP, http://dblp.uni-trier.de}, biburl = {https://www.bibsonomy.org/bibtex/23069fc91425b74d247e5b4fb997810d8/ytyoun}, booktitle = {ASIACRYPT}, description = {NIZK}, doi = {10.1007/978-3-540-76900-2_4}, interhash = {efc678ebec92e42d42c14c3c2b94e30a}, intrahash = {3069fc91425b74d247e5b4fb997810d8}, keywords = {crypto}, pages = {51-67}, timestamp = {2011-10-01T05:03:46.000+0200}, title = {A Non-interactive Shuffle with Pairing Based Verifiability}, volume = {4833/2007}, year = 2007 }