> Detailanzeige

Applebaum, Benny [Verfasser:in]; Brakerski, Zvika [Verfasser:in]; Garg, Sanjam [Verfasser:in]; Ishai, Yuval [Verfasser:in]; Srinivasan, Akshayaram [Verfasser:in] ; Benny Applebaum and Zvika Brakerski and Sanjam Garg and Yuval Ishai and Akshayaram Srinivasan [Mitwirkende:r]

Separating Two-Round Secure Computation From Oblivious Transfer

Literatur-
verwaltung

Zur
Merkliste

Lösche von
Merkliste

Per Whatsapp teilen

Schließen

Merkliste



Sie können Bookmarks mittels Listen verwalten, loggen Sie sich dafür bitte in Ihr SLUB Benutzerkonto ein.
  • Medientyp: Sonstige Veröffentlichung; E-Artikel; Elektronischer Konferenzbericht
  • Titel: Separating Two-Round Secure Computation From Oblivious Transfer
  • Beteiligte: Applebaum, Benny [Verfasser:in]; Brakerski, Zvika [Verfasser:in]; Garg, Sanjam [Verfasser:in]; Ishai, Yuval [Verfasser:in]; Srinivasan, Akshayaram [Verfasser:in]
  • Erschienen: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
  • Sprache: Englisch
  • DOI: https://doi.org/10.4230/LIPIcs.ITCS.2020.71
  • Schlagwörter: Oblivious Transfer ; Secure Multiparty Computation ; Oracle Separation
  • Entstehung:
  • Anmerkungen: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Beschreibung: We consider the question of minimizing the round complexity of protocols for secure multiparty computation (MPC) with security against an arbitrary number of semi-honest parties. Very recently, Garg and Srinivasan (Eurocrypt 2018) and Benhamouda and Lin (Eurocrypt 2018) constructed such 2-round MPC protocols from minimal assumptions. This was done by showing a round preserving reduction to the task of secure 2-party computation of the oblivious transfer functionality (OT). These constructions made a novel non-black-box use of the underlying OT protocol. The question remained whether this can be done by only making black-box use of 2-round OT. This is of theoretical and potentially also practical value as black-box use of primitives tends to lead to more efficient constructions. Our main result proves that such a black-box construction is impossible, namely that non-black-box use of OT is necessary. As a corollary, a similar separation holds when starting with any 2-party functionality other than OT. As a secondary contribution, we prove several additional results that further clarify the landscape of black-box MPC with minimal interaction. In particular, we complement the separation from 2-party functionalities by presenting a complete 4-party functionality, give evidence for the difficulty of ruling out a complete 3-party functionality and for the difficulty of ruling out black-box constructions of 3-round MPC from 2-round OT, and separate a relaxed "non-compact" variant of 2-party homomorphic secret sharing from 2-round OT.
  • Zugangsstatus: Freier Zugang