{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T21:41:34Z","timestamp":1758404494548},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5160,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,6]]},"DOI":"10.1016\/s0304-3975(98)00241-2","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"185-210","source":"Crossref","is-referenced-by-count":21,"title":["Reliable communication over partially authenticated networks"],"prefix":"10.1016","volume":"220","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Franklin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00241-2_BIB1","series-title":"Proc. 20th Annu. ACM Symp. on the Theory of Computing","first-page":"1","article-title":"Completeness theorems for noncryptographic fault-tolerant distributed computations","author":"Ben-Or","year":"1988"},{"key":"10.1016\/S0304-3975(98)00241-2_BIB2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","article-title":"Universal classes of hash functions","volume":"18","author":"Carter","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00241-2_BIB3","series-title":"Proc. 20th Annu. ACM Symp. on the Theory of Computing","first-page":"11","article-title":"Multiparty unconditionally secure protocols","author":"Chaum","year":"1988"},{"key":"10.1016\/S0304-3975(98)00241-2_BIB4","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","article-title":"The Byzantine generals strike again","volume":"3","author":"Dolev","year":"1982","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/S0304-3975(98)00241-2_BIB5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/138027.138036","article-title":"Perfectly secure message transmission","volume":"40","author":"Dolev","year":"1993","journal-title":"J. ACM"},{"issue":"5","key":"10.1016\/S0304-3975(98)00241-2_BIB6","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1137\/0217061","article-title":"Fault tolerance in networks of bounded degree","volume":"17","author":"Dwork","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00241-2_BIB7","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"issue":"1","key":"10.1016\/S0304-3975(98)00241-2_BIB8","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BF01843568","article-title":"Easy impossibility proofs for distributed consensus problems","volume":"1","author":"Fischer","year":"1986","journal-title":"Distrib. Computing"},{"key":"10.1016\/S0304-3975(98)00241-2_BIB9","series-title":"Reliable and private communication over echo lines","author":"Franklin","year":"1997"},{"key":"10.1016\/S0304-3975(98)00241-2_BIB10","series-title":"Special section on group communication","volume":"39","year":"1996"},{"key":"10.1016\/S0304-3975(98)00241-2_BIB11","series-title":"LFSR-based hashing and authentication, Advances in Cryptology \u2014 CRYPTO '94","first-page":"129","volume":"vol. 839","author":"Krawczyk","year":"1994"},{"key":"10.1016\/S0304-3975(98)00241-2_BIB12","series-title":"Advances in cryptology: EUROCRYPT '95","first-page":"301","article-title":"New hash functions for message authentication","volume":"vol. 921","author":"Krawczyk","year":"1995"},{"key":"10.1016\/S0304-3975(98)00241-2_BIB13","series-title":"Distributed Algorithms","author":"Lynch","year":"1997"},{"key":"10.1016\/S0304-3975(98)00241-2_BIB14","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","article-title":"Allgemeinen kurventheorie","volume":"10","author":"Menger","year":"1997","journal-title":"Fund. Math."},{"issue":"2","key":"10.1016\/S0304-3975(98)00241-2_BIB15","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","article-title":"Reaching agreements in the presence of faults","volume":"27","author":"Pease","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00241-2_BIB16","series-title":"Proc. 21st Annu. ACM Symp. on the Theory of Computing","first-page":"73","article-title":"Verifiable secret sharing and multiparty protocols with honest majority","author":"Rabin","year":"1989"},{"key":"10.1016\/S0304-3975(98)00241-2_BIB17","series-title":"Contemporary Cryptology, The Science of Information Integrity","first-page":"441","article-title":"A survey of information authentication","author":"Simmons","year":"1992"},{"issue":"2","key":"10.1016\/S0304-3975(98)00241-2_BIB18","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1006\/inco.1994.1099","article-title":"Tolerating a linear number of faults in networks of bounded degree","volume":"115","author":"Upfal","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(98)00241-2_BIB19","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","article-title":"New hash functions and their use in authentication and set equality","volume":"22","author":"Wegman","year":"1981","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002412?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002412?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T17:46:25Z","timestamp":1578505585000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002412"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0304397598002412"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00241-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}