Black-box non-interactive non-malleable commitments

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

Authors: Rachit Garg, Dakshita Khurana, Brent Waters, 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

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

Cites Work

• Practical and provably-secure commitment schemes from collision-free hashing
• Title not available (Why is that?)
• Constant-round non-malleable commitments from any one-way function
• Derandomization in Cryptography
• 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
• Non-malleability amplification
• Constant round non-malleable protocols using one way functions
• Concurrent Non-malleable Commitments from Any One-Way Function
• New and Improved Constructions of Nonmalleable Cryptographic Protocols
• Simple, Black-Box Constructions of Adaptively Secure Protocols
• Multi-collision resistance: a paradigm for keyless hash functions
• New techniques for noninteractive zero-knowledge
• 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
• Adaptive hardness and composable security in the plain model from standard assumptions
• Concurrent non-malleable commitments (and more) in 3 rounds
• Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
• Textbook non-malleable commitments
• Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
• 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
• An Algebraic Approach to Nonmalleability
• CCA security and trapdoor functions via key-dependent-message security

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)