Black-box non-interactive non-malleable commitments
From MaRDI portal
Publication:2056786
Cites work
- scientific article; zbMATH DE number 1024061 (Why is no real title available?)
- Adaptive One-Way Functions and Applications
- Adaptive hardness and composable security in the plain model from standard assumptions
- An Algebraic Approach to Nonmalleability
- Black-box non-interactive non-malleable commitments
- CCA security and trapdoor functions via key-dependent-message security
- Concurrent Non-malleable Commitments from Any One-Way Function
- Concurrent non-malleable commitments (and more) in 3 rounds
- 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
- Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Derandomization in Cryptography
- Four-round concurrent non-malleable commitments from one-way functions
- Multi-collision resistance: a paradigm for keyless hash functions
- New and Improved Constructions of Nonmalleable Cryptographic Protocols
- New and improved constructions of non-malleable cryptographic protocols
- New techniques for noninteractive zero-knowledge
- Non-interactive non-malleability from quantum supremacy
- Non-malleability amplification
- Non-malleability vs. CCA-security: the case of commitments
- One-message zero knowledge and non-malleable commitments
- Practical and provably-secure commitment schemes from collision-free hashing
- Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
- Round optimal concurrent non-malleability from polynomial hardness
- Simple, Black-Box Constructions of Adaptively Secure Protocols
- Textbook non-malleable commitments
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
Cited in
(14)- Textbook non-malleable commitments
- Black-box anonymous commit-and-prove
- Cryptographic primitives with hinting property
- On non-uniform security for black-box non-interactive CCA commitments
- Maliciously-secure MrNISC in the plain model
- Security-preserving distributed samplers: how to generate any CRS in one round without random oracles
- Bounds on the efficiency of black-box commitment schemes
- COA-secure obfuscation and applications
- Non-malleable commitments against quantum attacks
- Black-box non-interactive non-malleable commitments
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- On the CCA compatibility of public-key infrastructure
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- Cryptographic primitives with hinting property
This page was built for publication: Black-box non-interactive non-malleable commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056786)
