Simulation-Based Concurrent Non-malleable Commitments and Decommitments

DOI10.1007/978-3-642-00457-5_7MaRDI QIDQ3611761zbMATH OpenOpenAlexFDO

Authors Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti

Publication date 3 March 2009

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00457-5_7

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Constant-round concurrent non-malleable statistically binding commitments and decommitments
• Non-black-box simulation in the fully concurrent setting
• Non-black-box simulation in the fully concurrent setting, revisited
• Concurrent Nonmalleable Commitments
• Simulation refinement for concurrency verification
• Simulation Refinement for Concurrency Verification
• Concurrent non-malleable commitments (and more) in 3 rounds
• Simulating truly concurrent CSP
• An alternative approach to non-black-box simulation in fully concurrent setting

Cited in

(7)

• Concurrent non-malleable commitments (and more) in 3 rounds
• New constructions of efficient simulation-sound commitments using encryption and their applications
• Constant-round concurrent non-malleable statistically binding commitments and decommitments
• Concurrent non-malleable statistically hiding commitment
• Four-round black-box non-malleable schemes from one-way permutations
• Non-interactive commitment from non-transitive group actions
• Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme

This page was built for publication: Simulation-Based Concurrent Non-malleable Commitments and Decommitments

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