Abstract
Recently, many bit commitment schemes have been presented. This paper presents a new practical bit commitment scheme based on Schnorr’s one-time knowledge proof scheme, where the use of cut-and-choose method and many random exam candidates in the protocols are replaced by a single challenge number. Therefore the proposed bit commitment scheme is more efficient and practical than the previous schemes. In addition, the security of the proposed scheme under factoring assumption is proved, thus the cryptographic basis of the proposed scheme is clarified.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. Damgard, Practical and provably secure release of a secret and exchange of signatures, Journal of Cryptology, 8(1995)3, 201–222.
E. Fujisaki, T. Okamoto, Statistical zero knowledge protocols to prove modular polynomial relations, Proc. of Crypto97, LNCS 1294, Springer-Verlag, 1997, 16–29.
C. P. Schnorr, Efficient identification and signatures for smart cards, Proc. of Crypto89, LNCS 435, Springer-Verlag, 1990, 235–251.
J. van de Graaf, R. Peralta, A simple and secure way to show the validity of your public key, Proc. of Crypto87, LNCS 293, Springer-Verlag, 1988, 128–134.
T. Okamoto, An efficient divisible electronic cash scheme, Proc. of Crypto95, LNCS 963, Springer-Verlag, 1995, 438–451.
U. Feige, A. Fiat, A. Shamir, Zero knowledge proofs of identity, Journal of Cryptology, 1(1988)2, 77–94.
Author information
Authors and Affiliations
Additional information
Supported by the National Natural Science Foundation of China(No.69772035, 69882002) and “863” Programme
About this article
Cite this article
Zhong, M., Yang, Y. An efficient bit commitment scheme based on factoring assumption. J. of Electron.(China) 18, 155–159 (2001). https://doi.org/10.1007/s11767-001-0021-8
Issue Date:
DOI: https://doi.org/10.1007/s11767-001-0021-8