Cryptology ePrint Archive: Report 2018/875

Oblivious Transfer in Incomplete Networks

Varun Narayanan and Vinod M. Prabahakaran

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.

Category / Keywords: foundations / Oblivious transfer, information theory, incomplete networks, secure multiparty computation, general adversary structures, unconditional security

Original Publication (with major differences): IACR-TCC-2018

Date: received 18 Sep 2018

Contact author: varunnkv at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20180923:191440 (All versions of this report)

Short URL: ia.cr/2018/875


[ Cryptology ePrint archive ]