An oblivious transfer protocol and its application for the exchange of secrets

  • Lein Harn
  • Hung-Yu Lin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 739)


The oblivious transfer protocol is a powerful tool in the design of cryptographic applications, such as coin flipping by the telephone, exchanging secrets and sending certified mail. In this paper, for our purpose of extending the oblivious transfer to the exchange of secrets, we redefine a verifiable oblivious transfer protocol which has the three properties of fairness, verifiability and security. The structure of the protocols is similar to the original protocols proposed by Rabin and Blum. The major difference is that our protocols are based on the difficulty of the discrete logarithm.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Bellare, M., and Micali, S., Non-interactive oblivious transfer and applications, Avances in Cryptology: CRYPTO '89, pp. 547–5557.Google Scholar
  2. [2]
    Berger, R., Peralta, R., and Tedric, T., A provably secure oblivious transfer protocol, Avances in Cryptology: Proc. of EUROCRYPT '84, pp. 379–386.Google Scholar
  3. [3]
    Blum, M., Three applications of oblivious transfer: 1. Coin flipping by telephone, 2. How to exchange secrets, 3. How to send certified electronic mail, Dept. EECS, University of California, Berkeley, Calif., 1981.Google Scholar
  4. [4]
    Blum, M., How to exchange (secret) keys, ACM Transaction on Computer System, Vol. 1, No. 2, May 1983, pp. 175–193.CrossRefGoogle Scholar
  5. [5]
    Brickie, E., Chaum, D., Damgard, I., and van de Graaf, J., Gradual and verifiable release of a secret, Advances in Cryptology: CRYPTO '87, pp. 156–166.Google Scholar
  6. [6]
    Cleve, R., Controlled gradual disclosure schemes for random bits and their applications, Avances in Cryptology: CRYPTO '89, pp. 573–588.Google Scholar
  7. [7]
    Harn, L., and Lin, H. Y., Non-interactive oblivious transfer, Electronics Letters, Vol. 26, No. 10, May 1990, pp. 635–636.Google Scholar
  8. [8]
    Hastad, J., and Shamir, A., The cryptographic security of truncated linearly related variables, Proc. of 17th STOC, 1985, pp. 355–362.Google Scholar
  9. [9]
    Knuth, D., The Art of Computer Programming, Vol. 2, Addison Wesley, Reading, MA, 1973.Google Scholar
  10. [10]
    Luby, M., Micali, S., and Rackoff, C., How to simultaneously exchange a secret bit by flipping a symmetrically biased coin, Proc, 22nd Ann. IEEE Symp. on Foundations of Computer Science, 1983, pp. 11–21.Google Scholar
  11. [11]
    Rabin, M., How to exchange secret by oblivious transfer. Harvard Center for Research in Computer Technology, Cambridge, Mass., 1981.Google Scholar
  12. [12]
    Tedric, T., How to exchange half a bit, Advances in Cryptology: Proc. of CRYPTO' 83, pp. 147–151.Google Scholar
  13. [13]
    Tedric, T., Fair exchange of secrets, Advances in Cryptology: Proc. of CRYPTO '84, pp. 434–438.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Lein Harn
    • 1
  • Hung-Yu Lin
    • 1
  1. 1.Computer Science Telecommunications ProgramUniversity of Missouri-Kansas CityKansas City

Personalised recommendations