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

Two-Message Non-Malleable Commitments from Standard Sub-exponential Assumptions.

Dakshita Khurana, Amit Sahai

Published Jan 1, 2017• 7 citations
OpenAlex

Related papers

Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions

Rafael Pass, Hoeteck Wee

Lecture notes in computer science•Jan 1, 2010•58 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

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

Efficient Non-malleable Commitment Schemes

Marc Fischlin, Roger Fischlin

Lecture notes in computer science•Jan 1, 2000•84 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