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

Efficient Non-interactive Universally Composable String-Commitment Schemes

Ryo Nishimaki, Eiichiro Fujisaki, Keisuke Tanaka

Published Jan 1, 2009• 17 citations
Publisher
DOI
10.1007/978-3-642-04642-1_3

Related papers

Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security

Marc Fischlin, Benoît Libert, Mark Manulis

Lecture notes in computer science•Jan 1, 2011•46 citations

Adaptive and Composable Non-interactive String-Commitment Protocols

Huafei Zhu, Tadashi Araragi, Takashi Nishide +1 more

Communications in computer and information science•Jan 1, 2012•0 citations

Efficient and Universally Composable Committed Oblivious Transfer and Applications

Juan A. Garay, PHILIP D. MACKENZIE, Ke Yang

Springer eBooks•Jan 26, 2007•2 citations

Efficient and Universally Composable Committed Oblivious Transfer and Applications

Juan A. Garay, PHILIP D. MACKENZIE, Ke Yang

Lecture notes in computer science•Jan 1, 2004•60 citations

Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption

Yehuda Lindell

Lecture notes in computer science•Jan 1, 2011•88 citations

Universally Composable Commitments

Ran Canetti, Marc Fischlin

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