Three-Party Bit Commitment Based on Elliptic Curve
Yang Wei①②; Huang Liu-sheng①②; Wang Qi-yan③
①Department of Computer Science and Technology, USTC, Hefei 230026, China; ②National High Performance Computing Center at Hefei, Hefei 230026, China;③Department of Computer Science, UIUC, USA
Abstract:Bit commitment is a fundamental primitive in secure multi-party computation. It plays an important role in constructions of more complicated multi-party protocols. A new model of bit commitment named three-party bit commitment is proposed in this paper, in which two provers jointly commit a bit to a verifier. The protocol of three-party bit commitment based on elliptic curve cryptography is also given. The scheme is in purely classical means, without restricted assumptions of the computing power imposed on any participant. Moreover, the scheme is proven to be of unconditional security and be immune to channel eavesdropping. The protocol can also be modified easily to realize bit string commitment scheme.