¡@
Journal of Information Science and Engineering, Vol. 24 No.
2, pp. 441-452 (March 2008)
Biased Bit Commitment and Applications*
Li-Cheng Wang, Zhen-Fu Cao, Feng Cao, Hai-Feng Qian and Hai-Yong Bao
Department of Computer Science and Engineering
Shanghai Jiao Tong University
Shanghai, 200030, P.R.C.
We bring forward the primitive of biased bit commitment, define the security of the
model, and present a concrete biased bit commitment scheme based on the braid conjugator
search problem. The presented scheme is proved to be information-theoretically
hiding and computationally binding in the defined model. Finally, to argue the usefulness
of this work, we also sketch out some new applications based on this new primitive.
Keywords:
biased bit commitment, braid group, conjugactor search problem, coin tossing,
lot-casting
Retrieve PDF document (200803_08.pdf)
Received January 9, 2006; revised May 18 & July 26, 2006; accepted August 28, 2006.
Communicated by Tzong-Chen Wu.
*This work was supported in part by the National Science Fund for Distinguished Young Scholars under grant
No. 60225007, the National Research Fund for the Doctoral Program of Higher Education of China under
grant No. 20020248024, and the Science and Technology Research Project of Shanghai under grants No.
04JC14055 and 046407067.