Cryptology ePrint Archive: Report 2016/866

A Shuffle Argument Secure in the Generic Model

Prastudy Fauzi and Helger Lipmaa and Michał Zając

Abstract: We propose a new random oracle-less NIZK shuffle argument. It has a simple structure, where the first verification equation ascertains that the prover has committed to a permutation matrix, the second verification equation ascertains that the same permutation was used to permute the ciphertexts, and the third verification equation ascertains that input ciphertexts were ``correctly'' formed. The new argument has $3.5$ times more efficient verification than the up-to-now most efficient shuffle argument by Fauzi and Lipmaa (CT-RSA 2016). Compared to the Fauzi-Lipmaa shuffle argument, we (i) remove the use of knowledge assumptions and prove our scheme is sound in the generic bilinear group model, and (ii) prove standard soundness, instead of culpable soundness.

Category / Keywords: Common reference string, generic bilinear group model, mix-net, shuffle argument, zero knowledge.

Original Publication (in the same form): IACR-ASIACRYPT-2016

Date: received 6 Sep 2016, last revised 10 Sep 2016

Contact author: prastudy fauzi at gmail com, helger lipmaa@gmail com, m zajac@mimuw edu pl

Available format(s): PDF | BibTeX Citation

Version: 20160910:154010 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]