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 String-Commitment from Weak Bit-Commitment

Kai-Min Chung, Feng-Hao Liu, Chi-Jen Lu, Bo‐Yin Yang

Published Jan 1, 2010• 9 citations
Publisher
DOI
10.1007/978-3-642-17373-8_16

Related papers

Efficient Committed Oblivious Transfer of Bit Strings

Mehmet Sabır Kiraz, Berry Schoenmakers, José Villegas

Lecture notes in computer science•Jan 1, 2007•15 citations

Implementable Quantum Bit String Commitment

Toyohiro Tsurumaru

IEICE Technical Report; IEICE Tech. Rep.•Jul 13, 2004•0 citations

Bit String Commitment Reductions with a Non-zero Rate

Anderson C. A. Nascimento, Joern Mueller-Quade, Hideki Imai

Lecture notes in computer science•Jan 1, 2004•1 citation

On the Efficiency of Bit Commitment Reductions

Samuel Ranellucci, Alain Tapp, Severin Winkler +1 more

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

Efficient Non-interactive Universally Composable String-Commitment Schemes

Ryo Nishimaki, Eiichiro Fujisaki, Keisuke Tanaka

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

An efficient bit commitment scheme based on factoring assumption

Ming Jun Zhong, Yixian Yang

Journal of Electronics (China)•Apr 1, 2001•1 citation