An Efficient Pairing-Based Shuffle Argument

Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

DOI

  • 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.

OriginalsprogEngelsk
TitelAdvances in Cryptology – ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings
RedaktørerTsuyoshi Takagi, Thomas Peyrin
Antal sider31
ForlagSpringer VS
Udgivelsesår1 jan. 2017
Sider97-127
ISBN (trykt)978-3-319-70696-2
ISBN (Elektronisk)978-3-319-70697-9
DOI
StatusUdgivet - 1 jan. 2017
Begivenhed23rd International Conference on the Theory and Applications of Cryptology and Information Security - Harbour Plaza North Point, Hong Kong, Kina
Varighed: 3 dec. 20177 dec. 2017
Konferencens nummer: 23
https://asiacrypt.iacr.org/2017/

Konference

Konference23rd International Conference on the Theory and Applications of Cryptology and Information Security
Nummer23
LokationHarbour Plaza North Point
LandKina
ByHong Kong
Periode03/12/201707/12/2017
Internetadresse
SerietitelLecture Notes in Computer Science
Vol/bind10625
ISSN0302-9743

Se relationer på Aarhus Universitet Citationsformater

ID: 120386058