### 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.

Available format(s)
Category
Foundations
Publication info
Keywords
Oblivious transferinformation theoryincomplete networkssecure multiparty computationgeneral adversary structuresunconditional security
Contact author(s)
varunnkv @ gmail com
History
2020-09-12: revised
See all versions
Short URL
https://ia.cr/2018/875

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}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.