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

DOI10.1007/S00037-016-0122-2zbMATH Open1369.94562OpenAlexW2339198682MaRDI QIDQ332270FDOQ332270

Authors: Rafael Pass 

Publication date: 28 October 2016

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-016-0122-2

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
• Perfect Non-interactive Zero Knowledge for NP
• scientific article; zbMATH DE number 1842511
• Publication:2754163

zbMATH Keywords

cryptographyblack-box separationsnon-interactive zero-knowledgenon-malleable commitments

Mathematics Subject Classification ID

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

Cites Work

• Probabilistic encryption
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A Pseudorandom Generator from any One-way Function
• The random oracle methodology, revisited.
• Resettable zero-knowledge (extended abstract)
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• An efficient parallel repetition theorem
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Breaking RSA may not be equivalent to factoring
• Foundations of Cryptography
• Nonmalleable Cryptography
• On the Composition of Zero-Knowledge Proof Systems
• Constant-round non-malleable commitments from any one-way function
• Title not available (Why is that?)
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Perfect NIZK with Adaptive Soundness
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography
• Definitions and properties of zero-knowledge proof systems
• The Knowledge Complexity of Interactive Proof Systems
• Title not available (Why is that?)
• Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
• Enhancements of trapdoor permutations
• The complexity of approximating a nonlinear program
• On basing one-way functions on NP-hardness
• On the Cryptographic Applications of Random Functions (Extended Abstract)
• On the power of nonuniformity in proofs of security
• Towards non-black-box lower bounds in cryptography
• Random-Self-Reducibility of Complete Sets
• On the impossibility of three-move blind signature schemes
• Constant-round non-malleable commitments from sub-exponential one-way functions
• New and improved constructions of non-malleable cryptographic protocols
• Perfect Non-interactive Zero Knowledge for NP
• Adaptive One-Way Functions and Applications
• On the (Im)Possibility of Key Dependent Encryption
• On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
• Chernoff-Type Direct Product Theorems
• Relativized cryptography
• Title not available (Why is that?)
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-malleability amplification
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Limits of provable security from standard assumptions
• Constant round non-malleable protocols using one way functions
• Advances in Cryptology - CRYPTO 2003
• Concurrent Non-malleable Commitments from Any One-Way Function
• Unconditional Characterizations of Non-interactive Zero-Knowledge
• On the Generic Insecurity of the Full Domain Hash
• Separation Results on the “One-More” Computational Problems
• On Worst‐Case to Average‐Case Reductions for NP Problems
• Are PCPs inherent in efficient arguments?

Cited In (12)

• On non-uniform security for black-box non-interactive CCA commitments
• The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
• Another step towards realizing random oracles: non-malleable point obfuscation
• Unconditionally secure NIZK in the fine-grained setting
• Limits of provable security from standard assumptions
• Statistical ZAPR arguments from bilinear maps
• Impossibility on tamper-resilient cryptography with uniqueness properties
• On the CCA compatibility of public-key infrastructure
• Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
• Constructions and bounds for unconditionally secure non-interactive commitment schemes
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• 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 Q332270)