An Algebraic Approach to Nonmalleability
From MaRDI portal
Publication:5157398
DOI10.1137/16M1073595OpenAlexW3203247576MaRDI QIDQ5157398
Silas Richelson, Vipul Goyal, Margarita Vald, Alon Rosen
Publication date: 18 October 2021
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1073595
Related Items
On non-uniform security for black-box non-interactive CCA commitments, Black-box non-interactive non-malleable commitments
Cites Work
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- Four-round concurrent non-malleable commitments from one-way functions
- Round optimal concurrent non-malleability from polynomial hardness
- Promise zero knowledge and its applications to round optimal MPC
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds
- How to share a secret
- Position Based Cryptography
- Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
- Universally composable two-party and multi-party secure computation
- Bounded-concurrent secure multi-party computation with a dishonest majority
- New and improved constructions of non-malleable cryptographic protocols
- A Pseudorandom Generator from any One-way Function
- Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
- A unified framework for concurrent security
- Textbook non-malleable commitments
- 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
- Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
