Black-box non-interactive non-malleable commitments

DOI10.1007/978-3-030-77883-5_6OpenAlexW3095459062MaRDI QIDQ2056786

Dakshita Khurana, Brent Waters, Rachit Garg, George Jingfeng Lu

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-77883-5_6

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

COA-secure obfuscation and applications, Non-malleable commitments against quantum attacks, Maliciously-secure MrNISC in the plain model, Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round, Cryptographic primitives with hinting property, On non-uniform security for black-box non-interactive CCA commitments, Security-preserving distributed samplers: how to generate any CRS in one round without random oracles, Black-box non-interactive non-malleable commitments, Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments, On the CCA compatibility of public-key infrastructure

Cites Work

• Unnamed Item
• One-message zero knowledge and non-malleable commitments
• Four-round concurrent non-malleable commitments from one-way functions
• Round optimal concurrent non-malleability from polynomial hardness
• Non-malleability vs. CCA-security: the case of commitments
• Black-box non-interactive non-malleable commitments
• Non-interactive non-malleability from quantum supremacy
• Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
• Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
• Concurrent Non-Malleable Commitments (and More) in 3 Rounds
• Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
• Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
• New and improved constructions of non-malleable cryptographic protocols
• Adaptive One-Way Functions and Applications
• Simple, Black-Box Constructions of Adaptively Secure Protocols
• New and Improved Constructions of Nonmalleable Cryptographic Protocols
• Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
• An Algebraic Approach to Nonmalleability
• Non-malleability amplification
• Multi-collision resistance: a paradigm for keyless hash functions
• Textbook non-malleable commitments
• Derandomization in Cryptography
• 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
• Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
• CCA security and trapdoor functions via key-dependent-message security