{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:04Z","timestamp":1725489124981},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540432838"},{"type":"electronic","value":"9783540458418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45841-7_27","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:11:17Z","timestamp":1186891877000},"page":"335-346","source":"Crossref","is-referenced-by-count":3,"title":["On Quantum and Approximate Privacy"],"prefix":"10.1007","author":[{"given":"Hartmut","family":"Klauck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,21]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"D. Aharonov, A. Kitaev, and N. Nisan. Quantum circuits with mixed states. 30th ACM Symposium on Theory of Computing, pp. 20\u201330, 1998.","DOI":"10.1145\/276698.276708"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. 27th IEEE Symposium on Foundations of Computer Science, pp.303\u2013312, 1986.","DOI":"10.1109\/SFCS.1986.15"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"1930","DOI":"10.1109\/18.265501","volume":"39","author":"R. Bar-Yehuda","year":"1993","unstructured":"R. Bar-Yehuda, B. Chor, E. Kushilevitz, and A. Orlitsky. Privacy, Additional Information, and Communication. IEEE Transactions on Information Theory, vol.39, pp.1930\u20131943, 1993.","journal-title":"IEEE Transactions on Information Theory"},{"key":"27_CR4","unstructured":"D. Beaver. Perfect privacy for two party protocols. Technical Report TR-11-89, Harvard University, 1989."},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"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\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"27_CR6","unstructured":"M. Boyer, G. Brassard, P. H\u00f8yer, and A. Tapp. Tight bounds on quantum searching. 4th Workshop on Physics and Computation, pp.36\u201343, 1996."},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"H. Buhrman, R. Cleve, and A. Wigderson. Quantum vs. classical communication and computation. 30th ACM Symposium on Theory of Computing, pp. 63\u201368, 1998.","DOI":"10.1145\/276698.276713"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"1844","DOI":"10.1103\/PhysRevA.54.1844","volume":"54","author":"V. Buzek","year":"1996","unstructured":"V. Buzek and M. Hillery. Quantum Copying: Beyond the No-Cloning Theorem. Phys. Rev. A, vol.54, pp.1844\u20131852, 1996.","journal-title":"Phys. Rev. A"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. 20th ACM Symposium on Theory of Computing, pp. 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1137\/0404004","volume":"4","author":"B. Chor","year":"1991","unstructured":"B. Chor and E. Kushilevitz. A zero-one law for Boolean privacy. SIAM Journal Discrete Math., vol.4, pp.36\u201347, 1991.","journal-title":"SIAM Journal Discrete Math."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"T.M. Cover and J.A. Thomas. Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, 1991.","DOI":"10.1002\/0471200611"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to Play Any Mental Game. 19th ACM Symposium on Theory of Computing, pp.218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013133, 2001.","DOI":"10.1145\/380752.380786"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0405021","volume":"5","author":"E. Kushilevitz","year":"1992","unstructured":"E. Kushilevitz. Privacy and Communication Complexity. SIAM Journal Discrete Math., vol.5, pp.273\u2013284, 1992.","journal-title":"SIAM Journal Discrete Math."},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511574948"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jcss.1997.1544","volume":"58","author":"E. Kushilevitz","year":"1999","unstructured":"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\u2013136, 1999.","journal-title":"Journal of Computer and System Sciences"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(91)90157-D","volume":"39","author":"I. Newman","year":"1991","unstructured":"I. Newman. Private vs. Common Random Bits in Communication Complexity. Information Processing Letters, vol.39, pp.67\u201371, 1991.","journal-title":"Information Processing Letters"},{"key":"27_CR18","unstructured":"M.A. Nielsen and I.L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000."},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"A.C.-C. Yao. Protocols for Secure Computations. 23rd IEEE Symposium on Foundations of Computer Science, pp. 160\u2013164, 1982.","DOI":"10.1109\/SFCS.1982.38"},{"key":"27_CR20","unstructured":"A.C.-C. Yao. Quantum circuit complexity. 34th IEEE Symposium on Foundations of Computer Science, pp. 352\u2013361, 1993."}],"container-title":["Lecture Notes in Computer Science","STACS 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45841-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T20:00:29Z","timestamp":1556740829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45841-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540432838","9783540458418"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45841-7_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}