A New Secure Oblivious Transfer Protocol

  • Soon-gohn Kim
  • Heau-jo Kang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3984)


In this paper, we proposed two methods in the field of Oblivious Transfer for secret information. One is the interactive method, the other is the non-interactive method. In the first method, we considered the possible situation where one denies what he/she has sent the messages to the other in the process of protocol. To do this we used cryptographic technique for the messages transferred between two mutually distrustful parties. This method has the additional functions that enable to authenticate sender and to protect one’s denial of what he/she has sent the messages to the other. In the second method, we proposed non-interactive method for the secure exchange of secret data. Proposed method is based on the difficulty of discrete logarithm problem. The security in proposed method can be chosen as a random number. The traffic amount of proposed method is less than that of the conventional interactive method.


Discrete Logarithm Secret Information Cryptographic Protocol Discrete Logarithm Problem Oblivious Transfer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bellare, M., Micali, S.: Non-interactive oblivious transfer and applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 547–557. Springer, Heidelberg (1990)Google Scholar
  2. 2.
    Berger, R., Peralta, R., Tedrick, T.: A provably secure oblivious transfer protocol. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 379–386. Springer, Heidelberg (1985)CrossRefGoogle 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 1(2), 175–193 (1983)CrossRefGoogle Scholar
  5. 5.
    Brickell, E.F., Chaum, D., Damgård, I.B., van de Graaf, J.: Gradual and verifiable release of a secret. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 156–166. Springer, Heidelberg (1987)Google Scholar
  6. 6.
    Cleve, R.: Controlled gradual disclosure schemes for random bits and their applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 573–588. Springer, Heidelberg (1989)Google Scholar
  7. 7.
    Harn, L., Lin, H.Y.: Non-interactive oblivious transfer. Electronics Letters 26(10), 635–636 (1990)CrossRefGoogle Scholar
  8. 8.
    Harn, L., Lin, H.Y.: An oblivious Transfer Potocol and its Application for the Exchange of Secrets. In: Matsumoto, T., Imai, H., Rivest, R.L. (eds.) ASIACRYPT 1991. LNCS, vol. 739, pp. 187–190. Springer, Heidelberg (1993)Google Scholar
  9. 9.
    Hastad, J., Shamir, A.: The cryptographic security of truncated linearly related variables. In: Proc. of 17th STOC, pp. 355–362 (1985)Google Scholar
  10. 10.
    Knuth, D.: The Art of Computer Programming, vol. 2. Addison Wesley, Reading (1973)Google Scholar
  11. 11.
    Luby, M., Micali, S., Rackoff, C.: How to simultaneously exchange a secret bit by flipping a symmetrically biased coin. In: Proc, 22nd Ann. IEEE Symp. On Foundations of Computer Science, pp. 11–21 (1983)Google Scholar
  12. 12.
    Rabin, M.: How to exchange secret by oblivious transfer. In: Harvard Center for Research in Computer Technology, Cambridge, Mass. (1981)Google Scholar
  13. 13.
    Tedric, T.: How to exchange half a bit. In: McCurley, K.S., Ziegler, C.D. (eds.) Advances in Cryptology 1981 - 1997. LNCS, vol. 1440, pp. 147–151. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  14. 14.
    Tedrick, T.: Fair exchange of secrets. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 434–438. Springer, Heidelberg (1985)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Soon-gohn Kim
    • 1
  • Heau-jo Kang
    • 2
  1. 1.Department of Computer Multimedia ScienceJoongbu UniversityChungnamKorea
  2. 2.Division of Computer EngineeringMokwon UniversityDaejonKorea

Personalised recommendations