{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T03:59:25Z","timestamp":1769313565302,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540006237","type":"print"},{"value":"9783540364948","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36494-3_12","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T17:12:04Z","timestamp":1269882724000},"page":"121-132","source":"Crossref","is-referenced-by-count":9,"title":["Private Computations in Networks: Topology versus Randomness"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Jakoby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Li\u015bkiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00fcdiger","family":"Reischuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,17]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"J. Bar-Ilan, D. Beaver, Non-Cryptographic Fault-Tolerant Computing in Constant Number of Rounds of Interaction, Proc. 8. PODC, 1989, 201\u2013209.","DOI":"10.1145\/72981.72995"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"M. Bl\u00e4ser, A. Jakoby, M. Li\u015bkiewicz, and B. Siebert, Private Computation-kconnected versus 1-connected Networks, Proc. 22. CRYPTO, 2002, 194\u2013209.","DOI":"10.1007\/3-540-45708-9_13"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, G. Persiano, U. Vaccaro, On the Number of Random Bits in Totally Private Computation, Proc. 22. ICALP, 1995, 171\u2013182.","DOI":"10.1007\/3-540-60084-1_72"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness Theorem for Non cryptographic Fault-tolerant Distributed Computing, Proc. 20. STOC, 1988, 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd, Multiparty unconditionally secure protocols, Proc. 20. STOC, 1988, 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"12_CR6","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, E. Kushilevitz, Private Computations Over the Integers, SIAM J. Computing 24, 1995, 376\u2013386.","journal-title":"SIAM J. Computing"},{"key":"12_CR7","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, E. Kushilevitz, A Communication-Privacy Tradeo. for Modular Addition, Information Processing Letters 45, 1993, 205\u2013210.","journal-title":"Information Processing Letters"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"R. Canetti, R. Ostrovsky, Secure Computation with Honest-Looking Parties: What if nobody is truly honest?, Proc. 31. STOC, 1999, 35\u201344.","DOI":"10.1145\/301250.301313"},{"key":"12_CR9","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, S. C. Locke, Cycles and paths through specified vertices in kconnected graphs, Journal of Combinatorial Theory Series B 52, 1991, 20\u201329.","journal-title":"Journal of Combinatorial Theory"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"M. Franklin, M. Yung, Secure hypergraphs: privacy from partial broadcast (Extended Abstract), Proc. 27. STOC, 1995, 36\u201344.","DOI":"10.1145\/225058.225077"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"A. G\u00e1l, A. Ros\u00e9n, A Theorem on Sensitivity and Applications in Private Computation, Proc. 31. STOC, 1999, 348\u2013357.","DOI":"10.1145\/301250.301340"},{"key":"12_CR12","first-page":"218","volume":"28","author":"O. Goldreich","year":"1987","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to Play any Mental Game or a Completeness Theorem for Protocols with Honest Majority, 28. FOCS, 1987, 218\u2013229.","journal-title":"How to Play any Mental Game or a Completeness Theorem for Protocols with Honest Majority"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz, R. Ostrovsky, A. Ros\u00e9n, Characterizing Linear Size Circuits in Terms of Privacy, Proc. 28. STOC, 1996, 541\u2013550.","DOI":"10.1145\/237814.238002"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/S0895480196306130","volume":"10","author":"E. Kushilevitz","year":"1997","unstructured":"E. Kushilevitz, Y. Mansour, Randomness in Private Computations, SIAM J. Discrete Math 10, 1997, 647\u2013661.","journal-title":"SIAM J. Discrete Math"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/S089548019427634X","volume":"11","author":"E. Kushilevitz","year":"1998","unstructured":"E. Kushilevitz, A. Ros\u00e9n, A Randomness-Rounds Tradeo. in Private Computation, SIAM J. Discrete Math 11, 1998, 61\u201380.","journal-title":"SIAM J. Discrete Math"},{"key":"12_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, 1992, 273\u2013284.","journal-title":"SIAM J. Discrete Math"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"A. C. Yao, Protocols for Secure Computations, Proc. 23. FOCS, 1982, 160\u2013164.","DOI":"10.1109\/SFCS.1982.38"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"A. C. Yao, How to generate and exchange secrets, Proc. 27. FOCS, 1986, 162\u2013167.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","STACS 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36494-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T15:02:04Z","timestamp":1558969324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36494-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540006237","9783540364948"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-36494-3_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}