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

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

Peter Chvojka, Tibor Jager

Published Jan 1, 2023• 11 citations
Publisher
DOI
10.1007/978-3-031-31368-4_18

Related papers

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•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 Non-malleable Commitment Schemes

Marc Fischlin, Roger Fischlin

Journal of Cryptology•May 12, 2009•27 citations

Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments

Dana Dachman-Soled, Tal Malkin, Mariana Raykova +1 more

Lecture notes in computer science•Jan 1, 2013•26 citations

Concurrent Non-malleable Commitments from Any One-Way Function

Huijia Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam

Springer eBooks•Feb 25, 2008•88 citations