{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T16:35:04Z","timestamp":1691598904239},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,10,16]],"date-time":"2009-10-16T00:00:00Z","timestamp":1255651200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1007\/s00224-009-9243-1","type":"journal-article","created":{"date-parts":[[2009,10,15]],"date-time":"2009-10-15T14:34:57Z","timestamp":1255617297000},"page":"211-245","source":"Crossref","is-referenced-by-count":2,"title":["Privacy in Non-private Environments"],"prefix":"10.1007","volume":"48","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","published-online":{"date-parts":[[2009,10,16]]},"reference":[{"issue":"4","key":"9243_CR1","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1051\/ita:2005037","volume":"39","author":"J. Arpe","year":"2005","unstructured":"Arpe, J., Jakoby, A., Li\u015bkiewicz, M.: One-way communication complexity of symmetric boolean functions. RAIRO Theor. Inf. Appl. 39(4), 687\u2013706 (2005)","journal-title":"RAIRO Theor. Inf. Appl."},{"issue":"6","key":"9243_CR2","doi-asserted-by":"crossref","first-page":"1930\u20131943","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. Inf. Theory 39(6), 1930\u20131943 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"9243_CR3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00446-006-0010-0","volume":"19","author":"A. Beimel","year":"2007","unstructured":"Beimel, A.: On private computation in incomplete networks. Distrib. Comput. 19(3), 237\u2013252 (2007)","journal-title":"Distrib. Comput."},{"key":"9243_CR4","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, New York (1988)"},{"key":"9243_CR5","volume-title":"Graphs","author":"C. Berge","year":"1991","unstructured":"Berge, C.: Graphs. North-Holland, Amsterdam (1991)"},{"issue":"3","key":"9243_CR6","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s00145-005-0329-x","volume":"19","author":"M. Bl\u00e4ser","year":"2006","unstructured":"Bl\u00e4ser, M., Jakoby, A., Li\u015bkiewicz, M., Manthey, B.: Private computation: k-connected versus 1-connected graphs. J. Cryptol. 19(3), 341\u2013357 (2006)","journal-title":"J. Cryptol."},{"key":"9243_CR7","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, New York (1988)"},{"issue":"1","key":"9243_CR8","doi-asserted-by":"crossref","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 J. Discrete Math. 4(1), 36\u201347 (1991)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"9243_CR9","doi-asserted-by":"crossref","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 J. Comput. 24(2), 376\u2013386 (1995)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9243_CR10","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1137\/S0895480198335215","volume":"18","author":"M. Franklin","year":"2004","unstructured":"Franklin, M., Yung, M.: Secure hypergraphs: Privacy from partial broadcast. SIAM J. Discrete Math. 18(3), 437\u2013450 (2004)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"9243_CR11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0405021","volume":"5","author":"E. Kushilevitz","year":"1992","unstructured":"Kushilevitz, E.: Privacy and communication complexity. SIAM J. Discrete Math. 5(2), 273\u2013284 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"9243_CR12","doi-asserted-by":"crossref","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)"},{"issue":"1","key":"9243_CR13","doi-asserted-by":"crossref","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. J.\u00a0Comput. Syst. Sci. 58(1), 129\u2013136 (1999)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"issue":"4","key":"9243_CR14","doi-asserted-by":"crossref","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 Trans. Inf. Theory 38(4), 1193\u20131202 (1992)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9243_CR15","doi-asserted-by":"crossref","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. Inf. Comput. 158(2), 71\u201397 (2000)","journal-title":"Inf. Comput."},{"issue":"1","key":"9243_CR16","doi-asserted-by":"crossref","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 J. Comput. 22(1), 211\u2013219 (1993)","journal-title":"SIAM J. Comput."},{"key":"9243_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., Gamal, A.E.: Communication with secrecy constraints. In: Proc. of the 16th Ann. ACM Symp. on Theory of Computing (STOC), pp. 217\u2013224. ACM, New York (1984)"},{"issue":"3","key":"9243_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 Syst. Tech. J. 27(3), 379\u2013423 (1948)","journal-title":"Bell Syst. Tech. J."},{"issue":"4","key":"9243_CR19","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1002\/j.1538-7305.1948.tb00917.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(4), 623\u2013656 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"9243_CR20","volume-title":"The Complexity of Boolean Functions","author":"I. Wegener","year":"1987","unstructured":"Wegener, I.: The Complexity of Boolean Functions. Wiley\/Teubner, New York\/Leipzig (1987)"},{"key":"9243_CR21","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 Comput. Soc., Los Alamitos (1982)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9243-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-009-9243-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9243-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:38Z","timestamp":1558698698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-009-9243-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,16]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["9243"],"URL":"https:\/\/doi.org\/10.1007\/s00224-009-9243-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,16]]}}}