Unprovable security of perfect NIZK and non-interactive non-malleable commitments
From MaRDI portal
Publication:332270
DOI10.1007/s00037-016-0122-2zbMath1369.94562OpenAlexW2339198682MaRDI QIDQ332270
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
Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (5)
Another step towards realizing random oracles: non-malleable point obfuscation ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ Statistical ZAPR arguments from bilinear maps ⋮ Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge ⋮ On the CCA compatibility of public-key infrastructure
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Are PCPs inherent in efficient arguments?
- Probabilistic encryption
- Definitions and properties of zero-knowledge proof systems
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
- Enhancements of trapdoor permutations
- 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
- The random oracle methodology, revisited
- Random-Self-Reducibility of Complete Sets
- Resettable zero-knowledge (extended abstract)
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- An Efficient Parallel Repetition Theorem
- 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
- Perfect NIZK with Adaptive Soundness
- 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
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- The Knowledge Complexity of Interactive Proof Systems
- Breaking RSA may not be equivalent to factoring
- A Pseudorandom Generator from any One-way Function
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Foundations of Cryptography
- Nonmalleable Cryptography
- On the Composition of Zero-Knowledge Proof Systems
- 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
- Constant-round non-malleable commitments from any one-way function
- Advances in Cryptology - CRYPTO 2003
- 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
- Theory of Cryptography
This page was built for publication: Unprovable security of perfect NIZK and non-interactive non-malleable commitments
