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

Efficient Non-malleable Commitment Schemes

Marc Fischlin, Roger Fischlin

Published Jan 1, 2000• 84 citations
Publisher
DOI
10.1007/3-540-44598-6_26

Related papers

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

Journal of Cryptology•May 12, 2009•27 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

Simple, Fast, Efficient, and Tightly-Secure Non-malleable Non-interactive Timed Commitments

Peter Chvojka, Tibor Jager

Lecture notes in computer science•Jan 1, 2023•11 citations

Computational Soundness of Non-Malleable Commitments

David Galindo, Flavio D. Garcia, Peter van Rossum

Lecture notes in computer science•Jan 1, 2008•13 citations

Non-interactive and non-malleable commitment scheme based on q-one way group homomorphisms

Zongyang Zhang, Xiaolei Dong, Zhenfu Cao

Journal of Shanghai Jiaotong University (Science)•Oct 1, 2008•0 citations