@inproceedings {26618,
title = {An Efficient Pairing-Based Shuffle Argument},
journal = {International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2017)},
volume = {1062524311562359528427},
year = {2017},
pages = {97 - 127},
publisher = {Springer International Publishing},
address = {Cham},
abstract = {We construct the most efficient known pairing-based NIZK shuffle argument. It consists of three subarguments that were carefully chosen to obtain optimal efficiency of the shuffle argument:1. A same-message argument based on the linear subspace QANIZK argument of Kiltz and Wee,\ 2. A (simplified) permutation matrix argument of Fauzi, Lipmaa, and Zaj{\k a}c,\ 3. A (simplified) consistency argument of Groth and Lu.We prove the knowledge-soundness of the first two subarguments in the generic bilinear group model, and the culpable soundness of the third subargument under a KerMDH assumption. This proves the soundness of the shuffle argument. We also discuss our partially optimized implementation that allows one to prove a shuffle of\ 100000100000\ ciphertexts in less than a minute and verify it in less than 1.5\ min.},
keywords = {Common Reference String, Generic group model, Mix-net, Shuffle argument, Zero knowledge},
isbn = {978-3-319-70696-2},
issn = {0302-9743},
doi = {10.1007/978-3-319-70697-910.1007/978-3-319-70697-9_4},
url = {http://link.springer.com/10.1007/978-3-319-70697-9_4},
author = {Fauzi, Prastudy and Lipmaa, Helger and Siim, Janno and Zaj{\k a}c, Micha{\l}},
editor = {Takagi, Tsuyoshi and Peyrin, Thomas}
}