Title :
Common randomness for secure computing
Author :
Prakash Narayan;Himanshu Tyagi;Shun Watanabe
Author_Institution :
Department of Electrical and Computer Engineering, and the Institute for Systems Research, University of Maryland, College Park, 20742, USA
fDate :
6/1/2015 12:00:00 AM
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.
Keywords :
"Protocols","Complexity theory","Cryptography","Entropy","Joints","Information theory"
Conference_Titel :
Information Theory (ISIT), 2015 IEEE International Symposium on
Electronic_ISBN :
2157-8117
DOI :
10.1109/ISIT.2015.7282595
