Effective Oblivious Transfer Using a Probabilistic Encryption

Conference paper
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 170)


Some novel effective 1-out-of-2, 1-out-of-n, n−1-out-of-n, andm-out-of-n interactive and non-interactive oblivious transfer protocols (OT protocols) using a probabilistic encryption are presented. Their key information is adapted from corresponding Bellare − Rivest fractional OT protocols and the encryption is carried out on ElGamal. They can be realized in a multiplicative as well as an additive group of prime order. It is shown that due to usage of different encryption keys this implementation can be simplified in such a way that single randomizer is sufficient for all encryptions. The proposal allows to increase the information rate by 2n/(n+1) times and to reduce by the same factor the computational complexity of the second round phase of interactive and of the communication phase of non-interactive m-out-of-n OT protocols explored probabilistic encryption. These propositions have potential applications in all cryptographic protocols based on the m-out-of-n oblivious transfer using probabilistic encryption including generalized oblivious transfer, in particular in electronic commerce.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Aiken Computation Laboratory, Harvard University (1981)Google Scholar
  2. 2.
    Blum, M.: How to exchange (secret) keys. Trans. Computer Systems 1, 175–193 (1983)CrossRefGoogle Scholar
  3. 3.
    Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM 28, 637–647 (1985)MathSciNetCrossRefGoogle Scholar
  4. 4.
    ElGamal, T.: A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory IT-31(4), 469–472 (1985)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Bellare, M., Rivest, R.L.: Translucent cryptography – an alternative to key escrow, and its implementation via fractional oblivious transfer. MIT/LCS Technical Report 683 (1990)Google Scholar
  6. 6.
    Brasard, G., Crépeau, C., Robert, J.M.: Oblivious transfer and intersecting codes. IEEE Transaction of Information Theory, Special Issue on Coding and Complexity 42, 1769–1780 (1996)Google Scholar
  7. 7.
    Mamontov, A.I., Frolov, A.B.: On one scheme for oblivious transfer of combinations of messages. MPEI Bulletin 3, 113–119 (2005) (in Russian)Google Scholar
  8. 8.
    Mu, Y., Zhang, J., Varadharajan, V.: m out of n Oblivious Transfer. In: Batten, L.M., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 395–405. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Nyberg, K., Rueppel, R.A.: A new signature scheme based on the DSA giving message recovery. In: 1st ACM Conference on Computer and Communications Security, Fairfax, Virginia, pp. 58–61 (1993)Google Scholar
  10. 10.
    Nyberg, K., Rueppel, R.A.: Message recovery for signature schemes based on the discrete logarithm problem, pp. 182–193. Springer (1994)Google Scholar
  11. 11.
    Ishai, Y., Kushelevitz, E.: Private simultaneous messages protocols with applications. In: Proc. of ISTCS 1997, pp. 174–184. IEEE Computer Society (1997)Google Scholar
  12. 12.
    Tassa, T.: Generalized oblivious transfer by secret sharing. Designs, Codes and Cryptography 58, 1:11–1:21 (2011)Google Scholar
  13. 13.
    Koblith, N.: A Course in number theory and cryptography. Springer, New York (1994)CrossRefGoogle Scholar
  14. 14.
    Salomaa, A.: Public-key cryptography. Springer, New York (1990)MATHGoogle Scholar
  15. 15.
    Koblitz, N.: Constructing Elliptic Curve Cryptosystems in Characteristic 2. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 156–167. Springer, Heidelberg (1991)Google Scholar
  16. 16.
    Rosing, M.: Implementing elliptic curve cryptography. Manning Publications Co., Greenwich (1998)Google Scholar
  17. 17.
    Yao, A.C.: Protocols for secure computation. In: Proc. of IEEE Foundation of Computer Science (FOCS), pp. 160–164 (1982)Google Scholar
  18. 18.
    Goldreich, O., Vainish, R.: How to Solve Any Protocol Probleman Efficiency Improvement. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 73–86. Springer, Heidelberg (1988)Google Scholar
  19. 19.
    Killian, J.: Founding cryptography on oblivious transfer. In: Proc. of the 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 20–31 (1988)Google Scholar
  20. 20.
    Noar, M., Pinkas, B.: Oblivious polynomial evaluation. In: Proc. of the 31st Annual ACM Symposium on Theory of Computing (STOC), pp. 245–254 (1999)Google Scholar
  21. 21.
    Noar, M., Pinkas, B.: Computationally secure oblivious transfer. Journal of Cryptology 18, 1–35 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.National Research University Moscow Power Engineering InstituteMoscowRussian Federation

Personalised recommendations