An efficient bit commitment scheme based on factoring assumption

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.