基于博弈论的安全多方计算的研究

doi:10.11959/j.issn.2096-109x.2018010

网络与信息安全学报 ›› 2018, Vol. 4 ›› Issue (1): 52-56.doi: 10.11959/j.issn.2096-109x.2018010

基于博弈论的安全多方计算的研究

张兴兰,郑炜()

北京工业大学信息学部，北京100124

修回日期:2017-12-09 出版日期:2018-01-01 发布日期:2018-02-09
作者简介:张兴兰（1970-），女，山西吕梁人，博士，北京工业大学教授，主要研究方向为密码学和安全协议。|郑炜（1989-），男，河北石家庄人，北京工业大学硕士生，主要研究方向为密码学、博弈论及安全多方计算。
基金资助:
国家自然科学基金资助项目(10007016201201)

Research on security multi-party computing based on game theory

Xinglan ZHANG,Wei ZHENG()

Department of Information Science,Beijing University of Technology,Beijing 100124,China

Revised:2017-12-09 Online:2018-01-01 Published:2018-02-09
Supported by:
The National Natural Science Foundation of China(10007016201201)

摘要/Abstract

摘要：

在经典的百万富翁协定中，参与者其中之一获取到财产大小的结论后，有可能不告诉另外一个参与者，也可以不遵守这个协议，结合博弈论可以避免这个问题，一个参与者一定会选择做出对自己有利的决定，因此，可以设计一个协议，遵循这个协议的参与者获得的利益大于背离这个协议的利益。目前，基于博弈论的问题计算效率较低，该协议通过引入一个二叉树大大提高了计算效率。

关键词: 博弈论, 百万富翁问题, 安全多方计算, 排序二叉树

Abstract:

In the classic millionaire agreement,one party can get the final wealth comparison results,you can not tell the other party,you can not comply with this agreement,combined with game theory can avoid this problem,you can make the participants away from the agreement proceeds less than compliance with the agreement,compliance with the agreement is the optimal strategy for the participant.At present,the problem of computational efficiency based on game theory is low,and the protocol greatly improves the computational efficiency by introducing a binary tree.

Key words: game theory, millionaire problem, secure multi-party computation, binary sort tree

中图分类号:

TP309

张兴兰,郑炜. 基于博弈论的安全多方计算的研究[J]. 网络与信息安全学报, 2018, 4(1): 52-56.

Xinglan ZHANG,Wei ZHENG. Research on security multi-party computing based on game theory[J]. Chinese Journal of Network and Information Security, 2018, 4(1): 52-56.

图/表 2

表1

博弈模型"

诚实参与者	攻击者
诚实参与者	发起攻击	不发动攻击
传送无用数据	$U_{A} - E_{A} - ε C_{A}^{+}, ε U^{+} + (1 - ε) U^{-} - E_{I}$	$- E_{A}, U$

表1

图1

参考文献 12

[13]	MALEKA S , AMJED S , RANGAN C P . The deterministic protocol for rational secret sharing[C]// The 22th IEEE International Parallel and Distributed Processing. 2008: 1-7.
[14]	IZMALKOV S , MICALI S , LEPINSKI M . Rational secure computation and ideal mechanism design[C]// The 46th Annual Symposium on Foundations of Computer Science (FOCS 2005). 2005: 585-595.
[15]	FUCHSBAUER G , KATZ J , NACCACHE D . Eficient rational secret sharing in the standard communication networks[C]// Theory of Cryptography Conf (TCC 2010). 2010: 419-436.
[16]	ASHAROV G , LINDELL Y . Utility dependence in correct and fair rational secret sharing[J]. Journal of Cryptology, 2011,24(1): 157-202.
[1]	GOLDREICH O . Secure multi-party computation[EB/OL]. .
[2]	CRAMER R , . Introduction to secure computation[M]// Lectures on Data Security.Berlin Heidelberg:Springer. 1999: 16-62.
[3]	YAO A C , . Protocols for secure computation[C]// The 23rd IEEE Symposium on Foundations of Computer Science(FOCS 1982). 1982: 160-164.
[4]	GOLDREICH O , MICALI S , WIGDERSON A . How to play any mental game[C]// The 19th Annual ACM Symposium on Theory of Computing(STOC 1987). 1987: 218-229.
[5]	GOLDREICH O . Foundations of cryptography:basic application[M]. Cambridge: Cambridge University PressPress, 2004.
[6]	QIN J , ZHANG Z F , FENG D G ,et al. A protocol of comparing information without leaking[J]. Journal of Software, 2004,15(3): 421-427.
[7]	LI S D , DAI Y Q , YOU Q Y . An efficient solution to Yao’s millionaires’problem[J]. Acta Electronica Sinica, 2005,33(5): 769-773.
[8]	ZHOU S G , LI F , TAO Y F ,et al. Privacy preservation in database applications:a survey[J]. Chinese Journal of Computers, 2009,32(5): 847-861.
[9]	ZHANG F , CHANG H Y . Privacy-preserving qutlier detection with oblivious third party[J]. Journal of Computer Research and Development, 2007,44(S): 226-231.
[10]	GORDON D , HAZAY C , KATZ J ,et al. Complete fairness in secure two-party computation[C]// The 40th Annual ACM Symposium on Theory of Computing (STOC 2008). 2008: 413-422.
[11]	HALPERN J , TEAGUE V . Rational secret sharing and multiparty computation[C]// The 36th Annual ACM Symposium on Theory of Computing(STOC 2004). 2004: 623-632.
[12]	KOL G , NAOR M . Cryptography and game theory:designing protocols for exchanging information[C]// The 5th Theory of Cryptography Conf (TCC 2008). 2008: 317-336.

基于博弈论的安全多方计算的研究

Research on security multi-party computing based on game theory

在线阅读

pdf下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 2

参考文献 12

相关文章 7

Metrics

推荐阅读 0

[1]	宋佳烁, 李祯祯, 丁海洋, 李子臣. 椭圆曲线上高效可完全模拟的不经意传输协议[J]. 网络与信息安全学报, 2023, 9(1): 158-166.
[2]	张宝, 田有亮, 高胜. 基于博弈论抗共谋攻击的全局随机化共识算法[J]. 网络与信息安全学报, 2022, 8(4): 98-109.
[3]	易杰, 曹腾飞, 郜帅, 黄建强. 车联网中基于攻防博弈的蜜罐防御及传输策略[J]. 网络与信息安全学报, 2022, 8(4): 157-167.
[4]	刘旭红, 孙晨. 保护隐私的有理数科学计算[J]. 网络与信息安全学报, 2022, 8(3): 97-110.
[5]	李梦慧,田有亮,冯金明. 常数轮公平理性秘密共享方案[J]. 网络与信息安全学报, 2017, 3(1): 61-67.
[6]	朱建明,高博. 社交金融的信息安全风险分析与防范[J]. 网络与信息安全学报, 2016, 2(3): 46-51.
[7]	朱建明,王秦. 基于博弈论的网络空间安全若干问题分析[J]. 网络与信息安全学报, 2015, 1(1): 43-49.