On non-uniform security for black-box non-interactive CCA commitments
From MaRDI portal
Publication:6138083
Recommendations
- The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
- Non-malleability vs. CCA-security: the case of commitments
- scientific article; zbMATH DE number 1722670
- Textbook non-malleable commitments
- Non-interactive and reusable non-malleable commitment schemes
Cites work
- scientific article; zbMATH DE number 1024061 (Why is no real title available?)
- scientific article; zbMATH DE number 1775398 (Why is no real title available?)
- A new approach to round-optimal secure multiparty computation
- 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
- 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
- Derandomization in Cryptography
- Four round secure computation without setup
- 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 constructions of hinting PRGs, OWFs with encryption, and more
- New techniques for noninteractive zero-knowledge
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- Non-interactive non-malleability from quantum supremacy
- Non-malleability amplification
- Non-malleability vs. CCA-security: the case of commitments
- On non-black-box simulation and the impossibility of approximate obfuscation
- One-message zero knowledge and non-malleable commitments
- Practical and provably-secure commitment schemes from collision-free hashing
- Promise zero knowledge and its applications to round optimal MPC
- Random Oracles and Auxiliary Input
- Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
- Round optimal concurrent MPC via strong simulation
- Round optimal concurrent non-malleability from polynomial hardness
- Round optimal secure multiparty computation from minimal assumptions
- Round-optimal secure multi-party computation
- Textbook non-malleable commitments
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
This page was built for publication: On non-uniform security for black-box non-interactive CCA commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138083)
