On quantum and approximate privacy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2285, Issue , 2002, Pages 335-346

  Klauck, Hartmut ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

CLASSICAL COMMUNICATION; COMMUNICATION COMPLEXITY; COMPUTABLE FUNCTIONS; EXPONENTIAL REDUCTION; INFORMATION LEAKAGE; QUANTUM PROTOCOLS; SECURE FUNCTION EVALUATION;

QUANTUM COMMUNICATION;

EID: 84937442304     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_27     Document Type: Conference Paper

References (20)

1. D. Aharonov, A. Kitaev, and N. Nisan. Quantum circuits with mixed states. 30th ACM Symposium on Theory of Computing, pp. 20–30, 1998.
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.
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.
4. D. Beaver. Perfect privacy for two party protocols. Technical Report TR-11-89, Harvard University, 1989.
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.
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.
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.
8. V. Buzek and M. Hillery. Quantum Copying: Beyond the No-Cloning Theorem. Phys. Rev. A, vol.54, pp.1844-1852, 1996.
9. D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. 20th ACM Symposium on Theory of Computing, pp. 11–19, 1988.
10. B. Chor and E. Kushilevitz. A zero-one law for Boolean privacy. SIAM Journal Discrete Math., vol.4, pp.36–47, 1991.
11. T.M. Cover and J.A. Thomas. Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, 1991.
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.
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.
14. E. Kushilevitz. Privacy and Communication Complexity. SIAM Journal Discrete Math., vol.5, pp.273–284, 1992.
15. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
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.
17. I. Newman. Private vs. Common Random Bits in Communication Complexity. Information Processing Letters, vol.39, pp.67–71, 1991.
18. M.A. Nielsen and I.L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
19. A.C.-C. Yao. Protocols for Secure Computations. 23rd IEEE Symposium on Foundations of Computer Science, pp. 160–164, 1982.
20. A.C.-C. Yao. Quantum circuit complexity. 34th IEEE Symposium on Foundations of Computer Science, pp. 352–361, 1993.