Skip to main content

General Public Key m-Out-of-n Oblivious Transfer

  • Conference paper
Computational and Information Science (CIS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3314))

Included in the following conference series:

  • 1264 Accesses

Abstract

In the m-out-of-n oblivious transfer model, Alice has n messages, Bob has m choices. After the interaction between the two parties, Bob can get m but only m messages from the n messages, Alice cannot know which m messages Bob gets. In this paper, for the first time, we construct a m-out-of-n OT protocol based on the general secure public key system.

This work is partially supported by a grant from the Ministry of Science and Technology (#2001CCA03000), National Natural Science Fund (#60273045) and Shanghai Science and Technology Development Fund (#03JC14014).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aiello, B., Ishai, Y., Reingold, O.: Priced Oblivious Transfer: How to Sell Digital Goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 119–135. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Crépeau, C., Van de Graaf, J., Tapp, A.: Committed Oblivious Transfer and Private Multi-party Computations. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 110–123. Springer, Heidelberg (1995)

    Google Scholar 

  3. Cormen, H., Leiserson, E., Rivest, L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  4. Even, S., Goldreich, O., Lempel, A.: A Randomized Protocol for Signing Contracts. Commu. of the ACM 28, 637–647 (1995)

    Article  MathSciNet  Google Scholar 

  5. Goldreich, O., Micali, S., Wigderson, A.: How to Play any Mental Game or a Completeness Theorem for Protocols with Honest Majority. In: Proc. 19th Annu. ACM Symp. on Theo. of Compu., pp. 218–229 (1987)

    Google Scholar 

  6. Kilian, J.: Founding Cryptography on Oblivious Transfer. In: Proc. 20th Annu. ACM Symp. on Theo. of Compu., pp. 20–31 (1988)

    Google Scholar 

  7. 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)

    Chapter  Google Scholar 

  8. Naor, M., Pinkas, B.: Oblivious Transfer with Adaptive Queries. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 573–590. Springer, Heidelberg (1999)

    Google Scholar 

  9. Naor, M., Pinkas, B.: Efficient Oblivious Transfer Protocols. In: 12th Annu. Symp. On Disc. Algo., pp. 448–457 (2001)

    Google Scholar 

  10. Rabin, M.: How to Exchange Secrets by Oblivious Transfer. Tech. Repo. TR81, Aiken Comp. Lab, Harvard University (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Z., Zhu, H. (2004). General Public Key m-Out-of-n Oblivious Transfer. In: Zhang, J., He, JH., Fu, Y. (eds) Computational and Information Science. CIS 2004. Lecture Notes in Computer Science, vol 3314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30497-5_137

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30497-5_137

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24127-0

  • Online ISBN: 978-3-540-30497-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics