AuthorsP. Fauzi and H. Lipmaa
EditorsK. Sako
TitleEfficient Culpably Sound NIZK Shuffle Argument Without Random Oracles
Project(s)No Simula project
Publication TypeProceedings, refereed
Year of Publication2016
Conference NameCryptographers’ Track at the RSA Conference (CT-RSA 2016)
Pagination200 - 216
Date Published03/2016
PublisherSpringer International Publishing
Place PublishedCham
ISBN Number978-3-319-29484-1
ISSN Number0302-9743
KeywordsBilinear pairings, CRS model, Mix-net, Non-interactive zero knowledge, Shuffle argument

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.


Citation Key26620