{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T20:10:02Z","timestamp":1736539802219,"version":"3.32.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,9,8]],"date-time":"2006-09-08T00:00:00Z","timestamp":1157673600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2006,11,23]]},"DOI":"10.1007\/s00446-006-0010-0","type":"journal-article","created":{"date-parts":[[2006,9,7]],"date-time":"2006-09-07T06:44:57Z","timestamp":1157611497000},"page":"237-252","source":"Crossref","is-referenced-by-count":10,"title":["On private computation in incomplete networks"],"prefix":"10.1007","volume":"19","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,9,8]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0304-3975(98)00241-2","volume":"220","author":"A. Beimel","year":"1999","unstructured":"Beimel A., Franklin M. (1999): Reliable communication over partially authenticated networks. Theoret. Comput. Sci. 220, 185\u2013210","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00446-004-0119-y","volume":"18","author":"A. Beimel","year":"2005","unstructured":"Beimel A., Malka L. (2005): Efficient reliable communication over partially authenticated networks. Distrib. Comput. 18(1): 1 \u2013 19","journal-title":"Distrib. Comput."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: theorems for noncryptographic fault-tolerant distributed computations. In: Proceedings of the 20th ACM Symposium on the Theory of Computing, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"10_CR4","unstructured":"Bl\u00e4ser, M., Jakoby, A., Li\u015bkiewicz, M., Manthey, B.: Private computation \u2013 k-connected versus 1-connected networks. In: Advances in Cryptology\u2014CRYPTO 2002, Lecture Notes in Computer Science, vol. 2442, pp. 194\u2013209. Springer, Heidelberg New York (2002). Journal version: J. Cryptol. 19(3), 341\u2013357, (2006)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bl\u00e4ser, M., Jakoby, A., Li\u015bkiewicz, M., Manthey, B.: Privacy in non-private environments. In: Advances in Cryptology\u2014ASIACRYPT 2004, Lecture Notes in Computer Science, vol. 3329, pp. 137 \u2013 151. Springer, Berlin Heidelberg New York (2004)","DOI":"10.1007\/978-3-540-30539-2_11"},{"key":"10_CR6","volume-title":"Modern Graph Theory, Graduate Texts in Mathematics, vol. 184","author":"B. Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s B. (1998): Modern Graph Theory, Graduate Texts in Mathematics, vol. 184. Springer, Berlin Heidelberg New York"},{"issue":"1","key":"10_CR7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti R. (2000): Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1): 143\u2013202","journal-title":"J. Cryptol."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: Proceedings of the 20th ACM Symposium on the Theory of Computing, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"issue":"1","key":"10_CR9","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1137\/0404004","volume":"4","author":"B. Chor","year":"1991","unstructured":"Chor B., Kushilevitz E. (1991): A zero-one law for Boolean privacy. SIAM J. Discrete Math. 4(1): 36\u201347","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"10_CR10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s00145-001-0002-y","volume":"14","author":"Y.G. Desmedt","year":"2001","unstructured":"Desmedt Y.G., Wang Y. (2001): Secure communication in multicast channels: the answer to Franklin and Wright\u2019s question. J. Cryptol. 14(2): 121\u2013135","journal-title":"J. Cryptol."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Desmedt, Y.G., Wang, Y.: Perfectly secure message transmission revisited. In: Knudsen, L. (ed.) Advances in Cryptology\u2014EUROCRYPT 2002, Lecture Notes in Computer Science, vol. 2332, pp. 502\u2013517. Springer, Berlin Heidelberg New York (2002)","DOI":"10.1007\/3-540-46035-7_33"},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev D. (1982): The Byzantine generals strike again. J. Algorithms 3, 14\u201330","journal-title":"J. Algorithms"},{"issue":"1","key":"10_CR13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"Dolev D., Dwork C., Waarts O., Yung M. (1993): Perfectly secure message transmission. J. ACM 40(1): 17\u201347","journal-title":"J. ACM"},{"issue":"5","key":"10_CR14","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1137\/0217061","volume":"17","author":"C. Dwork","year":"1988","unstructured":"Dwork C., Peleg D., Pippenger N., Upfal E. (1988): Fault tolerance in networks of bounded degree. SIAM J. Comput. 17(5): 975\u2013988","journal-title":"SIAM J. Comput."},{"key":"10_CR15","unstructured":"Even, S.: Graph Algorithms. Computer Science press (1979)"},{"issue":"1","key":"10_CR16","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BF01843568","volume":"1","author":"M.J. Fischer","year":"1986","unstructured":"Fischer M.J., Lynch N.A., Merritt M. (1986): Easy impossibility proofs for distributed consensus problems. Distrib. Comput. 1(1): 26\u201339","journal-title":"Distrib. Comput."},{"issue":"1","key":"10_CR17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s001459910002","volume":"13","author":"M. Franklin","year":"2000","unstructured":"Franklin M., Wright R.N. (2000): Secure communication in minimal connectivity models. J. Cryptol. 13(1): 9\u201330","journal-title":"J. Cryptol."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Franklin, M., Yung, M.: Secure hypergraphs: Privacy from partial broadcast. In: Proceedings of the 27th ACM Symposium on the Theory of Computing, pp. 36\u201344 (1995)","DOI":"10.1145\/225058.225077"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Linial, N.: Fault-tolerant computation in the full information model. In: Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, pp. 447\u2013457 (1991)","DOI":"10.1109\/SFCS.1991.185405"},{"issue":"1","key":"10_CR20","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"2000","unstructured":"Hirt M., Maurer U. (2000): Player simulation and general adversary structures in perfect multiparty computation. J. Cryptol. 13(1): 31\u201360","journal-title":"J. Cryptol."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Jakoby, A., Li\u015bkiewicz, M., Reischuk, R.: Private computations in networks: Topology versus randomness. In: Proceedings of the 20th International Symposium on Theoretical of Computer Science, Lecture Notes is Computer Science, vol. 2607, pp. 121\u2013132. Springer, Berlin Heidelberg New York (2003)","DOI":"10.1007\/3-540-36494-3_12"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Kumar, M.V.N.A., Goundan, P.R., Srinathan, K., Rangan, C.P.: On perfectly secure communication over arbitrary networks. In: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing, pp. 193\u2013202 (2002)","DOI":"10.1145\/571825.571858"},{"issue":"2","key":"10_CR23","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0405021","volume":"5","author":"E. Kushilevitz","year":"1992","unstructured":"Kushilevitz E. (1992): Privacy and communication complexity. SIAM J. Discrete Math. 5(2): 273\u2013284","journal-title":"SIAM J. Discrete Math."},{"key":"10_CR24","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1997","unstructured":"Lynch N.A. (1997): Distributed Algorithms. Morgan Kaufman Publishers, San Fransisco"},{"key":"10_CR25","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. (1927): Allgemeinen kurventheorie. Fund. Math. 10, 96\u2013115","journal-title":"Fund. Math."},{"key":"10_CR26","unstructured":"Micali, S., Rogaway, P.: Secure computation. In: Feigenbaum, J. (ed.) Advances in Cryptology\u2014CRYPTO \u201991, Lecture Notes in Computer Science, vol. 576, pp. 392\u2013404. Springer, Berlin Heidelberg New York (1992). An updated version presented at the workshop on multi-party computation, Weizmann Inst., 1998"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the 21st ACM Symposium on the Theory of Computing, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"10_CR28","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1006\/inco.1996.0033","volume":"126","author":"H.M. Sayeed","year":"1996","unstructured":"Sayeed H.M., Abu-Amara H. (1996): Efficient perfectly secure message transmission in synchronous networks. Inform. Comput. 126, 53\u201361","journal-title":"Inform. Comput."},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Srinathan, K., Vinod, V., Rangan, C.P.: Efficient perfectly secure communication over synchronous networks. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing, pp. 252\u2013252 (2003)","DOI":"10.1145\/872035.872072"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Srinathan, K., Vinod, V., Rangan, C.P.: Optimal perfectly secure message transmission. In: Franklin, M. (ed.) Advances in Cryptology\u2014CRYPTO 2004, Lecture Notes in Computer Science, vol. 3152, pp. 545 \u2013 561 (2004)","DOI":"10.1007\/978-3-540-28628-8_33"},{"issue":"2","key":"10_CR31","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1006\/inco.1994.1099","volume":"115","author":"E. Upfal","year":"1994","unstructured":"Upfal E. (1994): Tolerating a linear number of faults in networks of bounded degree. Inform. Comput. 115(2): 312\u2013320","journal-title":"Inform. Comput."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0010-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-006-0010-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0010-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T19:48:27Z","timestamp":1736538507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-006-0010-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,8]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,11,23]]}},"alternative-id":["10"],"URL":"https:\/\/doi.org\/10.1007\/s00446-006-0010-0","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2006,9,8]]}}}