Common Randomness for Secure Computing

Himanshu, Tyagi (2015) Common Randomness for Secure Computing. In: IEEE International Symposium on Information Theory (ISIT), JUN 14-19, 2015, Hong Kong, PEOPLES R CHINA, pp. 949-953.

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

Abstract

We revisit A.C. Yao's classic problem of secure function computation by interactive communication, in an information theoretic setting. Our approach, based on examining the underlying common randomness, provides a new proof of the characterization of a securely computable function by deterministic protocols. This approach also yields a characterization of the minimum communication needed for secure computability.

Item Type:	Conference Paper
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:30
Last Modified:	07 Dec 2016 05:30
URI:	http://eprints.iisc.ac.in/id/eprint/55509

Actions (login required)

View Item