基于椭圆曲线的三方比特承诺.pdf

第31 卷第5 期 电 子 与 信 息 学 报 Vol.31No.5 2009 年5 月 Journal of Electronics Information Technology May 2009 基于椭圆曲线的三方比特承诺 杨 威①② 黄刘生①② 王启研③ ①(中国科学技术大学计算机科学与技术系 合肥 230026) ②(国家高性能计算中心(合肥) 合肥 230026) ③(伊利诺伊大学厄本那-香槟分校计算机科学系 美国) 摘 要：比特承诺是安全多方计算中最重要的基础协议之一，对构建更复杂的多方协议起着重要作用。该文提出了 三方比特承诺模型，在该模型中，由两个证明者共同向一个验证者作出承诺。给出了基于椭圆曲线的三方比特承诺 方案，经证明，尽管该方案完全基于经典计算环境，但是并不需要对协议参与方的计算能力作任何限制性假设，具 有无条件安全性且对信道窃听免疫。该方案同时可以推广到比特串承诺协议。 关键词：密码学；比特承诺；三方模型；椭圆曲线；无条件绑定；无条件保密 中图分类号：TP309 文献标识码：A 文章编号：1009-5896(2009)05-1049-05 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