Equivalence Between Two Flavours of Oblivious Transfers

  • Claude Crépeau
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 293)


The concept of oblivious transfer (O.T.) that was induced by Halpern and Rabin m] turned out to be a very useful tool in designing cryptographic protocols. The related notion of “one-out-of-two oblivious transfer” was proposed by Even, Goldreich and Lempel in [EGL] together with some applications. Some more applications of this protocol can be found in recent papers [BCR], [GMWj. So far, the two notions where believed to be closely related but not known to be equivalent. This paper presents a proof that these two notions are computationally equivalent.


  1. [BCR]
    Brassard G., Crépeau C. and Robert J.-M., “Information Theoretic Reductions Among Disclosure Problems”, Proceedings of the 27th Annual IEEE Symposium on the Foundations of Computer Science, 1986, pp. 168–173.Google Scholar
  2. [EGL]
    Even S., Goldreich O. and Lempel A., “A randomized Protocol for Signing Contracts”, Communications of the ACM, Vol. 28, No. 6, 1985, pp. 637–647.MathSciNetCrossRefGoogle Scholar
  3. [GMW]
    Goldreich O., Micali S. and Wigderson A., “How To Play Any Mental Game or A Completeness Theorem for Protocols with Honest Majority”. Proceedings of the 19th Annual ACM Symposium on the Theory of Computing, 1987, pp. 218–229.Google Scholar
  4. [HR]
    Halpern J. and Rabin M.O., “A Logic to Reason about likehood”, Proceedings of the 15th Annual ACM Symposium on the Theory of Computing, 1983, pp. 310–319.Google Scholar
  5. [Kr]
    Kranakis, E., “Primality and Cryptography”, John Wiley & Sons, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Claude Crépeau
    • 1
  1. 1.Laboratory for Computer ScienceM.I.T.CambridgeUSA

Personalised recommendations