Efficient Culpably Sound NIZK Shuffle Argument Without Random Oracles

DOI10.1007/978-3-319-29485-8_12zbMath1334.68057OpenAlexW2398294729MaRDI QIDQ2799014

Prastudy Fauzi, Helger Lipmaa

Publication date: 8 April 2016

Published in: Topics in Cryptology - CT-RSA 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-29485-8_12

zbMATH Keywords

bilinear pairingsmix-netshuffle argumentnon-interactive zero knowledgeCRS model

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (6)

More efficient shuffle argument from unique factorization ⋮ A Shuffle Argument Secure in the Generic Model ⋮ Intrusion-resilient identity-based signatures: concrete scheme in the standard model and generic construction ⋮ New Techniques for Non-interactive Shuffle and Range Arguments ⋮ Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge ⋮ Optimally Sound Sigma Protocols Under DCRA

This page was built for publication: Efficient Culpably Sound NIZK Shuffle Argument Without Random Oracles