Impossibility Bounds for Secure Computing

Tyagi, Himanshu and Watanabe, Shun (2015) Impossibility Bounds for Secure Computing. In: IEEE International Symposium on Information Theory (ISIT), JUN 14-19, 2015, Hong Kong, PEOPLES R CHINA, pp. 2742-2746.

PDF IEEE_Int_Sym_Inf_The_2742_2015.pdf - Published Version Restricted to Registered users only Download (256kB) | Request a copy

Abstract

We derive impossibility (converse) bounds for the efficiency of implementing information theoretically secure oblivious transfer and bit commitment using correlated observations. Our approach is based on relating these problems to that of testing if the observations of the parties are conditionally independent given the adversary's observation. The resulting bounds strengthen and improve upon several previously known results.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Additional Information:	Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	07 Dec 2016 05:47
Last Modified:	07 Dec 2016 05:47
URI:	http://eprints.iisc.ac.in/id/eprint/55515

Actions (login required)

View Item