Skip to main content
SpringerLink
Log in

On Quantum and Approximate Privacy

(Extended Abstract)

  • Conference paper
  • First Online:
STACS 2002 (STACS 2002)

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

Included in the following conference series:

Abstract

This paper studies privacy and secure function evaluation in communication complexity. The focus is on quantum versions of the model and on protocols with only approximate privacy against honest players. We show that the privacy loss (the minimum divulged information) in computing a function can be decreased exponentially by using quantum protocols, while the class of privately computable functions (i.e., those with privacy loss 0) is not increased by quantum protocols. Quantum communication combined with small information leakage on the other hand makes certain functions computable (almost) privately which are not computable using quantum communication without leakage or using classical communication with leakage. We also give an example of an exponential reduction of the communication complexity of a function by allowing a privacy loss of o(1) instead of privacy loss 0.

For the full version of the paper see http://www.arXiv.org/abs/quant-ph/0110038.

Supported by the EU 5th framework program QAIP IST-1999-11234 and by NWO grant 612.055.001.

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 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. D. Aharonov, A. Kitaev, and N. Nisan. Quantum circuits with mixed states. 30th ACM Symposium on Theory of Computing, pp. 20–30, 1998.

    Google Scholar 

  2. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. 27th IEEE Symposium on Foundations of Computer Science, pp.303–312, 1986.

    Google Scholar 

  3. R. Bar-Yehuda, B. Chor, E. Kushilevitz, and A. Orlitsky. Privacy, Additional Information, and Communication. IEEE Transactions on Information Theory, vol.39, pp.1930–1943, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  4. D. Beaver. Perfect privacy for two party protocols. Technical Report TR-11-89, Harvard University, 1989.

    Google Scholar 

  5. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. 20th ACM Symposium on Theory of Computing, pp. 1–10, 1988.

    Google Scholar 

  6. M. Boyer, G. Brassard, P. Høyer, and A. Tapp. Tight bounds on quantum searching. 4th Workshop on Physics and Computation, pp.36–43, 1996.

    Google Scholar 

  7. H. Buhrman, R. Cleve, and A. Wigderson. Quantum vs. classical communication and computation. 30th ACM Symposium on Theory of Computing, pp. 63–68, 1998.

    Google Scholar 

  8. V. Buzek and M. Hillery. Quantum Copying: Beyond the No-Cloning Theorem. Phys. Rev. A, vol.54, pp.1844–1852, 1996.

    Article  MathSciNet  Google Scholar 

  9. D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. 20th ACM Symposium on Theory of Computing, pp. 11–19, 1988.

    Google Scholar 

  10. B. Chor and E. Kushilevitz. A zero-one law for Boolean privacy. SIAM Journal Discrete Math., vol.4, pp.36–47, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  11. T.M. Cover and J.A. Thomas. Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, 1991.

    Google Scholar 

  12. O. Goldreich, S. Micali, and A. Wigderson. How to Play Any Mental Game. 19th ACM Symposium on Theory of Computing, pp.218–229, 1987.

    Google Scholar 

  13. H. Klauck, A. Nayak, A. Ta-Shma, and D. Zuckerman. Interaction in Quantum Communication and the Complexity of Set Disjointness. 33rd ACM Symposium on Theory of Computing, pp. 124–133, 2001.

    Google Scholar 

  14. E. Kushilevitz. Privacy and Communication Complexity. SIAM Journal Discrete Math., vol.5, pp.273–284, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  15. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.

    Google Scholar 

  16. E. Kushilevitz, R. Ostrovsky, and A. Rosen. Characterizing Linear Size Circuits in Terms of Privacy. Journal of Computer and System Sciences, vol.58, pp. 129–136, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  17. I. Newman. Private vs. Common Random Bits in Communication Complexity. Information Processing Letters, vol.39, pp.67–71, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  18. M.A. Nielsen and I.L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.

    Google Scholar 

  19. A.C.-C. Yao. Protocols for Secure Computations. 23rd IEEE Symposium on Foundations of Computer Science, pp. 160–164, 1982.

    Google Scholar 

  20. A.C.-C. Yao. Quantum circuit complexity. 34th IEEE Symposium on Foundations of Computer Science, pp. 352–361, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI, P.O. Box 94079, 1090, Amsterdam, GB, The Netherlands

    Hartmut Klauck

Authors
  1. Hartmut Klauck
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Computer Science, Free University of Berlin, Takustraße 9, 14195, Berlin, Germany

    Helmut Alt

  2. CNRS - I3S - INRIA Sophia Antipolis, 2004 Route des Lucioles, 06902, Sophia Antipolis, France

    Afonso Ferreira

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klauck, H. (2002). On Quantum and Approximate Privacy. In: Alt, H., Ferreira, A. (eds) STACS 2002. STACS 2002. Lecture Notes in Computer Science, vol 2285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45841-7_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-45841-7_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43283-8

  • Online ISBN: 978-3-540-45841-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation