Fairness in the presence of semi-rational parties in rational two-party secure computation

被引:0
|
作者
机构
[1] Sun, Zhonghong
关键词
Adversary modeling - Fairness - Nash equilibria - Real-world - Secure computation - Semi-rational party;
D O I
10.1504/IJGUC.2013.056245
中图分类号
学科分类号
摘要
Reputation is commonly used in game theory for mutual cooperation. Assuming that parties value their reputation as well as their payoffs just like people in the real world, this paper considers reputation assumptions when defining the utilities. The new utility consists of two parts: the reputation part and payoff part. The parties are redefined according to the new utility definition. Besides, to represent a more realistic adversary model, a new adversary named semirational party is proposed. The semi-rational parties behave like the combination of rational and covert parties. At last, a rational two-party secure computation protocol is constructed. The proof of fairness in the presence of the semi-rational party is stressed in this paper. Copyright © 2013 Inderscience Enterprises Ltd.
引用
收藏
页码:2 / 3
相关论文
共 50 条
  • [41] An improved secure two-party computation protocol
    Yu, Y
    Leiwo, J
    Premkumar, B
    INFORMATION SECURITY AND CRYPTOLOGY, PROCEEDINGS, 2005, 3822 : 221 - 232
  • [42] Secure Two-Party Computation with Low Communication
    Damgard, Ivan
    Faust, Sebastian
    Hazay, Carmit
    THEORY OF CRYPTOGRAPHY (TCC 2012), 2012, 7194 : 54 - 74
  • [43] Efficient Fair Secure Two-Party Computation
    Ruan, Ou
    Zhou, Jing
    Zheng, Minghui
    Cui, Guohua
    2012 IEEE ASIA-PACIFIC SERVICES COMPUTING CONFERENCE (APSCC), 2012, : 243 - 248
  • [44] Fairplay - A secure two-party computation system
    Malkhi, D
    Nisan, N
    Pinkas, B
    Sella, Y
    USENIX ASSOCIATION PROCEEDINGS OF THE 13TH USENIX SECURITY SYMPOSIUM, 2004, : 287 - 302
  • [45] Impossibility of secure two-party classical computation
    Colbeck, Roger
    PHYSICAL REVIEW A, 2007, 76 (06)
  • [46] Secure Two-Party Computation in a Quantum World
    Buescher, Niklas
    Demmler, Daniel
    Karvelas, Nikolaos P.
    Katzenbeisser, Stefan
    Kraemer, Juliane
    Rathee, Deevashwer
    Schneider, Thomas
    Struck, Patrick
    APPLIED CRYPTOGRAPHY AND NETWORK SECURITY (ACNS 2020), PT I, 2020, 12146 : 461 - 480
  • [47] Adaptively Secure Two-Party Computation with Erasures
    Lindell, Andrew Y.
    TOPICS IN CRYPTOLOGY - CT-RSA 2009, PROCEEDINGS, 2009, 5473 : 117 - 132
  • [48] Secure Two-Party Computation: A Visual Way
    D'Arco, Paolo
    De Prisco, Roberto
    INFORMATION THEORETIC SECURITY, ICITS 2013, 2014, 8317 : 18 - 38
  • [49] Rational secret sharing with semi-rational players
    Wang, Yilei
    Wang, Hao
    Xu, Qiuliang
    INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING, 2012, 3 (01) : 59 - 67
  • [50] Secure two-party computation of Squared Euclidean Distances in the presence of malicious adversaries
    Mouffron, Marc
    Rousseau, Frederic
    Zhu, Huafei
    INFORMATION SECURITY AND CRYPTOLOGY, 2008, 4990 : 138 - 152