Skip to main content
SpringerLink
Log in

On Oblivious Transfer Capacity

  • Chapter
Information Theory, Combinatorics, and Search Theory

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7777))

Abstract

Upper and lower bounds to the oblivious transfer (OT) capacity of discrete memoryless channels and multiple sources are obtained, for 1 of 2 strings OT with honest but curious participants. The upper bounds hold also for one-string OT. The results provide the exact value of OT capacity for a specified class of models, and the necessary and sufficient condition of its positivity, in general.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Ahlswede, R., Csiszár, I.: Common randomness in information theory and cryptography, part I. IEEE Trans. Inf. Theory 39, 1121–1132 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ahlswede, R., Csiszár, I.: On oblivious transfer capacity. In: Proc. ISIT 2007, Nice, pp. 2061–2064 (2007)

    Google Scholar 

  3. Alicki, R., Fannes, M.: Continuity of quantum conditional information. J. Phys. A: Math. Gen. 37, L55–L57 (2004)

    Google Scholar 

  4. Audenaert, K.M.R.: A sharp Fannes-type inequality for the von Neumann entropy. J. Phys. A. 40, 8127–8136 (2007)

    Article  MATH  Google Scholar 

  5. Csiszár, I., Körner, J.: Broadcast channels with confidential messages. IEEE Trans. Inf. Theory 24, 339–348 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  6. Csiszár, I., Körner, J.: Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd edn. Cambridge University Press (2011)

    Google Scholar 

  7. Imai, H., Nascimento, A., Morozov, K.: On the oblivious transfer capacity of the erasure channel. In: Proc. ISIT 2006, Seattle, pp. 1428–1431 (2006)

    Google Scholar 

  8. Ishai, Y., Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A., Wullschleger, J.: Constant-Rate Oblivious Transfer from Noisy Channels. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 667–684. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Kilian, J.: Founding cryptography on oblivious transfer. In: Proc. STOC 1988, pp. 20–31 (1988)

    Google Scholar 

  10. Maurer, U.: Secret key agreement by public discussion. IEEE Trans. Inf. Theory 39, 733–742 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  11. Nascimento, A., Winter, A.: On the oblivious transfer capacity of noisy correlations. In: Proc. ISIT 2006, Seattle, pp. 1871–1875 (2006)

    Google Scholar 

  12. Nascimento, A., Winter, A.: On the oblivious transfer capacity of noisy resources. IEEE Trans. Inf. Theory 54, 2572–2581 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Pinto, A., Dowsley, R., Morozov, K., Nascimento, A.: Achieving oblivious transfer apacity of generalized erasure channels in the malicious model. IEEE Trans. Inf. Theory 57, 5566–5571 (2011)

    Article  MathSciNet  Google Scholar 

  14. Prabhakaran, V., Prabhakaran, M.: Assisted common information with an application to secure two-party sampling. arXiv:1206.1282v1 [cs.IT] (2012)

    Google Scholar 

  15. Winter, A., Nascimento, A.C.A., Imai, H.: Commitment Capacity of Discrete Memoryless Channels. In: Paterson, K.G. (ed.) Cryptography and Coding 2003. LNCS, vol. 2898, pp. 35–51. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. Wolf, S., Wullschleger, J.: Oblivious Transfer Is Symmetric. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 222–232. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Wyner, A.: The wiretap channel. Bell System Tech. J. 54, 1355–1387 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  18. Zhang, Z.: Estimating mutual information via Kolmogorov distance. IEEE Trans. Inf. Theory 53, 3280–3283 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Rényi Institute of Mathematics, P.O. Box 127, Budapest, Hungary

    Rudolf Ahlswede & Imre Csiszár

Authors
  1. Rudolf Ahlswede
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Imre Csiszár
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany

    Harout Aydinian  & Christian Deppe  & 

  2. Department of Computer Science, University of Salerno, via Ponte don Melillo, 84084, Fisciano, Italy

    Ferdinando Cicalese

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ahlswede, R., Csiszár, I. (2013). On Oblivious Transfer Capacity. In: Aydinian, H., Cicalese, F., Deppe, C. (eds) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science, vol 7777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36899-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36899-8_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36898-1

  • Online ISBN: 978-3-642-36899-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation