首页 | 本学科首页   官方微博 | 高级检索  
     

无信息泄漏的比较协议
引用本文:秦静,张振峰,冯登国,李宝.无信息泄漏的比较协议[J].软件学报,2004,15(3):421-427.
作者姓名:秦静  张振峰  冯登国  李宝
作者单位:1. 山东大学,数学与系统科学学院,山东,济南,250100;信息安全国家重点实验室(中国科学院 研究生院),北京,100039
2. 信息安全国家重点实验室(中国科学院 研究生院),北京,100039
基金项目:Supported by the National Natural Science Foundation of China under Grant No.60373039 (国家自然科学基金); the National High-Tech Research and Development Plan of China under Grant Nos.2001AA144040, 2003AA144151(国家高技术研究发展计划(863)); the National Grand Fundamental Re
摘    要:关于安全多方计算的研究是目前国际密码学界的研究热点.如果能够安全地计算任何函数,就掌握了一个很强大的工具,实际上任何一个密码协议都可以化归一个特殊的安全多方计算协议.特殊的安全多方计算协议的设计与分析又是当前人们致力研究的课题.基于φ-隐藏假设以及同态公钥加密体制的语义安全性假设,给出了一个特殊的安全双方计算协议--无信息泄漏的比较相等协议.该协议具有公平性:一方知道最后结果的等价条件为另一方也知道这个结果;安全性:除了最后结果以外,不泄露有关双方输入的任何信息;有效性:借助于茫然第三方协助完成计算任务,使协议简单有效,但这个第三方不知道最后结果及参与方的秘密,也不能与参与方串谋作弊;并对协议的正确性与安全性进行了理论证明.该协议在网上投标(拍卖)、网上商业谈判、电子选举等领域中有着广阔的应用前景.

关 键 词:安全多方计算  计算不可区分  同态加密  公钥密码体制  φ-隐藏假设  △-通用hash函数
文章编号:1000-9825/2004/15(03)0421
收稿时间:2002/12/19 0:00:00
修稿时间:9/9/2003 12:00:00 AM

A Protocol of Comparing Information without Leaking
QIN Jing,ZHANG Zhen-Feng,FENG Deng-Guo and LI Bao.A Protocol of Comparing Information without Leaking[J].Journal of Software,2004,15(3):421-427.
Authors:QIN Jing  ZHANG Zhen-Feng  FENG Deng-Guo and LI Bao
Abstract:At present, research on secure multi-party computation is of great interest in modern cryptography. It should be acknowledged that if any function can be computed securely, then it results in a very powerful tool. In fact, all natural protocols are, or can be rephrased to be, special cases of the multi-party computation problems. Design and analysis of the special multi-party computation protocols is meaningful and has attracted much interest in this field. Based on the combination of a public-key cryptosystem of the homomorphic encryption and on the theoretic construction relying on the F-hiding assumption, a protocol for comparing information of equality is proposed. The protocol needs only a single round of interaction and ensures fairness, efficiency and security. The protocol is fair, which means that one party knows the sound result of the comparison if and only if the other one knows the result. The protocol is efficient with the help of an oblivious third party for calculating. However, the third party cannot learn any information about the participant's private inputs and even about the comparison result, and cannot collude with any participant. The protocol is secure for the two participants, that is, any information about their secret input will not leak except the final computation result. A precise proof of security of the protocol is presented. Applications of this protocol may include private bidding and auctions, secret ballot elections, commercial business, identification in a number of scenarios and so on. It is believed that the protocol may be of practical significance for electronic transaction.
Keywords:secure multi-party computation  computationally indistinguishable  public-key cryptosystem  homomorphic encryption  F-hiding assumption  D-universal hash function
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号