Constant-round non-malleable commitments from any one-way function

DOI10.1145/1993636.1993730zbMath1288.68022OpenAlexW2051078457MaRDI QIDQ5419141

Huijia Lin, Rafael Pass

Publication date: 5 June 2014

Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.8844

zbMATH Keywords

cryptographyconstant-round protocolscommitmentsnon-malleability

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Network protocols (68M12)

Related Items (26)

Concurrent knowledge extraction in public-key models ⋮ Non-malleable codes for bounded parallel-time tampering ⋮ One-message zero knowledge and non-malleable commitments ⋮ Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ The security of lazy users in out-of-band authentication ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ Adaptively secure computation for RAM programs ⋮ Non-malleable commitments against quantum attacks ⋮ Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ Four-round black-box non-malleable schemes from one-way permutations ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Concurrent non-malleable statistically hiding commitment ⋮ Non-malleable vector commitments via local equivocability ⋮ Non-malleable time-lock puzzles and applications ⋮ An Algebraic Approach to Nonmalleability ⋮ Cryptography Using Captcha Puzzles ⋮ Non-malleable vector commitments via local equivocability ⋮ Round-optimal secure multi-party computation ⋮ Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security ⋮ Post-quantum multi-party computation ⋮ Black-box non-interactive non-malleable commitments ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds ⋮ Constant-Round Nonmalleable Commitments from Any One-Way Function

This page was built for publication: Constant-round non-malleable commitments from any one-way function