Unprovable security of perfect NIZK and non-interactive non-malleable commitments
From MaRDI portal
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
- scientific article; zbMATH DE number 1670843
Cites work
- scientific article; zbMATH DE number 176566 (Why is no real title available?)
- scientific article; zbMATH DE number 1942419 (Why is no real title available?)
- scientific article; zbMATH DE number 2081077 (Why is no real title available?)
- scientific article; zbMATH DE number 1775398 (Why is no real title available?)
- scientific article; zbMATH DE number 2088331 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A Pseudorandom Generator from any One-way Function
- Adaptive One-Way Functions and Applications
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- An efficient parallel repetition theorem
- Are PCPs inherent in efficient arguments?
- Breaking RSA may not be equivalent to factoring
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
- Chernoff-Type Direct Product Theorems
- Concurrent Non-malleable Commitments from Any One-Way Function
- Constant round non-malleable protocols using one way functions
- Constant-round non-malleable commitments from any one-way function
- Constant-round non-malleable commitments from sub-exponential one-way functions
- Definitions and properties of zero-knowledge proof systems
- Enhancements of trapdoor permutations
- Foundations of Cryptography
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Limits of provable security from standard assumptions
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- New and improved constructions of non-malleable cryptographic protocols
- Non-malleability amplification
- Nonmalleable Cryptography
- On Worst‐Case to Average‐Case Reductions for NP Problems
- On basing one-way functions on NP-hardness
- On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
- On the (Im)Possibility of Key Dependent Encryption
- On the Composition of Zero-Knowledge Proof Systems
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- On the Generic Insecurity of the Full Domain Hash
- On the impossibility of three-move blind signature schemes
- On the power of nonuniformity in proofs of security
- Perfect NIZK with Adaptive Soundness
- Perfect Non-interactive Zero Knowledge for NP
- Probabilistic encryption
- Random-Self-Reducibility of Complete Sets
- Relativized cryptography
- Resettable zero-knowledge (extended abstract)
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Separation Results on the “One-More” Computational Problems
- The Knowledge Complexity of Interactive Proof Systems
- The complexity of approximating a nonlinear program
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- The random oracle methodology, revisited.
- Theory of Cryptography
- Towards non-black-box lower bounds in cryptography
- Unconditional Characterizations of Non-interactive Zero-Knowledge
Cited in
(12)- Unconditionally secure NIZK in the fine-grained setting
- 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
- The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Statistical ZAPR arguments from bilinear maps
- Constructions and bounds for unconditionally secure non-interactive commitment schemes
- Limits of provable security from standard assumptions
- Another step towards realizing random oracles: non-malleable point obfuscation
- On non-uniform security for black-box non-interactive CCA 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)
