Oblivious Transfer in Incomplete Networks

Varun Narayanan; Vinod M.  Prabhakaran

Paper 2018/875

Oblivious Transfer in Incomplete Networks

Varun Narayanan and Vinod M. Prabhakaran

Abstract

Secure message transmission and Byzantine agreement have been studied extensively in incomplete networks. However, information theoretically secure multiparty computation (MPC) in incomplete networks is less well understood. In this paper, we characterize the conditions under which a pair of parties can compute oblivious transfer (OT) information theoretically securely against a general adversary structure in an incomplete network of reliable, private channels. We provide characterizations for both semi-honest and malicious models. A consequence of our results is a complete characterization of networks in which a given subset of parties can compute any functionality securely with respect to an adversary structure in the semi-honest case and a partial characterization in the malicious case.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Published by the IACR in TCC 2018
Keywords: Oblivious transfer information theory incomplete networks secure multiparty computation general adversary structures unconditional security
Contact author(s): varunnkv @ gmail com
History: 2020-09-12: revised; 2018-09-23: received; See all versions
Short URL: https://ia.cr/2018/875
License: CC BY

BibTeX

@misc{cryptoeprint:2018/875,
      author = {Varun Narayanan and Vinod M.  Prabhakaran},
      title = {Oblivious Transfer in Incomplete Networks},
      howpublished = {Cryptology ePrint Archive, Paper 2018/875},
      year = {2018},
      note = {\url{https://eprint.iacr.org/2018/875}},
      url = {https://eprint.iacr.org/2018/875}
}