Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
From MaRDI portal
Publication:2056787
Cites work
- Adaptive hardness and composable security in the plain model from standard assumptions
- Adaptive One-Way Functions and Applications
- Advances in cryptology -- CRYPTO 2016. 36th annual international cryptology conference, Santa Barbara, CA, USA, August 14--18, 2016. Proceedings. Part I
- Black-box non-interactive non-malleable commitments
- Candidate iO from homomorphic encryption schemes
- Candidate obfuscation via oblivious LWE sampling
- Concurrent non-malleable commitments (and more) in 3 rounds
- 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
- Contention in cryptoland: obfuscation, leakage and UCE
- Definitions and properties of zero-knowledge proof systems
- Derandomization in Cryptography
- Distinguisher-dependent simulation in two rounds and its applications
- Foundations of Cryptography
- Four-round concurrent non-malleable commitments from one-way functions
- From weak to strong zero-knowledge and applications
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 2009954 (Why is no real title available?)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Magic functions
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- New and Improved Constructions of Nonmalleable Cryptographic Protocols
- New techniques for noninteractive zero-knowledge
- Non-interactive non-malleability from quantum supremacy
- Non-malleability amplification
- On non-black-box simulation and the impossibility of approximate obfuscation
- On the (im)possibility of obfuscating programs
- One-message zero knowledge and non-malleable commitments
- Point obfuscation and 3-round zero-knowledge
- Post-quantum zero knowledge in constant rounds
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Resettable zero-knowledge (extended abstract)
- Round optimal concurrent non-malleability from polynomial hardness
- Spooky Encryption and Its Applications
- Textbook non-malleable commitments
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
- Time-lock puzzles from randomized encodings
- Towards non-interactive witness hiding
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Two-round secure MPC from indistinguishability obfuscation
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Weak zero-knowledge beyond the black-box barrier
Cited in
(9)- COA-secure obfuscation and applications
- Non-malleable vector commitments via local equivocability
- Maliciously-secure MrNISC in the plain model
- Non-interactive Mimblewimble transactions, revisited
- On non-uniform security for black-box non-interactive CCA commitments
- Two-round concurrent 2PC from sub-exponential LWE
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
- Witness semantic security
- Registration-based encryption in the plain model
This page was built for publication: Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056787)
