{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:15:30Z","timestamp":1740287730760,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260523"},{"type":"electronic","value":"9783540320739"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11429647_4","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:18:25Z","timestamp":1279045105000},"page":"18-33","source":"Crossref","is-referenced-by-count":3,"title":["On Private Computation in Incomplete Networks"],"prefix":"10.1007","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(98)00241-2","volume":"220","author":"A. Beimel","year":"1999","unstructured":"Beimel, A., Franklin, M.: Reliable communication over partially authenticated networks. Theoretical Computer Science\u00a0220, 185\u2013210 (1999)","journal-title":"Theoretical Computer Science"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Beimel, A., Malka, L.: Efficient reliable communication over partially authenticated networks. In: The 22nd PODC, pp. 233\u2013242 (2003)","DOI":"10.1145\/872035.872070"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: The 20th STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"4_CR4","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., Manthey, B.: Private computation \u2013 k-connected vs. 1-connected networks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 194\u2013209. Springer, Heidelberg (2002)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-540-30539-2_11","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"M. Bl\u00e4ser","year":"2004","unstructured":"Bl\u00e4ser, M., Jakoby, A., Li\u015bkiewicz, M., Manthey, B.: Privacy in non-private environments. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 137\u2013151. Springer, Heidelberg (2004)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory (1998)","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: The 20th STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"issue":"1","key":"4_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. SIDMA\u00a04(1), 36\u201347 (1991)","journal-title":"SIDMA"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00145-001-0002-y","volume":"14","author":"Y. Desmedt","year":"2001","unstructured":"Desmedt, Y., Wang, Y.: Secure communication in multicast channels: The answer to Franklin and Wright\u2019s question. J. of Cryptology\u00a014(2), 121\u2013135 (2001)","journal-title":"J. of Cryptology"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-46035-7_33","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"Y.G. Desmedt","year":"2002","unstructured":"Desmedt, Y.G., Wang, Y.: Perfectly secure message transmission revisited. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 502\u2013517. Springer, Heidelberg (2002)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev, D.: The Byzantine generals strike again. J. of Algorithms\u00a03, 14\u201330 (1982)","journal-title":"J. of Algorithms"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. J. of the ACM\u00a040(1), 17\u201347 (1993)","journal-title":"J. of the ACM"},{"issue":"5","key":"4_CR13","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1137\/0217061","volume":"17","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Peleg, D., Pippenger, N., Upfal, E.: Fault tolerance in networks of bounded degree. SIAM J. on Computing\u00a017(5), 975\u2013988 (1988)","journal-title":"SIAM J. on Computing"},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BF01843568","volume":"1","author":"M.J. Fischer","year":"1986","unstructured":"Fischer, M.J., Lynch, N.A., Merritt, M.: Easy impossibility proofs for distributed consensus problems. Distributed Computing\u00a01(1), 26\u201339 (1986)","journal-title":"Distributed Computing"},{"issue":"1","key":"4_CR15","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s001459910002","volume":"13","author":"M. Franklin","year":"2000","unstructured":"Franklin, M., Wright, R.N.: Secure communication in minimal connectivity models. J. of Cryptology\u00a013(1), 9\u201330 (2000)","journal-title":"J. of Cryptology"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Franklin, M., Yung, M.: Secure hypergraphs: privacy from partial broadcast. In: The 25th STOC, pp. 36\u201344 (1993)","DOI":"10.1145\/225058.225077"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Linial, N.: Fault-tolerant computation in the full information model. In: The 32nd FOCS, pp. 447\u2013457 (1991)","DOI":"10.1109\/SFCS.1991.185405"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-36494-3_12","volume-title":"STACS 2003","author":"A. Jakoby","year":"2003","unstructured":"Jakoby, A., Liskiewicz, M., Reischuk, R.: Private computations in networks: Topology versus randomness. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 121\u2013132. Springer, Heidelberg (2003)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Kumar, M.V.N.A., Goundan, P.R., Srinathan, K., Pandu Rangan, C.: On perfectly secure communication over arbitrary networks. In: The 21st PODC, pp. 193\u2013202 (2002)","DOI":"10.1145\/571825.571858"},{"issue":"2","key":"4_CR20","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. SIDMA\u00a05(2), 273\u2013284 (1992)","journal-title":"SIDMA"},{"key":"4_CR21","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1997","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufman Publishers, San Francisco (1997)"},{"key":"4_CR22","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K. Menger","year":"1927","unstructured":"Menger, K.: Allgemeinen kurventheorie. Fund. Math.\u00a010, 96\u2013115 (1927)","journal-title":"Fund. Math."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: The 21st STOC, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/inco.1996.0033","volume":"126","author":"H.M. Sayeed","year":"1996","unstructured":"Sayeed, H.M., Abu-Amara, H.: Efficient perfectly secure message transmission in synchronous networks. Information and Computation\u00a0126, 53\u201361 (1996)","journal-title":"Information and Computation"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Srinathan, K., Vinod, V., Pandu Rangan, C.: Efficient perfectly secure communication over synchronous networks. In: The 22nd PODC, p. 252 (2003)","DOI":"10.1145\/872035.872072"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/978-3-540-28628-8_33","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"K. Srinathan","year":"2004","unstructured":"Srinathan, K., Vinod, V., Pandu Rangan, C.: Optimal perfectly secure message transmission. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 545\u2013561. Springer, Heidelberg (2004)"},{"issue":"2","key":"4_CR27","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1006\/inco.1994.1099","volume":"115","author":"E. Upfal","year":"1994","unstructured":"Upfal, E.: Tolerating a linear number of faults in networks of bounded degree. Information and Computation\u00a0115(2), 312\u2013320 (1994)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11429647_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:52:35Z","timestamp":1740261155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11429647_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260523","9783540320739"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11429647_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}