Round-Optimal Black-Box MPC in the Plain Model

Yuval Ishai; Dakshita Khurana; Amit Sahai; Akshayaram Srinivasan

doi:10.1007/978-3-031-38557-5_13

Round-Optimal Black-Box MPC in the Plain Model

Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan

Computer Science

Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We give the first construction of a (fully) black-box round-optimal secure multiparty computation protocol in the plain model. Our protocol makes black-box use of a sub-exponentially secure two-message statistical sender private oblivious transfer (SSP-OT), which in turn can be based on (sub-exponential variants of) most of the standard cryptographic assumptions known to imply public-key cryptography.

Original language	English
Title of host publication	Advances in Cryptology – CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Proceedings
Editors	Helena Handschuh, Anna Lysyanskaya
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	393-426
Number of pages	34
ISBN (Print)	9783031385568
DOIs	https://doi.org/10.1007/978-3-031-38557-5_13
State	Published - 2023
Event	Advances in Cryptology – CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Proceedings - Santa Barbara, United States Duration: 20 Aug 2023 → 24 Aug 2023

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	14081 LNCS

Conference

Conference	Advances in Cryptology – CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Proceedings
Country/Territory	United States
City	Santa Barbara
Period	20/08/23 → 24/08/23

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-031-38557-5_13

Cite this

Ishai, Y., Khurana, D., Sahai, A., & Srinivasan, A. (2023). Round-Optimal Black-Box MPC in the Plain Model. In H. Handschuh, & A. Lysyanskaya (Eds.), Advances in Cryptology – CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Proceedings (pp. 393-426). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14081 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-38557-5_13

Ishai, Yuval ; Khurana, Dakshita ; Sahai, Amit et al. / Round-Optimal Black-Box MPC in the Plain Model. Advances in Cryptology – CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Proceedings. editor / Helena Handschuh ; Anna Lysyanskaya. Springer Science and Business Media Deutschland GmbH, 2023. pp. 393-426 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{291c6a61495d43989cee1bbe0d5430f2,

title = "Round-Optimal Black-Box MPC in the Plain Model",

abstract = "We give the first construction of a (fully) black-box round-optimal secure multiparty computation protocol in the plain model. Our protocol makes black-box use of a sub-exponentially secure two-message statistical sender private oblivious transfer (SSP-OT), which in turn can be based on (sub-exponential variants of) most of the standard cryptographic assumptions known to imply public-key cryptography.",

author = "Yuval Ishai and Dakshita Khurana and Amit Sahai and Akshayaram Srinivasan",

note = "Publisher Copyright: {\textcopyright} 2023, International Association for Cryptologic Research.; Advances in Cryptology – CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Proceedings ; Conference date: 20-08-2023 Through 24-08-2023",

year = "2023",

doi = "10.1007/978-3-031-38557-5\_13",

language = "الإنجليزيّة",

isbn = "9783031385568",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "393--426",

editor = "Helena Handschuh and Anna Lysyanskaya",

booktitle = "Advances in Cryptology – CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Proceedings",

address = "ألمانيا",

}

Ishai, Y, Khurana, D, Sahai, A & Srinivasan, A 2023, Round-Optimal Black-Box MPC in the Plain Model. in H Handschuh & A Lysyanskaya (eds), Advances in Cryptology – CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14081 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 393-426, Advances in Cryptology – CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Proceedings, Santa Barbara, United States, 20/08/23. https://doi.org/10.1007/978-3-031-38557-5_13

Round-Optimal Black-Box MPC in the Plain Model. / Ishai, Yuval; Khurana, Dakshita; Sahai, Amit et al.
Advances in Cryptology – CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Proceedings. ed. / Helena Handschuh; Anna Lysyanskaya. Springer Science and Business Media Deutschland GmbH, 2023. p. 393-426 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14081 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Round-Optimal Black-Box MPC in the Plain Model

AU - Ishai, Yuval

AU - Khurana, Dakshita

AU - Sahai, Amit

AU - Srinivasan, Akshayaram

PY - 2023

Y1 - 2023

N2 - We give the first construction of a (fully) black-box round-optimal secure multiparty computation protocol in the plain model. Our protocol makes black-box use of a sub-exponentially secure two-message statistical sender private oblivious transfer (SSP-OT), which in turn can be based on (sub-exponential variants of) most of the standard cryptographic assumptions known to imply public-key cryptography.

AB - We give the first construction of a (fully) black-box round-optimal secure multiparty computation protocol in the plain model. Our protocol makes black-box use of a sub-exponentially secure two-message statistical sender private oblivious transfer (SSP-OT), which in turn can be based on (sub-exponential variants of) most of the standard cryptographic assumptions known to imply public-key cryptography.

UR - http://www.scopus.com/inward/record.url?scp=85172306500&partnerID=8YFLogxK

U2 - 10.1007/978-3-031-38557-5_13

DO - 10.1007/978-3-031-38557-5_13

M3 - منشور من مؤتمر

SN - 9783031385568

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 393

EP - 426

BT - Advances in Cryptology – CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Proceedings

A2 - Handschuh, Helena

A2 - Lysyanskaya, Anna

PB - Springer Science and Business Media Deutschland GmbH

T2 - Advances in Cryptology – CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Proceedings

Y2 - 20 August 2023 through 24 August 2023

ER -

Ishai Y, Khurana D, Sahai A, Srinivasan A. Round-Optimal Black-Box MPC in the Plain Model. In Handschuh H, Lysyanskaya A, editors, Advances in Cryptology – CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Proceedings. Springer Science and Business Media Deutschland GmbH. 2023. p. 393-426. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-38557-5_13

Round-Optimal Black-Box MPC in the Plain Model

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this