Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
From MaRDI portal
Publication:2056787
DOI10.1007/978-3-030-77883-5_7OpenAlexW3170051467MaRDI QIDQ2056787
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77883-5_7
Related Items (3)
COA-secure obfuscation and applications ⋮ Maliciously-secure MrNISC in the plain model ⋮ On non-uniform security for black-box non-interactive CCA commitments
Cites Work
- Unnamed Item
- Definitions and properties of zero-knowledge proof systems
- One-message zero knowledge and non-malleable commitments
- Four-round concurrent non-malleable commitments from one-way functions
- Distinguisher-dependent simulation in two rounds and its applications
- Round optimal concurrent non-malleability from polynomial hardness
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Candidate iO from homomorphic encryption schemes
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Towards non-interactive witness hiding
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Candidate obfuscation via oblivious LWE sampling
- Black-box non-interactive non-malleable commitments
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Non-interactive non-malleability from quantum supremacy
- Advances in cryptology -- CRYPTO 2016. 36th annual international cryptology conference, Santa Barbara, CA, USA, August 14--18, 2016. Proceedings. Part I
- Contention in Cryptoland: Obfuscation, Leakage and UCE
- Time-Lock Puzzles from Randomized Encodings
- Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Spooky Encryption and Its Applications
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds
- Point Obfuscation and 3-Round Zero-Knowledge
- Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input
- Resettable zero-knowledge (extended abstract)
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
- Magic Functions
- Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
- Adaptive One-Way Functions and Applications
- New and Improved Constructions of Nonmalleable Cryptographic Protocols
- The Knowledge Complexity of Interactive Proof Systems
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Foundations of Cryptography
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
- Post-quantum zero knowledge in constant rounds
- Non-malleability amplification
- Weak zero-knowledge beyond the black-box barrier
- How to use indistinguishability obfuscation
- From Weak to Strong Zero-Knowledge and Applications
- Textbook non-malleable commitments
- Derandomization in Cryptography
- On the (im)possibility of obfuscating programs
- New Techniques for Noninteractive Zero-Knowledge
- Constant round non-malleable protocols using one way functions
- Constant-round non-malleable commitments from any one-way function
- Concurrent Non-malleable Commitments from Any One-Way Function
- Two-Round Secure MPC from Indistinguishability Obfuscation
- Theory of Cryptography
This page was built for publication: Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
