Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Computational Soundness of Non-Malleable Commitments

David Galindo, Flavio D. Garcia, Peter van Rossum

Published Jan 1, 2008• 13 citations
Publisher
DOI
10.1007/978-3-540-79104-1_26

Related papers

Efficient Non-malleable Commitment Schemes

Marc Fischlin, Roger Fischlin

Journal of Cryptology•May 12, 2009•27 citations

Efficient Non-Malleable Commitment Schemes

Marc Fischlin, Roger Fischlin

Journal of Cryptology•Apr 28, 2009•8 citations

Efficient Non-malleable Commitment Schemes

Marc Fischlin, Roger Fischlin

Lecture notes in computer science•Jan 1, 2000•84 citations

Efficient and Non-interactive Non-malleable Commitment

Giovanni Di Crescenzo, Jonathan I. Katz, Rafail Ostrovsky +1 more

Lecture notes in computer science•Jan 1, 2001•122 citations

Concurrent Non-Malleable Commitments (and More) in 3 Rounds

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi +1 more

Lecture notes in computer science•Jan 1, 2016•35 citations

Non-malleability vs. CCA-Security: The Case of Commitments

Brandon Broadnax, Valerie Fetzer, Jörn Müller‐Quade +1 more

Lecture notes in computer science•Jan 1, 2018•5 citations