Skip to main content

Quantum ANDOS Protocol with Unconditional Security

  • Conference paper
Advances in Natural Computation (ICNC 2006)

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

Included in the following conference series:

  • 929 Accesses

Abstract

All-or-Nothing Disclosure of Secrets, or ANDOS for brevity, is an interesting cryptographic task, which involves two parties, say Alice and Bob. Alice has a few secrets, which she regards as equally valuable. She would like to sell any of them to Bob, with the guarantee that no information about the other secrets will be obtained if he pays for only one secret. Moreover, Bob can freely choose his secret and wants to ensure that Alice can obtain no information about which of her secrets he has picked. In this paper, we present a new quantum ANDOS scheme which achieves the same functionality, but which is of unconditional security and is able to contain arbitrary number of secrets.

Supported by the NSF of China (Grant No. 60573171).

* Supported (in part) by the National Grand Fundamental Research 973 Program of China (Grant No. 2003CB317000).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Brassard, G., Crépeau, C., Robert, J.M.: All-or-Nothing Disclosure of Secrets. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 234–238. Springer, Heidelberg (1987)

    Google Scholar 

  2. Wiesner, S.: Conjugate coding. In: Sigact News, vol. 18, pp. 78–88 (1970) (Original manuscript written circa)

    Google Scholar 

  3. Salomaa, A., Santean, L.: Secret selling of secrets with several buyers. In: 42nd EATCS Bulletin, pp. 178–186 (1990)

    Google Scholar 

  4. Kent, A.: Unconditionally secure all-or-nothing disclosure of secrets. Arxiv preprint quant-ph/9711025 (1997)

    Google Scholar 

  5. Stern, J.P.: A new and efficient all-or-nothing disclosure of secrets protocol. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 357–371. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  6. Lo, H.-K., Chau, H.F.: Is Quantum Bit Commitment Really Possible? Los Alamos preprint archive quant-ph/9603004 (1996)

    Google Scholar 

  7. Mayers, D.: Unconditionally Secure Quantum Bit Commitment is Impossible. In: Fourth Workshop on Physics and Computation-PhysComp 1996 (1996)

    Google Scholar 

  8. Goldreich, O.: Foundation of Cryptography Basic Tools. Cambridge University Press, Cambridge (2001)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, W., Huang, L., Xiao, M., Jing, W. (2006). Quantum ANDOS Protocol with Unconditional Security. In: Jiao, L., Wang, L., Gao, X., Liu, J., Wu, F. (eds) Advances in Natural Computation. ICNC 2006. Lecture Notes in Computer Science, vol 4222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881223_3

Download citation

  • DOI: https://doi.org/10.1007/11881223_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45907-1

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics