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

Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments

Zhenfu Cao, Ivan Visconti, Zongyang Zhang

Published Jan 1, 2010• 12 citations
Publisher
DOI
10.1007/978-3-642-13013-7_12

Related papers

Constant-Round Concurrent Non-Malleable Commitments and Decommitments.

Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti

•Jan 1, 2008•2 citations

Simulation-Based Concurrent Non-malleable Commitments and Decommitments

Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti

Lecture notes in computer science•Jan 1, 2009•16 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, Luisa Siniscalchi

Information security and cryptography•Aug 21, 2025•0 citations

Concurrent non-malleable statistically hiding commitment

Zongyang Zhang, Zhenfu Cao

Information Processing Letters•Mar 6, 2012•1 citation

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