Two Round Information-Theoretic MPC with Malicious Security

被引：18

作者：

Ananth, Prabhanjan ^{[1
]}

Choudhuri, Arka Rai ^{[2
]}

Goel, Aarushi ^{[2
]}

Jain, Abhishek ^{[2
]}

机构：

[1] MIT, 77 Massachusetts Ave, Cambridge, MA 02139 USA

[2] Johns Hopkins Univ, Baltimore, MD USA

来源：

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2019, PT II | 2019年 / 11477卷

关键词：

MULTIPARTY COMPUTATION; PROTOCOLS;

D O I：

10.1007/978-3-030-17656-3_19

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We provide the first constructions of two round information theoretic (IT) secure multiparty computation (MPC) protocols in the plain model that tolerate any t < n/2 malicious corruptions. Our protocols satisfy the strongest achievable standard notions of security in two rounds in different communication models. Previously, IT-MPC protocols in the plain model either required a larger number of rounds, or a smaller minority of corruptions.

引用

页码：532 / 561

页数：30

共 37 条

[21] Two-Round Multiparty Secure Computation from Minimal Assumptions [J].

Garg, Sanjam ;

Srinivasan, Akshayaram .

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2018, PT II, 2018, 10821 :468-499

[22] Garbled Protocols and Two-Round MPC from Bilinear Maps [J].

Garg, Sanjam ;

Srinivasan, Akshayaram .

2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2017, :588-599

[23]

Gennaro R, 2002, LECT NOTES COMPUT SC, V2442, P178

[24]

Gennaro Rosario., 2001, PROC 33 ANN ACM S TH, P580

[25]

Goldreich O., 1987, P 19 ANN ACM S THEOR, P218, DOI DOI 10.1145/28395.28420

[26]

Goldreich Oded, 2004, Basic Applications, V2

[27] Secure multi-party computation without agreement [J].

Goldwasser, S ;

Lindell, Y .

JOURNAL OF CRYPTOLOGY, 2005, 18 (03) :247-287

[28]

Halevi S, 2011, LECT NOTES COMPUT SC, V6841, P132, DOI 10.1007/978-3-642-22792-9_8

[29]

Ishai Y, 2004, LECT NOTES COMPUT SC, V3027, P439

[30]

Ishai Y, 2002, LECT NOTES COMPUT SC, V2380, P244

← 1 2 3 4 →