## CryptoDB

### Paper: Oblivious Transfer in Incomplete Networks

Authors: Varun Narayanan Vinod M. Prabahakaran DOI: 10.1007/978-3-030-03807-6_15 Search ePrint Search Google TCC 2018 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.
##### BibTeX
@inproceedings{tcc-2018-28992,
title={Oblivious Transfer in Incomplete Networks},
booktitle={Theory of Cryptography},
series={Theory of Cryptography},
publisher={Springer},
volume={11239},
pages={389-418},
doi={10.1007/978-3-030-03807-6_15},
author={Varun Narayanan and Vinod M. Prabahakaran},
year=2018
}