{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:22:27Z","timestamp":1771705347898,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T00:00:00Z","timestamp":1183507200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s00224-007-9006-9","type":"journal-article","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T12:30:11Z","timestamp":1183465811000},"page":"222-238","source":"Crossref","is-referenced-by-count":15,"title":["Efficient Algorithms for Anonymous Byzantine Agreement"],"prefix":"10.1007","volume":"42","author":[{"given":"Michael","family":"Okun","sequence":"first","affiliation":[]},{"given":"Amnon","family":"Barak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,7,4]]},"reference":[{"key":"9006_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: Proc. 12th ACM Symposium on Theory of Computing (STOC), pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"key":"9006_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H. Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. Wiley-Interscience, New York (2004)","edition":"2"},{"issue":"2","key":"9006_CR3","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1006\/inco.2001.3119","volume":"173","author":"H. Attiya","year":"2002","unstructured":"Attiya, H., Gorbach, A., Moran, S.: Computing in totally anonymous asynchronous shared memory systems. Inf. Comput. 173(2), 162\u2013183 (2002)","journal-title":"Inf. Comput."},{"key":"9006_CR4","doi-asserted-by":"crossref","unstructured":"Barak, B., Canetti, R., Lindell, Y., Pass, R., Rabin, T.: Secure computation without authentication. In: Proc. 25th Annual International Cryptology Conference (CRYPTO), pp. 361\u2013377 (2005)","DOI":"10.1007\/11535218_22"},{"key":"9006_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. 20th ACM Symposium on Theory of Computing (STOC), pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"9006_CR6","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proc. 18th ACM Symposium on Principles of Distributed Computing (PODC), pp. 181\u2013188 (1999)","DOI":"10.1145\/301308.301355"},{"key":"9006_CR7","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: An Effective characterization of computability in anonymous networks. In: Distributed Computing, 15th International Conference (DISC), pp. 33\u201347 (2001)","DOI":"10.1007\/3-540-45414-4_3"},{"key":"9006_CR8","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: Proc. CRYPTO, pp. 199\u2013203 (1982)","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"9006_CR9","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA. In: Proc. EUROCRYPT, pp. 177\u2013182 (1988)","DOI":"10.1007\/3-540-45961-8_15"},{"key":"9006_CR10","doi-asserted-by":"crossref","unstructured":"Chaum, D., Crepeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: Proc. 20th ACM Symposium on Theory of Computing (STOC), pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"9006_CR11","doi-asserted-by":"crossref","unstructured":"Cohen, J.D., Fischer, M.J.: A robust and verifiable cryptographically secure election scheme. In: Proc. 26th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 372\u2013382 (1985)","DOI":"10.1109\/SFCS.1985.2"},{"issue":"4","key":"9006_CR12","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Strong, H.R.: Authenticated algorithms for Byzantine agreement. SIAM J. Comput. 12(4), 656\u2013666 (1983)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9006_CR13","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0019-9958(82)90776-8","volume":"52","author":"D. Dolev","year":"1982","unstructured":"Dolev, D., Fischer, M.J., Fowler, R., Lynch, N.A., Strong, H.R.: An efficient algorithm for Byzantine agreement without authentication. Inf. Control 52(3), 257\u2013274 (1982)","journal-title":"Inf. Control"},{"issue":"4","key":"9006_CR14","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D. Dolev","year":"1990","unstructured":"Dolev, D., Reischuk, R., Strong, H.R.: Early stopping in Byzantine agreement. J. ACM 37(4), 720\u2013741 (1990)","journal-title":"J. ACM"},{"issue":"4","key":"9006_CR15","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M.J. Fischer","year":"1982","unstructured":"Fischer, M.J., Lynch, N.A.: A lower bound for the time to assure interactive consistency. Inf. Process. Lett. 14(4), 183\u2013186 (1982)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9006_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.: Easy impossibility proofs for distributed consensus problems. Distrib. Comput. 1(1), 26\u201339 (1986)","journal-title":"Distrib. Comput."},{"issue":"1","key":"9006_CR17","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1137\/S0097539794265232","volume":"27","author":"J.A. Garay","year":"1998","unstructured":"Garay, J.A., Moses, Y.: Fully polynomial Byzantine agreement for n>3t processors in t+1 rounds. SIAM J. Comput. 27(1), 247\u2013290 (1998)","journal-title":"SIAM J. Comput."},{"key":"9006_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proc. 19th ACM Symposium on Theory of Computing (STOC), pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"issue":"3","key":"9006_CR19","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Schostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9006_CR20","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann (1996)"},{"key":"9006_CR21","doi-asserted-by":"crossref","unstructured":"Okun, M.: Agreement among unacquainted Byzantine generals. In: Distributed Computing, 19th International Conference (DISC), pp. 499\u2013500 (2005)","DOI":"10.1007\/11561927_40"},{"key":"9006_CR22","unstructured":"Okun, M., Barak, A.: On anonymous Byzantine agreement. Leibniz Center TR 2004-2, School of Computer Science, The Hebrew University (2004)"},{"issue":"2","key":"9006_CR23","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"issue":"2","key":"9006_CR24","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"T.K. Srikanth","year":"1987","unstructured":"Srikanth, T.K., Toueg, S.: Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distrib. Comput. 2(2), 80\u201394 (1987)","journal-title":"Distrib. Comput."},{"issue":"3","key":"9006_CR25","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1145\/28869.28876","volume":"34","author":"T.K. Srikanth","year":"1987","unstructured":"Srikanth, T.K., Toueg, S.: Optimal clock synchronization. J. ACM 34(3), 626\u2013645 (1987)","journal-title":"J. ACM"},{"issue":"3","key":"9006_CR26","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1137\/0216031","volume":"16","author":"S. Toueg","year":"1987","unstructured":"Toueg, S., Perry, K.J., Srikanth, T.K.: Fast distributed agreement. SIAM J. Comput. 16(3), 445\u2013457 (1987)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9006_CR27","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0020-0190(84)90027-9","volume":"18","author":"R. Turpin","year":"1984","unstructured":"Turpin, R., Coan, B.A.: Extending binary Byzantine agreement to multivalued Byzantine agreement. Inf. Process. Lett. 18(2), 73\u201376 (1984)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9006_CR28","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M. Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks: Part I\u2014characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7(1), 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9006-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9006-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9006-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:51:34Z","timestamp":1558684294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9006-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,4]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["9006"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9006-9","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,4]]}}}