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 and Non-interactive Non-malleable Commitment

Giovanni Di Crescenzo, Jonathan I. Katz, Rafail Ostrovsky, Adam Smith

Published Jan 1, 2001• 122 citations
Publisher
DOI
10.1007/3-540-44987-6_4

Related papers

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

Efficient Non-malleable Commitment Schemes

Marc Fischlin, Roger Fischlin

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

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

Three-Round Non-malleable Commitment

Michele Ciampi, Luisa Siniscalchi

Information security and cryptography•Aug 21, 2025•0 citations

Concurrent non-malleable statistically hiding commitment

Zongyang Zhang, Zhenfu Cao

Information Processing Letters•Mar 6, 2012•1 citation