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. © International Association for Cryptology Research 2007.
Author supplied keywords
Cite
CITATION STYLE
Groth, J., & Lu, S. (2007). A non-interactive shuffle with pairing based verifiability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4833 LNCS, pp. 51–67). Springer Verlag. https://doi.org/10.1007/978-3-540-76900-2_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
