{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:10:41Z","timestamp":1725617441561},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642248283"},{"type":"electronic","value":"9783642248290"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24829-0_6","type":"book-chapter","created":{"date-parts":[[2011,10,3]],"date-time":"2011-10-03T09:11:38Z","timestamp":1317633098000},"page":"44-56","source":"Crossref","is-referenced-by-count":1,"title":["On Communication Protocols That Compute Almost Privately"],"prefix":"10.1007","author":[{"given":"Marco","family":"Comi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bhaskar","family":"DasGupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatakumar","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Ghosh, A., Roughgarden, T., Sundararajan, M.: Universally utility-maximizing privacy mechanisms. In: 41st ACM Symp. on Theory of Computing, pp. 351\u2013360 (2009)","DOI":"10.1145\/1536414.1536464"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0895480101384347","volume":"15","author":"P. Berman","year":"2002","unstructured":"Berman, P., DasGupta, B., Muthukrishnan, S.: On the Exact Size of the Binary Space Partitioning of Sets of Isothetic Rectangles with Applications. SIAM Journal of Discrete Mathematics\u00a015(2), 252\u2013267 (2002)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/18.265501","volume":"39","author":"R. Bar-Yehuda","year":"1993","unstructured":"Bar-Yehuda, R., Chor, B., Kushilevitz, E., Orlitsky, A.: Privacy, additional information, and communication. IEEE Trans. on Inform. Theory\u00a039, 55\u201365 (1993)","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0020-0190(92)90210-M","volume":"44","author":"F. d\u2019Amore","year":"1992","unstructured":"d\u2019Amore, F., Franciosa, P.G.: On the optimal binary plane partition for sets of isothetic rectangles. Information Processing Letters\u00a044, 255\u2013259 (1992)","journal-title":"Information Processing Letters"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damgaard, I.: Multiparty, unconditionally secure protocols. In: 22th ACM Symposium on Theory of Computing, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1137\/0404004","volume":"4","author":"B. Chor","year":"1991","unstructured":"Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy. SIAM Journal of Discrete Mathematics\u00a04, 36\u201347 (1991)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C. Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 1\u201312. Springer, Heidelberg (2006)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Jaggard, A., Schapira, M.: Approximate Privacy: Foundations and Quantification. In: ACM Conference on Electronic Commerce, pp. 167\u2013178 (2010)","DOI":"10.1145\/1807342.1807369"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.orl.2005.07.011","volume":"34","author":"E. Grigorievaa","year":"2006","unstructured":"Grigorievaa, E., Heringsb, P.J.-J., M\u00fcllera, R., Vermeulena, D.: The communication complexity of private value single-item auctions. Operations Research Letters\u00a034, 491\u2013498 (2006)","journal-title":"Operations Research Letters"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s00199-005-0032-z","volume":"30","author":"E. Grigorievaa","year":"2007","unstructured":"Grigorievaa, E., Heringsb, P.J.-J., M\u00fcllera, R., Vermeulena, D.: The private value single item bisection auction. Economic Theory\u00a030, 107\u2013118 (2007)","journal-title":"Economic Theory"},{"key":"6_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Kifer, D., Lin, B.-R.: An Axiomatic View of Statistical Privacy and Utility. Journal of Privacy and Confidentiality (to appear)","DOI":"10.29012\/jpc.v4i1.610"},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0405021","volume":"5","author":"E. Kushilevitz","year":"1992","unstructured":"Kushilevitz, E.: Privacy and communication complexity. SIAM Journal of Discrete Mathematics\u00a05(2), 273\u2013284 (1992)","journal-title":"SIAM Journal of Discrete Mathematics"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02187806","volume":"5","author":"M. Paterson","year":"1990","unstructured":"Paterson, M., Yao, F.F.: Efficient binary space partitions for hidden-surface removal and solid modeling. Discrete & Computational Geometry\u00a05(1), 485\u2013503 (1990)","journal-title":"Discrete & Computational Geometry"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0196-6774(92)90007-Y","volume":"13","author":"M. Paterson","year":"1992","unstructured":"Paterson, M., Yao, F.F.: Optimal binary space partitions for orthogonal objects. Journal of Algorithms\u00a013, 99\u2013113 (1992)","journal-title":"Journal of Algorithms"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Some complexity questions related to distributive computing. In: 11th ACM Symposium on Theory of Computing, pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24829-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T19:57:09Z","timestamp":1560715029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24829-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642248283","9783642248290"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24829-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}