DocumentCode :
3663485
Title :
Impossibility bounds for secure computing
Author :
Himanshu Tyagi;Shun Watanabe
Author_Institution :
Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore, Karnataka 560012, India
fYear :
2015
fDate :
6/1/2015 12:00:00 AM
Firstpage :
2742
Lastpage :
2746
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.
Keywords :
"Testing","Protocols","Random variables","Upper bound","Cryptography","Information theory"
Publisher :
ieee
Conference_Titel :
Information Theory (ISIT), 2015 IEEE International Symposium on
Electronic_ISBN :
2157-8117
Type :
conf
DOI :
10.1109/ISIT.2015.7282955
Filename :
7282955
Link To Document :
بازگشت