Advertisement

m out of n Oblivious Transfer

  • Yi Mu
  • Junqi Zhang
  • Vijay Varadharajan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2384)

Abstract

We present three novel constructions of m out of n oblivious transfer, which demonstrate significant improvement over the existing schemes in terms of completeness, robustness and flexibility. We also show how to construct a non-interactive m out of n oblivious transfer, based on discrete logarithm. These constructions have potential applicability in electronic commerce.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. O. Rabin, “How exchange secrets by oblivious transfer,” tech. rep., TR-81, Computer Science Laboratory, Harvard, 1981.Google Scholar
  2. 2.
    S. Even, O. Goldreich, and A. Lempel, “A randomized protocol for signing contracts,” in Advances in cryptology-CRYPTO’82, Lecture Notes in Computer Science, pp. 205–210, Springer Verlag, Berlin, 1982.Google Scholar
  3. 3.
    C. Crepeau, “Equivalence between two flavours of oblivious transfers,” in Advances in cryptology-CRYPTO’87, Lecture Notes in Computer Science 1403, pp. 350–354, Springer-Verlag, Berlin, 1987.Google Scholar
  4. 4.
    C. Crepeau and J. Kilian, “Weakening security assumptions and oblivious tranfer,” in Advances in cryptology-CRYPTO’88, Lecture Notes in Computer Science 1403, pp. 2–7, Springer-Verlag, Berlin, 1988.Google Scholar
  5. 5.
    G. Brassard, C. Crepeau, and J.-M. Robert, “Information theoretic reductions among disclose problem,” in Symp. of Found of computer science, pp. 168–173, IEEE, 1986.Google Scholar
  6. 6.
    B. den Boer, “Oblivious transfer protecting secrecy,” in Advances in cryptology-EUROCRYPT’90, Lecture Notes in Computer Science 1403, pp. 31–46, Springer-Verlag, Berlin, 1990.Google Scholar
  7. 7.
    G. Brassard and C. Crepeau, “All or nothing disclosure of secrets,” in Advances in cryptology-CRYPTO’86, Lecture Notes in Computer Science 1403, Springer-Verlag, Berlin, 1987.Google Scholar
  8. 8.
    A. D. Santis and G. Persiano, “Public-randomness in public-key cryptography,” in Advances in cryptology-EUROCRYPTO’90, Lecture Notes in Computer Science 1403, pp. 46–61, Springer-Verlag, Berlin, 1990.Google Scholar
  9. 9.
    B. Aiello, Y. Ishai, and O. Reingold, “Priced oblivious transfer: how to sell digital goods,” in Advances in cryptology-EUROCRYPTO 2001, Lecture Notes in Computer Science 2045, pp. 119–135, Springer-Verlag, Berlin, 2001.CrossRefGoogle Scholar
  10. 10.
    M. Bellare and S. Micali, “Non-interactive oblivious transfer and application,” in Advances in cryptology-CRYPTO’89, Lecture Notes in Computer Science 1403, pp. 547–557, Springer-Verlag, Berlin, 1989.Google Scholar
  11. 11.
    K. Nyberg and R. A. Rueppel, “Message recovery for signature schemes based on the discrete logarithm problem,” pp. 182–193, Springer-Verlag, 1994.Google Scholar
  12. 12.
    T. ElGamal, “A public-key cryptosystem and a signature scheme based on discrete logarithms,” pp. 10–18, Springer-Verlag, Berlin, 1985.Google Scholar
  13. 13.
    M. Stadler and J.-M. Piveteau, “Fair blind signature,” in Advances in cryptology-CRYPTO’95, Lecture Notes in Computer Science 1403, pp. 209–219, Springer-Verlag, Berlin, 1995.Google Scholar
  14. 14.
    J. Kilian, “Basing cryptography on oblivious transfer,” in Proc. of STOC, 1988.Google Scholar
  15. 15.
    O. Goldreich, S. Micali, and A. Wigderson, “How to play any mental game,” in Proc. of STOC, 1987.Google Scholar
  16. 16.
    A. C. Yao, “How to generate and exchange secrets,” in Proc. of STOC, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Yi Mu
    • 1
  • Junqi Zhang
    • 1
  • Vijay Varadharajan
    • 1
  1. 1.Department of ComputingMacquarie UniversitySydneyAustralia

Personalised recommendations