姚氏百万富翁问题的高效解决方案

被引:42
作者
李顺东
戴一奇
游启友
机构
[1] 清华大学计算机科学与技术系
[2] 清华大学计算机科学与技术系 北京
[3] 北京
基金
国家自然科学基金重大项目; 中国博士后科学基金;
关键词
百万富翁问题; 多方保密计算; 不经意传输; 计算复杂性;
D O I
暂无
中图分类号
TN918 [通信保密与通信安全];
学科分类号
0839 ; 1402 ;
摘要
姚氏百万富翁问题解决方案已经成为许多多方保密计算问题解决方案的一个基本模块,但现有的解决方案效率低下,因而影响到其他多方保密计算方案的效率.本文利用长度函数与不经意传输设计了一个高效的解决方案,新方案同原有方案相比,计算复杂性明显降低.
引用
收藏
页码:769 / 773
页数:5
相关论文
共 13 条
[1]  
Protocols for secure computations. A Yao. Proceeding of the 23th IEEE Symposium on Foundations of Computer Science . 1982
[2]  
Efficient 1-out-of-n oblivious transfer schemes with universally usable parameters. Wen-Guey Tzeng. IEEE Transactions on Computers . 2004
[3]  
Efficient oblivious transfer protocols. M Naor,B Pinkas. Proc 12th Ann Symp Discrete Algorithms . 2001
[4]  
Comparing information without leaking it. Ronald Fagin,Moni Naor,Peter Einkler. Communications of the ACM . 1996
[5]  
Privacy preserving data mining. Y Lindell,B Pinkas. Journal of Cryptology . 2002
[6]  
Secure multi-party computational geometry. Mikhail J Atallah,Wenliang Du. In Seventh International Workshop on Algorithms and Data Structures (WADS 2001), Lecture Note in Computer Science 2125 . 2001
[7]  
Multi-party computations: Past and present. S Goldwasser. Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing . 1997
[8]  
How to play ANY mental game. Oded Goldreich,Silvio Micali,Avi Wigderson. Proceedings of the nineteenth annual ACM conference on Theory of computing . 1987
[9]  
Efficient private bidding and auction with an obvious third party. C Cachin. Proceeding of the 6th ACM conference on computer and communication security . 1999
[10]  
CryptographyandNetworkSecurity:PrinciplesandPractice. WilliamStallings. . 2003