Authors | P. Fauzi, H. Lipmaa, M. Zając and J. Siim |
Editors | T. Takagi and T. Peyrin |
Title | An Efficient Pairing-Based Shuffle Argument |
Afilliation | Cryptography |
Project(s) | No Simula project |
Status | Published |
Publication Type | Proceedings, refereed |
Year of Publication | 2017 |
Conference Name | ASIACRYPT 2017 |
Volume | 10626 |
Pagination | 97 - 127 |
Publisher | Springer International Publishing |
Place Published | Cham |
ISBN Number | 978-3-319-70696-2 |
ISSN Number | 0302-9743 |
Keywords | Common Reference String, Generic group model, Mix-net, Shuffle argument, Zero knowledge |
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, 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. |
URL | http://link.springer.com/10.1007/978-3-319-70697-9_4 |
DOI | 10.1007/978-3-319-70697-910.1007/978-3-319-70697-9_4 |
Citation Key | 26618 |