Cryptology ePrint Archive: Report 2015/1112

Efficient Culpably Sound NIZK Shuffle Argument without Random Oracles

Prastudy Fauzi and Helger Lipmaa

Abstract: One way to guarantee security against malicious voting servers is to use NIZK shuffle arguments. Up to now, only two NIZK shuffle arguments in the CRS model have been proposed. Both arguments are relatively inefficient compared to known random oracle based arguments. We propose a new, more efficient, shuffle argument in the CRS model. Importantly, its online prover's computational complexity is dominated by only two $(n + 1)$-wide multi-exponentiations, where $n$ is the number of ciphertexts. Compared to the previously fastest argument by Lipmaa and Zhang, it satisfies a stronger notion of soundness.

Category / Keywords: cryptographic protocols / Bilinear pairings, CRS model, mix-net, non-interactive zero knowledge, shuffle argument.

Date: received 16 Nov 2015, last revised 25 Nov 2015

Contact author: helger lipmaa at gmail com

Available format(s): PDF | BibTeX Citation

Note: Very minimal changes

Version: 20151125:174053 (All versions of this report)

Short URL: ia.cr/2015/1112

Discussion forum: Show discussion | Start new discussion