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 Shanghai Jiaotong University (Science)

Non-interactive and non-malleable commitment scheme based on q-one way group homomorphisms

Zongyang Zhang, Xiaolei Dong, Zhenfu Cao

Published Oct 1, 2008• 0 citations
Publisher
DOI
10.1007/s12204-008-0574-x

Related papers

Non-interactive and Non-malleable Commitment Scheme Based on q-one Way Group Homomorphisms

张宗洋, 董晓蕾, 曹珍富

上海交通大学学报：英文版•Jan 1, 2008•0 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

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

Efficient Non-Malleable Commitment Schemes

Marc Fischlin, Roger Fischlin

Journal of Cryptology•Apr 28, 2009•8 citations

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

Concurrent Non-malleable Commitments from Any One-Way Function

Huijia Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam

Springer eBooks•Feb 25, 2008•88 citations