Skip to main content
SpringerLink
Log in

Unconditionally-Secure Oblivious Transfer

  • Conference paper
  • First Online:
Information and Communications Security (ICICS 2001)

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

Included in the following conference series:

Abstract

This paper investigates oblivious transfer protocol based on privacy amplification that uses Rényi entropy of order α for any 1α 2, the conditions under which the protocol is secure are given. In protocol it makes no assumptions about receiver’s computing power, so under the given conditions the protocol is unconditionally-secure.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.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. M. O. Rabin. How to exchange secrets by oblivious transfer, Tech. Report TR-81, Harvard, 1981.

    Google Scholar 

  2. Shimon Even, Oded Goldreich, and A. Lempel. A randomized protocol for signing contracts, CRYPTO’82, Plenum Press, 1983, 205–210.

    Google Scholar 

  3. Gilles Brassard, Claude Crépeau, and Jean-Marc Robert, Information theoretic reductions among disclosure problems, Proc. 27th IEEE Symposium on Foundations of Computer Science, 1986,168–173.

    Google Scholar 

  4. Christian Cachin. On the foundations of oblivious transfer, EUROCRYPT’98, Lecture Notes in Computer Science, Springer-Verlag, 1998, 361–374.

    Google Scholar 

  5. Gilles Brassard, Claude Crépeau. Oblivious transfer and privacy amplification, EUROCRYPT’ 97, Lecture Notes in Computer Science, Springer-Verlag, 1997, 334–347.

    Google Scholar 

  6. Charles H. Bennett, Gilles Brassard, Claude Crépeau, and Ueli M. Maurer. Generalized Privacy amplification, IEEE Trans. Inform. Theory, 1995, 41 (6): 1915–1923.

    Article  MATH  MathSciNet  Google Scholar 

  7. Bo Yang, Tong Zhang and Yumin Wang. Distillation of Unconditionally-Secure Secret-Key Based on Smooth Entropy. Acta Electronica Sinica, 2001, 29(7).

    Google Scholar 

  8. Bo Yang, Tong Zhang and Yumin Wang. Distillation of Unconditionally-Secure Secret-Key against Active Adversaries Based on Smooth Entropy. Acta Electronica Sinica, accepted to publish.

    Google Scholar 

  9. Christian Cachin. Smooth entropy and Rényi entropy, EUROCRYPT’97, Lecture Notes in Computer Science, Springer-Verlag, 1997, 193–208.

    Google Scholar 

  10. J. L. Carter and M. N. Wegman. Universal classes of hash functions, J.Comput.Syst.Sci., 1979, 18 (2): 143–154.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Key Laboratory on ISN, Xidian University, Xi'an, 710071, Shaanxi Province, P.R. China

    Bo Yang & Yumin Wang

  2. Southwest Communications Institute of China, Cheng’du, 610041, Sichuan Province, P.R. China

    Shixiong Zhu

Authors
  1. Bo Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shixiong Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yumin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Engineering Research Center for Information Security Technology (ERCIST), Chinese Academy of Sciences, P.O. Box 8718, 100080, Beijing, China

    Sihan Qing

  2. NTT Labs, 1-1 Hikarinooka, 239-0847, Yokosuka-shi, Japan

    Tatsuaki Okamoto

  3. Oracle Corporation, 500 Oracle Parkway, 94065, Redwood Shores, CA, USA

    Jianying Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, B., Zhu, S., Wang, Y. (2001). Unconditionally-Secure Oblivious Transfer. In: Qing, S., Okamoto, T., Zhou, J. (eds) Information and Communications Security. ICICS 2001. Lecture Notes in Computer Science, vol 2229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45600-7_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45600-7_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45600-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation