Groth, J and Lu, S (2007) A ton-interactive shuffle with pairing based verifiability. In: Kurosawa, K, (ed.) ADVANCES IN CRYPTOLOGY - ASIACRYPT 2007. (pp. 51 - 67). SPRINGER-VERLAG BERLIN
Full text not available from this repository.
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.
| Type: | Proceedings paper |
|---|---|
| Title: | A ton-interactive shuffle with pairing based verifiability |
| Event: | 13th International Conference on Theory and Application of Cryptology and Information Security |
| Location: | Kuching, MALAYSIA |
| Dates: | 2007-12-02 - 2007-12-06 |
| ISBN-13: | 978-3-540-76899-9 |
| Keywords: | shuffle, mix-net, non-interactive zero-knowledge, bilinear group, RANDOM-ORACLE-MODEL, EFFICIENT, NETWORKS, NIZK |
| UCL classification: | UCL > School of BEAMS > Faculty of Engineering Science > Computer Science |
Archive Staff Only: edit this record