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

New Constructions for Reusable, Non-erasure and Universally Composable Commitments

Huafei Zhu

Published Jan 1, 2009• 4 citations
Publisher
DOI
10.1007/978-3-642-00843-6_10

Related papers

Constructions for commitment with non-malleability and universal composability

陵 西巻

•Jan 1, 2010•0 citations

Efficient Non-interactive Universally Composable String-Commitment Schemes

圭介 田中, Keisuke Tanaka, 陵 西巻 +3 more

•Nov 1, 2009•0 citations

Efficient Non-interactive Universally Composable String-Commitment Schemes

Ryo Nishimaki, Eiichiro Fujisaki, Keisuke Tanaka

Lecture notes in computer science•Jan 1, 2009•16 citations

Universally Composable Commitments

Ran Canetti, Marc Fischlin

Lecture notes in computer science•Jan 1, 2001•627 citations

An Efficient Non-interactive Universally Composable String-Commitment Scheme

圭介 田中, Keisuke Tanaka, 陵 西巻 +3 more

•Jan 1, 2012•0 citations

Universally Composable Commitments (Extended Abstract)

Ran Canetti, Marc Fischlin

International Cryptology Conference•Jan 1, 2001•3 citations