Advertisement

Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations

  • Iftach Haitner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2951)

Abstract

Until recently, the existence of collection of trapdoor permutations (TDP) was believed (and claimed) to imply almost all of the major cryptographic primitives, including public-key encryption (PKE), oblivious transfer (OT), and non-interactive zero-knowledge (NIZK). It was recently realized, however, that the commonly accepted general definition of TDP needs to be strengthened slightly in order to make the security proofs of TDP-based OT go through. We present an implementation of oblivious transfer based on collection of dense trapdoor permutations. The latter is a collection of trapdoor permutations, with the property that the permutation domains are polynomially dense in the set of all strings of a particular length. Previous TDP-based implementations of oblivious transfer assumed an enhancement of the hardness assumption (of the collection).

Keywords

Oblivious Transfer Positive Polynomial Negligible Function Trapdoor Permutation Oblivious Transfer Protocol 
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.

References

  1. 1.
    Blum, M.: How to exchange (secret) keys. ACM Transactions on Computer Systems 1(2), 175–193 (1983)CrossRefGoogle Scholar
  2. 2.
    Brassard, G., Crepeau, C., Robert, J.-M.: Information theoretic reductions among disclosure problems. In: 27th Annual Symp. on Foundations of Computer Science (FOCS 1986), Los Angeles, Ca., USA, October 1986, pp. 168–173. IEEE, Los Alamitos (1986)CrossRefGoogle Scholar
  3. 3.
    Crépeau, C., Kilian, J.: Weakening security assumptions and oblivious transfer. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 2–7. Springer, Heidelberg (1990)Google Scholar
  4. 4.
    Crépeau, C., Sántha, M.: On the reversibility of oblivious transfer. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 106–113. Springer, Heidelberg (1991)Google Scholar
  5. 5.
    Crépeau, C.: Equivalence between two flavours of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 350–354. Springer, Heidelberg (1988)Google Scholar
  6. 6.
    Damgård, I., Kilian, J., Salvail, L.: On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 56. Springer, Heidelberg (1999)Google Scholar
  7. 7.
    Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM 28(6), 637–647 (1985)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The relationship between public key encryption and oblivious transfer. In: IEEE (ed.) 41st Annual Symp. on Foundations of Computer Science: proceedings, Redondo Beach, California, November 12-14, pp. 325–335. IEEE, Los Alamitos (2000)CrossRefGoogle Scholar
  9. 9.
    Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: ACM (ed.) Proceedings of the twenty-first annual ACM Symp. on Theory of Computing, Seattle, Washington, May 15-17, pp. 25–32. ACM Press, New York (1989)CrossRefGoogle Scholar
  10. 10.
    Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Proc. 19th Ann. ACM Symp. on Theory of Computing, pp. 218–229 (1987)Google Scholar
  11. 11.
    Goldreich, O.: Foundations of cryptography: Basic tools. Cambridge University Press, Cambridge (2001)zbMATHCrossRefGoogle Scholar
  12. 12.
    Goldreich, O.: Foundations of cryptography - volume 2, Working Draft (2002), available at: http://www.wisdom.weizmann.ac.il/oded/foc-vol2.html
  13. 13.
    Haitner, I.: Implementing oblivious transfer using collection of dense trapdoor permutations, MSc thesis (2003), available at: www.wisdom.weizmann.ac.il/~iftachh/papers/msc.html
  14. 14.
    Kilian, J.: Founding crytpography on oblivious transfer. In: Cole, R. (ed.) Proceedings of the 20th Annual ACM Symp. on the Theory of Computing, Chicago, IL, May 1988, pp. 20–31. ACM Press, New York (1988)Google Scholar
  15. 15.
    Rabin, M.O.: How to exchange secrets by oblivious transfer, TR-81, Harvard (1981)Google Scholar
  16. 16.
    De Santis, Persiano, G.: Zero-knowledge proofs of knowledge without interaction. In: IEEE (ed.) 33rd Annual Symp. on Foundations of Computer Science, Pittsburgh, Pennsylvania: proceedings [papers] (Silver Spring, MD 20910, USA), October 24-27, pp. 427–436. IEEE, Los Alamitos (1992)CrossRefGoogle Scholar
  17. 17.
    Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th Symp. on Foundations of Computer Science (FOCS), pp. 162–167. IEEE Computer Society Press, Los Alamitos (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Iftach Haitner
    • 1
  1. 1.Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations