An Efficient Pairing-Based Shuffle Argument

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  • Prastudy Fauzi
  • ,
  • Helger Lipmaa, Institute of Computer Science, University of Tartu
  • ,
  • Janno Siim, Institute of Computer Science, University of Tartu, STACC, Ülikooli 2, Tartu
  • ,
  • Michal Zajac, Institute of Computer Science, University of Tartu

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ą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 100000 ciphertexts in less than a minute and verify it in less than 1.5 min.

Original languageEnglish
Title of host publicationAdvances in Cryptology – ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings
EditorsTsuyoshi Takagi, Thomas Peyrin
Number of pages31
PublisherSpringer VS
Publication year1 Jan 2017
Pages97-127
ISBN (print)978-3-319-70696-2
ISBN (Electronic)978-3-319-70697-9
DOIs
Publication statusPublished - 1 Jan 2017
Event23rd International Conference on the Theory and Applications of Cryptology and Information Security - Harbour Plaza North Point, Hong Kong, China
Duration: 3 Dec 20177 Dec 2017
Conference number: 23
https://asiacrypt.iacr.org/2017/

Conference

Conference23rd International Conference on the Theory and Applications of Cryptology and Information Security
Nummer23
LocationHarbour Plaza North Point
LandChina
ByHong Kong
Periode03/12/201707/12/2017
Internetadresse
SeriesLecture Notes in Computer Science
Volume10625
ISSN0302-9743

    Research areas

  • Common reference string, Generic group model, Mix-net, Shuffle argument, Zero knowledge

See relations at Aarhus University Citationformats

ID: 120386058