{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:18:36Z","timestamp":1725549516135},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540239758"},{"type":"electronic","value":"9783540305392"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30539-2_11","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:41:57Z","timestamp":1268401317000},"page":"137-151","source":"Crossref","is-referenced-by-count":4,"title":["Privacy in Non-private Environments"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Jakoby","sequence":"additional","affiliation":[]},{"given":"Maciej","family":"Li\u015bkiewicz","sequence":"additional","affiliation":[]},{"given":"Bodo","family":"Manthey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-540-45077-1_16","volume-title":"Fundamentals of Computation Theory","author":"J. Arpe","year":"2003","unstructured":"Arpe, J., Jakoby, A., Li\u015bkiewicz, M.: One-way communication complexity of symmetric boolean functions. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol.\u00a02751, pp. 158\u2013170. Springer, Heidelberg (2003)"},{"issue":"6","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1930","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 Transactions on Information Theory\u00a039(6), 1930\u20131943 (1993)","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR3","first-page":"1","volume-title":"Proc. of the 20th Ann. ACM Symp. on Theory of Computing (STOC)","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. of the 20th Ann. ACM Symp. on Theory of Computing (STOC), pp. 1\u201310. ACM Press, New York (1988)"},{"key":"11_CR4","volume-title":"Graphs","author":"C. Berge","year":"1991","unstructured":"Berge, C.: Graphs. North-Holland, Amsterdam (1991)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-45708-9_13","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"M. Bl\u00e4ser","year":"2002","unstructured":"Bl\u00e4ser, M., Jakoby, A., Li\u015bkiewicz, M., Siebert, B.: Private computation \u2014 k-connected versus 1-connected networks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 194\u2013209. Springer, Heidelberg (2002)"},{"key":"11_CR6","first-page":"11","volume-title":"Proc. of the 20th Ann. ACM Symp. on Theory of Computing (STOC)","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: Proc. of the 20th Ann. ACM Symp. on Theory of Computing (STOC), pp. 11\u201319. ACM Press, New York (1988)"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1137\/S0097539791194999","volume":"24","author":"B. Chor","year":"1995","unstructured":"Chor, B., Ger\u00e9b-Graus, M., Kushilevitz, E.: Private computations over the integers. SIAM Journal on Computing\u00a024(2), 376\u2013386 (1995)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"11_CR8","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 on Discrete Mathematics\u00a04(1), 36\u201347 (1991)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"11_CR9","first-page":"36","volume-title":"Proc. of the 27th Ann. ACM Symp. on Theory of Computing (STOC)","author":"M. Franklin","year":"1995","unstructured":"Franklin, M., Yung, M.: Secure hypergraphs: Privacy from partial broadcast. In: Proc. of the 27th Ann. ACM Symp. on Theory of Computing (STOC), pp. 36\u201344. ACM Press, New York (1995)"},{"issue":"2","key":"11_CR10","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 on Discrete Mathematics\u00a05(2), 273\u2013284 (1992)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"11_CR11","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jcss.1997.1544","volume":"58","author":"E. Kushilevitz","year":"1999","unstructured":"Kushilevitz, E., Ostrovsky, R., Ros\u00e9n, A.: Characterizing linear size circuits in terms of privacy. Journal of Computer and System Sciences\u00a058(1), 129\u2013136 (1999)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.144700","volume":"38","author":"E.H. Modiano","year":"1992","unstructured":"Modiano, E.H., Ephremides, A.: Communication complexity of secure distributed computation in the presence of noise. IEEE Transactions on Information Theory\u00a038(4), 1193\u20131202 (1992)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/inco.2000.2865","volume":"158","author":"E.H. Modiano","year":"2000","unstructured":"Modiano, E.H., Ephremides, A.: Communication protocols for secure distributed computation of binary functions. Information and Computation\u00a0158(2), 71\u201397 (2000)","journal-title":"Information and Computation"},{"key":"11_CR15","volume-title":"Quantum Computation and Quantum Information, ch. 9","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information, ch. 9. Cambridge University Press, Cambridge (2000)"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/0222016","volume":"22","author":"N. Nisan","year":"1993","unstructured":"Nisan, N., Wigderson, A.: Rounds in communication complexity revisited. SIAM Journal on Computing\u00a022(1), 211\u2013219 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR17","first-page":"217","volume-title":"Proc. of the 16th Ann. ACM Symp. on Theory of Computing (STOC)","author":"A. Orlitsky","year":"1984","unstructured":"Orlitsky, A., El Gamal, A.: Communication with secrecy constraints. In: Proc. of the 16th Ann. ACM Symp. on Theory of Computing (STOC), pp. 217\u2013224. ACM Press, New York (1984)"},{"issue":"3,4","key":"11_CR18","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal\u00a027(3,4), 379\u2013423, 623\u2013656 (1948)","journal-title":"Bell System Technical Journal"},{"key":"11_CR19","volume-title":"The Complexity of Boolean Functions","author":"I. Wegener","year":"1987","unstructured":"Wegener, I.: The Complexity of Boolean Functions. Wiley-Teubner, Chichester (1987)"},{"key":"11_CR20","first-page":"160","volume-title":"Proc. of the 23rd Ann. IEEE Symp. on Foundations of Computer Science (FOCS)","author":"A.C.-C. Yao","year":"1982","unstructured":"Yao, A.C.-C.: Protocols for secure computations. In: Proc. of the 23rd Ann. IEEE Symp. on Foundations of Computer Science (FOCS), pp. 160\u2013164. IEEE Computer Society Press, Los Alamitos (1982)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30539-2_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:59:01Z","timestamp":1605761941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30539-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540239758","9783540305392"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30539-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}