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

Information security and cryptography

Three-Round Non-malleable Commitment

Michele Ciampi, Luisa Siniscalchi

Published Aug 21, 2025• 0 citations
Publisher
DOI
10.1007/978-3-031-92374-6_6

Related papers

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

4-Round Concurrent Non-Malleable Commitments from One-Way Functions

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi +1 more

•Jan 1, 2016•5 citations

Four-Round Concurrent Non-Malleable Commitments from One-Way Functions

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi +1 more

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

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