A brief survey on secure multi-party computing in the presence of rational parties

被引:0
|
作者
Yilei Wang
Tao Li
Hairong Qin
Jin Li
Wei Gao
Zhe Liu
Qiuliang Xu
机构
[1] Ludong University,School of Information and Electrical Engineering
[2] Fujian Normal University,Fujian Provincial Key Laboratory of Network Security and Cryptology
[3] Guangzhou University,School of Computer Science and Educational Software
[4] Ludong University,School of Mathematics and Statistics Science
[5] University of Luxembourg,Laboratory of Algorithmics, Cryptology and Security
[6] Shandong University,School of Computer Science and Technology
关键词
Game Theory; Nash equilibrium; Intelligent agents; Rational secret sharing; Rational secure multi-party computing;
D O I
暂无
中图分类号
学科分类号
摘要
Intelligent agents (IA) are autonomous entities which observe through sensors and act upon an environment using actuators to adjust their activities towards achieving certain goals. The architectures of agents have enormous potentials when they are applied into critical systems, where agents choose actions between working with their own and cooperating with others. Rational utility-based agents choose actions to maximize their expected utilities. Rational secure multi-party computing (RSMPC) means secure multi-party computing (SMPC) in the presence of rational utility-based agents. Here, we call them rational parties. In this paper certain goals of rational parties are maximizing their utilities. The introduction of rational parties considers the incentives in executing protocols. The security definitions under rational framework can better demonstrate the executing environment of real protocols. Furthermore, rational two-party computing removes some impossibility in traditional two-party computing, such as fairness. This paper represents the research status of RSMPC and some typical protocols. The advantages and disadvantages of previous rational SMPC protocols are discussed here. As an emerging field, there are still lots of open problems in RSMPC, such as communication channels, utility assumptions and equilibrium notions etc.
引用
收藏
页码:807 / 824
页数:17
相关论文
共 50 条
  • [21] Optimally Efficient Multi-party Fair Exchange and Fair Secure Multi-party Computation
    Alper, Handan Kilinc
    Kupcu, Alptekin
    ACM TRANSACTIONS ON PRIVACY AND SECURITY, 2022, 25 (01)
  • [22] Quantum secure multi-party computational geometry based on multi-party summation and multiplication
    Dou, Zhao
    Wang, Yifei
    Liu, Zhaoqian
    Bi, Jingguo
    Chen, Xiubo
    Li, Lixiang
    QUANTUM SCIENCE AND TECHNOLOGY, 2024, 9 (02)
  • [23] Social rational secure multi-party computation (vol 26, pg 1067, 2014)
    Wang, Yilei
    Liu, Zhe
    Wang, Hao
    Xu, Qiuliang
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2016, 28 (09): : 2748 - 2748
  • [24] Multi-party Quantum Secure Direct Communication
    Tan, Xiaoqing
    Zhang, Xiaoqian
    Liang, Cui
    2014 NINTH INTERNATIONAL CONFERENCE ON P2P, PARALLEL, GRID, CLOUD AND INTERNET COMPUTING (3PGCIC), 2014, : 251 - 255
  • [25] Information theory and secure multi-party computation
    Maurer, UM
    1998 INFORMATION THEORY WORKSHOP - KILLARNEY, IRELAND, 1998, : 152 - 153
  • [26] Secure multi-party computation without agreement
    Goldwasser, S
    Lindell, Y
    JOURNAL OF CRYPTOLOGY, 2005, 18 (03) : 247 - 287
  • [27] SECURE MULTI-PARTY CONSENSUS GOSSIP ALGORITHMS
    Lazzeretti, Riccardo
    Horn, Steven
    Braca, Paolo
    Willett, Peter
    2014 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2014,
  • [28] Secure multi-party computation over networks
    Nishitani, Y
    Igarashi, Y
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2000, E83D (03) : 561 - 569
  • [29] Secure multi-party computation made simple
    Maurer, U
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (02) : 370 - 381
  • [30] Secure multi-party computation with a quantum manner
    Lu, Changbin
    Miao, Fuyou
    Hou, Junpeng
    Su, Zhaofeng
    Xiong, Yan
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2021, 54 (08)