A Non-interactive Shuffle with Pairing Based Verifiability

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 zeroknowledge proof for correctness of a shuffle.

• Type: Conference
• Year: 2007
• Where: ASIACRYPT
• Authors: Jens Groth, Steve Lu
• Keywords: ASIACRYPT 2007, Cryptology, Practical Zero-knowledge Proofs, Shuffle, Zero-knowledge Proofs