An Algebraic Approach to Nonmalleability

DOI10.1137/16M1073595MaRDI QIDQ5157398zbMATH OpenOpenAlexFDO

Authors Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald

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

zbMATH Keywords

commitmentsnonmalleabilityzero-knowledge

Mathematics Subject Classification ID

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

Recommendations

• New and Improved Constructions of Nonmalleable Cryptographic Protocols
• Textbook non-malleable commitments
• New and improved constructions of non-malleable cryptographic protocols
• Constant-round non-malleable commitments from any one-way function
• Constant-Round Nonmalleable Commitments from Any One-Way Function

Cites work

• A Pseudorandom Generator from any One-way Function
• A unified framework for concurrent security
• Bit commitment using pseudorandomness
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Concurrent non-malleable commitments (and more) in 3 rounds
• Concurrent Non-malleable Commitments from Any One-Way Function
• 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
• Four-round concurrent non-malleable commitments from one-way functions
• How to share a secret
• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 2009981 (Why is no real title available?)
• New and improved constructions of non-malleable cryptographic protocols
• Position Based Cryptography
• Promise zero knowledge and its applications to round optimal MPC
• Round optimal concurrent non-malleability from polynomial hardness
• Textbook non-malleable commitments
• Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
• Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
• Universally composable two-party and multi-party secure computation
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments

Cited in

(4)

• Black-box non-interactive non-malleable commitments
• On non-uniform security for black-box non-interactive CCA commitments
• Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
• Four-round statistical non-malleable zero-knowledge

This page was built for publication: An Algebraic Approach to Nonmalleability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5157398)