期刊文献+

基于博弈论的百万富翁协议 被引量:1

Millionaires' Protocol Based on Game Theory
下载PDF
导出
摘要 在经典的百万富翁协议中,一方在得到最后的财富比较结果后,没有动机将结果告诉另一方,或者告诉另一方一个错误的结果。结合博弈论和密码算法,提出一种百万富翁协议。在此协议中,参与者背离协议的收益小于遵守协议的收益,遵守协议是参与者的最优策略,任何百万富翁的欺骗行为都能被鉴别和发现,因此理性的参与者有动机发送正确的数据。最后每个参与者都能公平地得到最后的财富比较结果。 In the setting of classical millionaires' problem,one party maybe tell the other party a wrong value,and he has no incentive to tell the true comparative result.Combining game theory and cryptography,this paper proposed a millionaires' protocol.In the protocol,the participant's payoff of following the protocol is more than the payoff of deviation.It is a best strategy for participant to abide by the protocol,and any cheating of Millionaire can be detected.So rational party has an incentive to abide by the protocol.Finally,every party can obtain the comparative result of wealth.
作者 冯云芝 张恩
出处 《计算机科学》 CSCD 北大核心 2014年第12期129-132,共4页 Computer Science
基金 国家自然科学基金项目(61170221 U1204606)资助
关键词 百万富翁问题 博弈论 安全两方计算 公平性 Millionaires' problem Game theory Secure two-party computation Fairness
  • 相关文献

参考文献21

  • 1Yao A. Protocols for secure computations[C]//Proc 23th IEEE Symposium on Foundations of Computer Science ( FOCS' 82). Los Alamitors, CA.. IEEE Computer Society, 1982 : 160-164.
  • 2Yao A. How to generate and exchange secrets[C]//Proc 27th IEEE Symposium on Foundations of Computer Science(FOC~' 86). Los Alamitors,CA:IEEE Computer Society, 1986:162-167.
  • 3Goldreich O, Micali S, Wigderson A. How to play any mental game[C]//Proc of the 19th Annual ACM Symposium on Theory of Computing. New York:ACM Press,1987..218-229.
  • 4Goldreieh O. Foundations of cryptography-Volume 2, Basic Ap- plications[M]. Cambridge: Cambridge University Press, 2004: 599-759.
  • 5秦静,张振峰,冯登国,李宝.无信息泄漏的比较协议[J].软件学报,2004,15(3):421-427. 被引量:49
  • 6Lindell Y. Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries[C] // Advances in Cryptology-Crypto,LNCS 8043. Berlin: Springer, 2013:1-17.
  • 7Yan Huang,Katz J, Evans D. Efficient Secure Two-Party Com putation Using Symmetric Cut-and-Choose [ C] // Advances in Cryptology-Crypto, LNCS 8043. Berlin: Springer, 2013 : 18-35.
  • 8孙茂华,罗守山,辛阳,杨义先.安全两方线段求交协议及其在保护隐私凸包交集中的应用[J].通信学报,2013,34(1):30-42. 被引量:9
  • 9李顺东,戴一奇,游启友.姚氏百万富翁问题的高效解决方案[J].电子学报,2005,33(5):769-773. 被引量:43
  • 10Li Shun-dong,Wang Dao-shun, Dai Yi-qi, et al. Symmetric cryp- tographic solution to Yao's millionaires' problem and an evalu- ation of secure multiparty computations[J]. Information Sci- ences, 2008,178(1): 244 -255.

二级参考文献96

共引文献108

同被引文献8

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部