An Efficient Pairing-Based Shuffle Argument

Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michał Zajac

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 Zajac,3.A (simplified) consistency argument of Groth and Lu.
Original languageEnglish
Title of host publicationAdvances in Cryptology -- ASIACRYPT 2017
EditorsTsuyoshi Takagi, Thomas Peyrin
Place of PublicationCham
PublisherSpringer International Publishing
Pages97-127
Number of pages31
ISBN (Electronic)978-3-319-70697-9
ISBN (Print)978-3-319-70696-2
DOIs
Publication statusPublished - 18 Nov 2017
Event23rd Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2017 - Hong Kong, Hong Kong
Duration: 3 Dec 20177 Dec 2017

Publication series

NameLecture Notes in Computer Science
PublisherSpringer, Cham
Volume10625
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference23rd Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2017
CountryHong Kong
CityHong Kong
Period3/12/177/12/17

Fingerprint Dive into the research topics of 'An Efficient Pairing-Based Shuffle Argument'. Together they form a unique fingerprint.

Cite this