AN EFFICIENT BIT COMMITMENT SCHEME BASED ON FACTORING ASSUMPTION  

作　　者：Zhong Ming Yang Yixian (information Security Center, Beijing Univ. of Posts and Telecomm. Beijing 100876) 

出　　处：《Journal of Electronics(China)》2001年第2期155-159,共5页电子科学学刊（英文版）

基　　金：Supported by the National Natural Science Foundation of China(No.69772035,69882002) and "863" Programme

摘　　要：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.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.

关 键 词：BIT COMMITMENT FACTORING ASSUMPTION One-time knowledge PROOF Probabilistic POLYNOMIAL-TIME oracle 

分 类 号：TN[电子电信]