When Is a Semi-honest Secure Multiparty Computation Valuable?

被引:0
作者
Bhargava, Radhika [1 ]
Clifton, Chris [1 ]
机构
[1] Purdue Univ, W Lafayette, IN 47907 USA
来源
DECISION AND GAME THEORY FOR SECURITY | 2019年 / 11836卷
关键词
Secure multi party computation; Malicious and; semi-honest models; Incentive compatibility; GAME-THEORY; CRYPTOGRAPHY;
D O I
10.1007/978-3-030-32430-8_4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Secure Multiparty Computation protocols secure under the malicious model provide a strong guarantee of privacy and correctness. The semi-honest model provides what appears to be a much weaker guarantee, requiring parties to follow the protocol correctly. We show that for all but a small class of problems, those in the non-cooperatively computable class, the correctness guarantee of the malicious protocol effectively requires semi-honest parties as well. This suggests a wider utility than previously thought for semi-honest protocols.
引用
收藏
页码:45 / 64
页数:20
相关论文
共 39 条
  • [1] Abraham I., 2006, P 25 ANN ACM S PRINC, P53, DOI [10.1145/1146381.1146411.4,7, 10.1145/1146381.1146393]
  • [2] Supply chain coordination: Perspectives, empirical studies and research directions
    Arshinder, S.
    Kanda, Arun
    Deshmukh, S. G.
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 115 (02) : 316 - 335
  • [3] The middleman as a panacea for supply chain coordination problems
    Arya, Anil
    Loeftier, Clemens
    Mittendorf, Brian
    Pfeiffer, Thomas
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 240 (02) : 393 - 400
  • [4] Secure supply-chain protocols
    Atallah, MJ
    Elmongui, HG
    Deshpande, V
    Schwarz, LB
    [J]. IEEE INTERNATIONAL CONFERENCE ON E-COMMERCE, 2003, : 293 - 302
  • [5] Bartal Yair, 2003, P 9 C THEOR ASP RAT, P72, DOI 10.1145/846241.846250
  • [6] Bogetoft P, 2009, LECT NOTES COMPUT SC, V5628, P325, DOI 10.1007/978-3-642-03549-4_20
  • [7] Brandt F, 2002, FKI24502 TU MUNCH
  • [8] Cachon GP, 2004, INT SER OPER RES MAN, V74, P13
  • [9] Universally composable security: A new paradigm for cryptographic protocols
    Canetti, R
    [J]. 42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 136 - 145
  • [10] Canetti R., 2002, 34 ACM STOC, P494, DOI [10.1145/509907.509980, DOI 10.1145/509907.509980]