{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,22]],"date-time":"2024-12-22T15:10:01Z","timestamp":1734880201442,"version":"3.32.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"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":[[2005,7]]},"DOI":"10.1007\/s00446-004-0119-y","type":"journal-article","created":{"date-parts":[[2005,1,12]],"date-time":"2005-01-12T12:32:11Z","timestamp":1105533131000},"page":"1-19","source":"Crossref","is-referenced-by-count":8,"title":["Efficient reliable communication over partially authenticated networks"],"prefix":"10.1007","volume":"18","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Lior","family":"Malka","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"119_CR1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0304-3975(98)00241-2","volume":"220","author":"Beimel","year":"1999","unstructured":"Beimel A, Franklin M: Reliable communication over partially authenticated networks. Theoretical Computer Science 220:185-210 (1999)","journal-title":"Theoretical Computer Science"},{"key":"119_CR2","doi-asserted-by":"crossref","unstructured":"Beimel A, Malka L: Efficient reliable communication over partially authenticated networks. In: Proc. of the 22nd ACM symp. on Principles of Distributed Computing, pp 233-242, 2003","DOI":"10.1145\/872035.872070"},{"key":"119_CR3","doi-asserted-by":"crossref","unstructured":"Bl\u00e4ser M, Jakoby A, Li\u015bkiewicz M, Manthey B: Private computation - k-connected versus 1-connected networks. In: Advances in Cryptology - CRYPTO 2002. Lect Notes Comput Sci, vol 2442, pp 194-209. Springer, 2002","DOI":"10.1007\/3-540-45708-9_13"},{"key":"119_CR4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"Carter","year":"1979","unstructured":"Carter J, Wegman M: Universal classes of hash functions. J. Comput Syst Sci 18:143-154 (1979)","journal-title":"Comput Syst Sci"},{"key":"119_CR5","first-page":"121","volume":"14","author":"Desmedt","year":"2","unstructured":"Desmedt Y, Wang Y: Secure communication in multicast channels: The answer to Franklin and Wright's question. J Cryptol 14(2):121-135 (2001)","journal-title":"J Cryptol"},{"key":"119_CR6","doi-asserted-by":"crossref","unstructured":"Desmedt Y, Wang Y: Perfectly secure message transmission revisited. In: Knudsen L (ed) Advances in Cryptology - EUROCRYPT 2002, Lect Notes Comput Sci, vol 2332, pp 502-517. Springer, 2002","DOI":"10.1007\/3-540-46035-7_33"},{"key":"119_CR7","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"Dolev","year":"1982","unstructured":"Dolev D: The Byzantine generals strike again. J Algorithms 3:14-30 (1982)","journal-title":"J Algorithms"},{"key":"119_CR8","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"Dolev","year":"1","unstructured":"Dolev D, Dwork C, Waarts O, Yung M: Perfectly secure message transmission. J ACM 40(1):17-47 (1993)","journal-title":"J ACM"},{"key":"119_CR9","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1137\/0217061","volume":"17","author":"Dwork","year":"5","unstructured":"Dwork C, Peleg D, Pippenger N, Upfal E: Fault tolerance in networks of bounded degree. SIAM J Comput 17(5):975-988 (1988)","journal-title":"SIAM J Comput"},{"key":"119_CR10","unstructured":"Even S: Graph Algorithms. Computer Science Press, 1979"},{"key":"119_CR11","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BF01843568","volume":"1","author":"Fischer","year":"1","unstructured":"Fischer MJ, Lynch NA, Merritt M: Easy impossibility proofs for distributed consensus problems. Distrib Comput 1(1):26-39 (1986)","journal-title":"Distrib Comput"},{"key":"119_CR12","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s001459910002","volume":"13","author":"Franklin","year":"1","unstructured":"Franklin M, Wright RN: Secure communication in minimal connectivity models. J Cryptology 13(1):9-30 (2000)","journal-title":"J Cryptology"},{"key":"119_CR13","doi-asserted-by":"crossref","unstructured":"Franklin M, Yung M: Secure hypergraphs: privacy from partial broadcast. In: Proc. of the 25th ACM Symp. on the Theory of Computing, pp 36-44, 1993","DOI":"10.1145\/225058.225077"},{"key":"119_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich O, Goldwasser S, Linial N: Fault-tolerant computation in the full information model. In: Proc. of the 32nd IEEE Symp. on Foundations of Computer Science, pp 447-457, 1991","DOI":"10.1109\/SFCS.1991.185405"},{"key":"119_CR15","doi-asserted-by":"crossref","unstructured":"Krawczyk H: LFSR-based hashing and authentication. In: Desmedt YG (ed) Advances in Cryptology - CRYPTO '94, Lect Notes Comput Sci, vol 839, pp 129-139 Springer, 1994","DOI":"10.1007\/3-540-48658-5_15"},{"key":"119_CR16","doi-asserted-by":"crossref","unstructured":"Krawczyk H: New hash functions for message authentication. In: Guillou LC, Quisquater J-J (eds) Advances in Cryptology - EUROCRYPT '95, Lect Notes Comput Sci, vol 921, pp 301-310, Springer, 1995","DOI":"10.1007\/3-540-49264-X_24"},{"key":"119_CR17","doi-asserted-by":"crossref","unstructured":"Kumar MVNA, Goundan PR, Srinathan K, Rangan CP: On perfectly secure communication over arbitrary networks. In: Proc. of the 21st ACM symp. on Principles of Distributed Computing, pp 193-202, 2002","DOI":"10.1145\/571825.571858"},{"key":"119_CR18","unstructured":"Lynch NA: Distributed Algorithms. Morgan Kaufman Publishers, 1997"},{"key":"119_CR19","doi-asserted-by":"crossref","unstructured":"Rabin T, Ben-Or M: Verifiable secret sharing and multiparty protocols with honest majority. In: Proc. of the 21st ACM Symp. on the Theory of Computing, pp 73-85, 1989","DOI":"10.1145\/73007.73014"},{"key":"119_CR20","doi-asserted-by":"crossref","unstructured":"Sayeed HM, Abu-Amara H: Perfectly secure message transmission in asynchronous networks. In: Proc. of the 7th IEEE Symposium on Parallel and Distributed Processing, pp 100-105, 1995","DOI":"10.1109\/SPDP.1995.530671"},{"key":"119_CR21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1006\/inco.1996.0033","volume":"126","author":"Sayeed","year":"1996","unstructured":"Sayeed HM, Abu-Amara H: Efficient perfectly secure message transmission in synchronous networks. Information and Computation 126:53-61 (1996)","journal-title":"Information and Computation"},{"key":"119_CR22","unstructured":"Simmons GJ: A survey of information authentication. In: Simmons GJ (ed) Contemporary Cryptology, The Science of Information Integrity, pp 441-497. IEEE Press, 1992"},{"key":"119_CR23","doi-asserted-by":"crossref","unstructured":"Srinathan K, Vinod V, Pandu Rangan C: Efficient perfectly secure communication over synchronous networks. In: Proc. of the 22nd ACM symp. on Principles of Distributed Computing, pp 252-252, 2003","DOI":"10.1145\/872035.872072"},{"key":"119_CR24","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1006\/inco.1994.1099","volume":"115","author":"Upfal","year":"2","unstructured":"Upfal E: Tolerating a linear number of faults in networks of bounded degree. Information and Computation 115(2):312-320 (1994)","journal-title":"Information and Computation"},{"key":"119_CR25","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"Wegman","year":"1981","unstructured":"Wegman M, Carter J: New hash functions and their use in authentication and set equality. J Comput Syst Sci 22:265-279 (1981)","journal-title":"J Comput Syst Sci"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-004-0119-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-004-0119-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-004-0119-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,22]],"date-time":"2024-12-22T14:29:16Z","timestamp":1734877756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-004-0119-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["119"],"URL":"https:\/\/doi.org\/10.1007\/s00446-004-0119-y","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}