A more efficient computationally sound non-interactive zero-knowledge shuffle argument

DOI10.1007/978-3-642-32928-9_27MaRDI QIDQ2912814zbMATH OpenOpenAlexFDO

Authors Helger Lipmaa, Bingsheng Zhang

Publication date 25 September 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-32928-9_27

zbMATH Keywords

bilinear pairingscryptographic shufflenon-interactive zero-knowledgeprogression-free sets

Mathematics Subject Classification ID

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

Recommendations

• A shuffle argument secure in the generic model
• An efficient pairing-based shuffle argument
• Efficient culpably sound NIZK shuffle argument without random oracles
• New Techniques for Non-interactive Shuffle and Range Arguments
• A non-interactive shuffle argument with low trust assumptions

Cited in

(8)

• On publicly-accountable zero-knowledge and small shuffle arguments
• Efficient culpably sound NIZK shuffle argument without random oracles
• New Techniques for Non-interactive Shuffle and Range Arguments
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• A shuffle argument secure in the generic model
• Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
• A non-interactive shuffle argument with low trust assumptions
• More efficient shuffle argument from unique factorization

This page was built for publication: A more efficient computationally sound non-interactive zero-knowledge shuffle argument

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912814)