A New Secure Oblivious Transfer Protocol
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.
KeywordsDiscrete Logarithm Secret Information Cryptographic Protocol Discrete Logarithm Problem Oblivious Transfer
Unable to display preview. Download preview PDF.
- 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
- 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
- 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.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
- 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.Hastad, J., Shamir, A.: The cryptographic security of truncated linearly related variables. In: Proc. of 17th STOC, pp. 355–362 (1985)Google Scholar
- 10.Knuth, D.: The Art of Computer Programming, vol. 2. Addison Wesley, Reading (1973)Google Scholar
- 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.Rabin, M.: How to exchange secret by oblivious transfer. In: Harvard Center for Research in Computer Technology, Cambridge, Mass. (1981)Google Scholar