Efficient NIZK Arguments via Parallel Verification of Benes Networks

DOI10.1007/978-3-319-10879-7_24zbMath1378.94054OpenAlexW277136184MaRDI QIDQ2922673

Helger Lipmaa

Publication date: 14 October 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-10879-7_24

zbMATH Keywords

shuffleBeneš networksmodular NIZK argumentsperfect zero knowledgeproduct argumentshift argument

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Cryptography (94A60)

Related Items (4)

Scalable zero knowledge via cycles of elliptic curves ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ The hunting of the SNARK ⋮ Unnamed Item

This page was built for publication: Efficient NIZK Arguments via Parallel Verification of Benes Networks