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

Journal of Communications

Efficient ID-based Non-Malleable Trapdoor Commitments Based on RSA and Factoring

Chunhui Wu, Qin Li, Dongyang Long

Published Jan 1, 2015• 0 citations
Publisher
DOI
10.12720/jcm.10.5.330-338

Related papers

Multi-Trapdoor Commitments and their Applications to Non-Malleable Protocols.

Rosario Gennaro

•Jan 1, 2003•10 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

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

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