Abstract

This paper presents a proof that these two notions are computationally equivalent. Essentially, we show a protocol for "one-out-of-two oblivious transfer", based on the existence of a protocol for the oblivious transfer problem. The reduction presented does not depend on any cryptographic assumption and works independently of the implementation of O.T.. The implications of this reduction are: -there exists a protocol for ANDOS [BCR] if and only if there exists a protocol for O.T. -the completeness theorem of [GMW] can be based on the existence of O.T. 2. DEFINITIONS

Citations

425	How to play any mental game, or a completeness theorem for protocols with honest majority - Goldreich, Micali, et al. - 1987
407	A randomized protocol for signing contracts - Even, Goldreich, et al. - 1985
64	Information theoretic reductions among disclosure problems - Brassard, Crepeau, et al. - 1986
21	Primality and Cryptography - Kranakis
5	A Logic to reason about likehood - Halpern, Rabin - 1983