IEEE International Symposium on Information Theory (ISIT)
Impossibility bounds for secure computing
Himanshu Tyagi, Shun Watanabe
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.