Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments

DOI10.1007/978-3-642-36594-2_19zbMath1315.94099OpenAlexW1864936342MaRDI QIDQ4910286

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

Mathematics Subject Classification ID

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

Related Items (15)

One-message zero knowledge and non-malleable commitments ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ Four-round black-box non-malleable schemes from one-way permutations ⋮ NIWI and new notions of extraction for algebraic languages ⋮ Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG ⋮ Efficient NIZKs for algebraic sets ⋮ Impossibilities in succinct arguments: black-box extraction and more ⋮ On the black-box impossibility of multi-designated verifiers signature schemes from ring signature schemes ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Statistical ZAPs from group-based assumptions ⋮ The cost of adaptivity in security games on graphs ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ An Algebraic Approach to Nonmalleability ⋮ Non-interactive zero knowledge from sub-exponential DDH ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds

This page was built for publication: Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments