{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:37:10Z","timestamp":1725493030478},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440505"},{"type":"electronic","value":"9783540457084"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45708-9_13","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:48:16Z","timestamp":1192783696000},"page":"194-209","source":"Crossref","is-referenced-by-count":9,"title":["Private Computation \u2014 k-Connected versus 1-Connected Networks"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Jakoby","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Li\u015bkiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bodo","family":"Siebert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,13]]},"reference":[{"key":"13_CR1","unstructured":"N. Alon, J. H. Spencer, and P. Erd\u00f6s. The Probabilistic Method. John Wiley and Sons, 1992."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In Proc. 8th Ann. Symp. on Principles of Distributed Comput. (PODC), pages 201\u2013209. ACM, 1989.","DOI":"10.1145\/72981.72995"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In Proc. 20th Ann. Symp. on Theory of Comput. (STOC), pages 1\u201310. ACM, 1988.","DOI":"10.1145\/62212.62213"},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s000370050025","volume":"8","author":"C. Blundo","year":"1999","unstructured":"C. Blundo, A. de Santis, G. Persiano, and U. Vaccaro. Randomness complexity of private computation. Comput. Complexity, 8(2):145\u2013168, 1999.","journal-title":"Comput. Complexity"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"R. Canetti and R. Ostrovsky. Secure computation with honest-looking parties: What if nobody is truly honest? In Proc. 31st Ann. Symp. on Theory of Comput. (STOC), pages 255\u2013264. ACM, 1999.","DOI":"10.1145\/301250.301313"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00f8ard. Multiparty unconditionally secure protocols. In Proc. 20th Ann. Symp. on Theory of Comput. (STOC), pages 11\u201319. ACM, 1988.","DOI":"10.1145\/62212.62214"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00195209","volume":"7","author":"B. Chor","year":"1994","unstructured":"B. Chor, M. Ger\u00e9b-Graus, and E. Kushilevitz. On the structure of the privacy hierarchy. J. Cryptology, 7(1):53\u201360, 1994.","journal-title":"J. Cryptology"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1137\/S0097539791194999","volume":"24","author":"B. Chor","year":"1995","unstructured":"B. Chor, M. Ger\u00e9b-Graus, and E. Kushilevitz. Private computations over the integers. SIAM J. Comput., 24(2):376\u2013386, 1995.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"13_CR9","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 J. Discrete Math., 4(1):36\u201347, 1991.","journal-title":"SIAM J. Discrete Math"},{"issue":"4","key":"13_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0020-0190(93)90120-X","volume":"45","author":"B. Chor","year":"1993","unstructured":"B. Chor and E. Kushilevitz. A communication-privacy tradeoff for modular addition. Inform. Process. Lett., 45(4):205\u2013210, 1993.","journal-title":"Inform. Process. Lett."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/0095-8956(91)90086-Y","volume":"52","author":"Y. Egawa","year":"1991","unstructured":"Y. Egawa, R. Glas, and S. C. Locke. Cycles and paths through specified vertices in k-connected graphs. J. Combin. Theory Ser. B, 52:20\u201329, 1991.","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s001459910002","volume":"13","author":"M. Franklin","year":"2000","unstructured":"M. Franklin and R. N. Wright. Secure communication in minimal connectivity models. J. Cryptology, 13(1):9\u201330, 2000.","journal-title":"J. Cryptology"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"M. Franklin and M. Yung. Secure hypergraphs: Privacy from partial broadcast. In Proc. 27th Ann. Symp. on Theory of Comput. (STOC), pages 36\u201344. ACM, 1995.","DOI":"10.1145\/225058.225077"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"A. G\u00e1l and A. Ros\u00e9n. A theorem on sensitivity and applications in private computation. In Proc. 31st Ann. Symp. on Theory of Comput. (STOC), pages 348\u2013357. ACM, 1999.","DOI":"10.1145\/301250.301340"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In Proc. 19th Ann. Symp. on Theory of Comput. (STOC), pages 218\u2013229. ACM, 1987.","DOI":"10.1145\/28395.28420"},{"issue":"2","key":"13_CR16","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 J. Discrete Math., 5(2):273\u2013284, 1992.","journal-title":"SIAM J. Discrete Math"},{"issue":"4","key":"13_CR17","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/S0895480196306130","volume":"10","author":"E. Kushilevitz","year":"1997","unstructured":"E. Kushilevitz and Y. Mansour. Randomness in private computations. SIAM J. Discrete Math., 10(4):647\u2013661, 1997.","journal-title":"SIAM J. Discrete Math"},{"issue":"1","key":"13_CR18","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. Ros\u00e9n. Characterizing linear size circuits in terms of privacy. J. Comput. System Sci., 58(1):129\u2013136, 1999.","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/S089548019427634X","volume":"11","author":"E. Kushilevitz","year":"1998","unstructured":"E. Kushilevitz and A. Ros\u00e9n. A randomness-rounds tradeoff in private computation. SIAM J. Discrete Math., 11(1):61\u201380, 1998.","journal-title":"SIAM J. Discrete Math"},{"key":"13_CR20","volume-title":"The Complexity of Boolean Functions","author":"I. Wegener","year":"1987","unstructured":"I. Wegener. The Complexity of Boolean Functions. Wiley-Teubner, 1987."},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"A. C.-C. Yao. Protocols for secure computations. In Proc. 23rd Ann. Symp. on Foundations of Comput. Sci. (FOCS), pages 160\u2013164. IEEE, 1982.","DOI":"10.1109\/SFCS.1982.38"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"A. C.-C. Yao. How to generate and exchange secrets. In Proc. 27th Ann. Symp. on Foundations of Comput. Sci. (FOCS), pages 162\u2013167. IEEE, 1986.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45708-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T21:27:45Z","timestamp":1556918865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45708-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440505","9783540457084"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45708-9_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}