Unprovable security of perfect NIZK and non-interactive non-malleable commitments

DOI10.1007/978-3-642-36594-2_19zbMATH Open1315.94099OpenAlexW1864936342MaRDI QIDQ4910286FDOQ4910286

Authors: Rafael Pass 

Publication date: 18 March 2013

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_19

Recommendations

• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
• scientific article; zbMATH DE number 1722670
• scientific article; zbMATH DE number 1842511
• Possibility and impossibility results for selective decommitments

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (24)

• NIWI and new notions of extraction for algebraic languages
• The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
• An Algebraic Approach to Nonmalleability
• One-message zero knowledge and non-malleable commitments
• Compact NIZKs from standard assumptions on bilinear maps
• Concurrent non-malleable commitments (and more) in 3 rounds
• Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
• Triply adaptive UC NIZK
• Unconditionally secure NIZK in the fine-grained setting
• Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
• Impossibilities in succinct arguments: black-box extraction and more
• Efficient NIZKs for algebraic sets
• On the black-box impossibility of multi-designated verifiers signature schemes from ring signature schemes
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Non-interactive zero knowledge from sub-exponential DDH
• On the complexity of collision resistant hash functions: new and old black-box separations
• Impossibility on tamper-resilient cryptography with uniqueness properties
• Structure versus hardness through the obfuscation lens
• Non-interactive zero-knowledge from LPN and MQ
• Constructions and bounds for unconditionally secure non-interactive commitment schemes
• Statistical ZAPs from group-based assumptions
• Four-round black-box non-malleable schemes from one-way permutations
• The cost of adaptivity in security games on graphs
• Perfect NIZK with Adaptive Soundness

This page was built for publication: Unprovable security of perfect NIZK and non-interactive non-malleable commitments

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