Black-box non-interactive non-malleable commitments
type: Item
instance of: scholarly article
title: Black-box non-interactive non-malleable commitments
DOI: 10.1007/978-3-030-77883-5_6
author: Rachit Garg
author: Dakshita Khurana
author: Brent Waters
author: George Jingfeng Lu
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7440637
MaRDI profile type: Publication
full work available at URL: 978-3-030-77883-5 6
OpenAlex ID: W3095459062
cites work: Derandomization in Cryptography
cites work: Multi-collision resistance: a paradigm for keyless hash functions
cites work: One-message zero knowledge and non-malleable commitments
cites work: Non-malleability vs. CCA-security: the case of commitments
cites work: Adaptive hardness and composable security in the plain model from standard assumptions
cites work: Simple, Black-Box Constructions of Adaptively Secure Protocols
cites work: Concurrent Non-Malleable Commitments (and More) in 3 Rounds
cites work: Four-round concurrent non-malleable commitments from one-way functions
cites work: Q4341752
cites work: Constant round non-malleable protocols using one way functions
cites work: Textbook non-malleable commitments
cites work: An Algebraic Approach to Nonmalleability
cites work: New Techniques for Noninteractive Zero-Knowledge
cites work: Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
cites work: Non-interactive non-malleability from quantum supremacy
cites work: Round optimal concurrent non-malleability from polynomial hardness
cites work: CCA security and trapdoor functions via key-dependent-message security
cites work: Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
cites work: Non-malleability amplification
cites work: Constant-round non-malleable commitments from any one-way function
cites work: Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
cites work: Concurrent Non-malleable Commitments from Any One-Way Function
cites work: Adaptive One-Way Functions and Applications
cites work: New and improved constructions of non-malleable cryptographic protocols
cites work: New and Improved Constructions of Nonmalleable Cryptographic Protocols
cites work: Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
cites work: Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
description: scientific article; zbMATH DE number 7440637