{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T20:07:33Z","timestamp":1778789253340,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424567","type":"print"},{"value":"9783540446477","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44647-8_31","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T14:28:14Z","timestamp":1194964094000},"page":"524-541","source":"Crossref","is-referenced-by-count":239,"title":["Secure and Efficient Asynchronous Broadcast Protocols"],"prefix":"10.1007","author":[{"given":"Christian","family":"Cachin","sequence":"first","affiliation":[]},{"given":"Klaus","family":"Kursawe","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Petzold","sequence":"additional","affiliation":[]},{"given":"Victor","family":"Shoup","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"31_CR1","unstructured":"M. Ben-Or and R. El-Yaniv, \u201cInteractive consistency in constant time.\u201d Manuscript, 1991."},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, R. Canetti, and O. Goldreich, \u201cAsynchronous secure computation,\u201d in Proc. 25th Annual ACM Symposium on Theory of Computing (STOC), 1993.","DOI":"10.1145\/167088.167109"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"P. Berman and J. A. Garay, \u201cRandomized distributed agreement revisited,\u201d in Proc. 23th International Symposium on Fault-Tolerant Computing (FTCS-23), pp. 412\u2013419, 1993.","DOI":"10.1109\/FTCS.1993.627344"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"G. Bracha and S. Toueg, \u201cAsynchronous consensus and broadcast protocols,\u201d Journal of the ACM, vol. 32, pp. 824\u2013840, Oct. 1985.","DOI":"10.1145\/4221.214134"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"C. Cachin, K. Kursawe, F. Petzold, and V. Shoup, \u201cSecure and efficient asynchronous broadcast protocols.\u201d Cryptology ePrint Archive, Report 2001\/006, Mar. 2001. http:\/\/eprint.iacr.org\/ .","DOI":"10.1007\/3-540-44647-8_31"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Cachin, Kursawe, and V. Shoup, \u201cRandom oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography,\u201d in Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC), pp. 123\u2013132, 2000. Full version available from Cryptology ePrint Archive, Report 2000\/034, http:\/\/eprint.iacr.org\/ .","DOI":"10.1145\/343477.343531"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"R. Canetti and T. Rabin, \u201cFast asynchronous Byzantine agreement with optimal resilience,\u201d in Proc. 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 42\u201351, 1993. Updated version available from http:\/\/www.research.ibm.com\/security\/ .","DOI":"10.1145\/167088.167105"},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T. D. Chandra","year":"1996","unstructured":"T. D. Chandra and S. Toueg, \u201cUnreliable failure detectors for reliable distributed systems,\u201d Journal of the ACM, vol. 43, no. 2, pp. 225\u2013267, 1996.","journal-title":"Journal of the ACM"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"M. J. Fischer, N. A. Lynch, and M. S. Paterson, \u201cImpossibility of distributed consensus with one faulty process,\u201d Journal of the ACM, vol. 32, pp. 374\u2013382, Apr. 1985.","DOI":"10.1145\/3149.214121"},{"key":"31_CR10","volume-title":"Distributed Systems","author":"V. Hadzilacos","year":"1993","unstructured":"V. Hadzilacos and S. Toueg, \u201cFault-tolerant broadcasts and related problems,\u201d in Distributed Systems (S. J. Mullender, ed.), New York: ACM Press & Addison-Wesley, 1993. An expanded version appears as Technical Report TR94-1425, Department of Computer Science, Cornell University, Ithaca NY, 1994."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"L. Lamport, \u201cTime, clocks, and the ordering of events in a distributed system,\u201d Communications of the ACM, vol. 21, pp. 558\u2013565, July 1978.","DOI":"10.1145\/359545.359563"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"L. Lamport, R. Shostak, and M. Pease, \u201cThe Byzantine generals problem,\u201d ACM Transactions on Programming Languages and Systems, vol. 4, pp. 382\u2013401, July 1982.","DOI":"10.1145\/357172.357176"},{"key":"31_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology: EUROCRYPT\u2019 99","author":"M. Naor","year":"1999","unstructured":"M. Naor, B. Pinkas, and O. Reingold, \u201cDistributed pseudo-random functions and KDCs,\u201d in Advances in Cryptology: EUROCRYPT\u2019 99 (J. Stern, ed.), vol. 1592 of Lecture Notes in Computer Science, Springer, 1999."},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"K. J. Perry, \u201cRandomized Byzantine agreement,\u201d IEEE Transactions on Software Engineering, vol. 11, pp. 539\u2013546, June 1985.","DOI":"10.1109\/TSE.1985.232246"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"M. O. Rabin, \u201cRandomized Byzantine generals,\u201d in Proc. 24th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 403\u2013409, 1983.","DOI":"10.1109\/SFCS.1983.48"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"M. Reiter, \u201cSecure agreement protocols: Reliable and atomic group multicast in Rampart,\u201d in Proc. 2nd ACM Conference on Computer and Communications Security, 1994.","DOI":"10.1145\/191177.191194"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"M. K. Reiter and K. P. Birman, \u201cHow to securely replicate services,\u201d ACM Transactions on Programming Languages and Systems, vol. 16, pp. 986\u20131009, May 1994.","DOI":"10.1145\/177492.177745"},{"key":"31_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/3-540-45539-6_15","volume-title":"Advances in Cryptology: EUROCRYPT","author":"V. Shoup","year":"2000","unstructured":"V. Shoup, \u201cPractical threshold signatures,\u201d in Advances in Cryptology: EUROCRYPT 2000 (B. Preneel, ed.), vol. 1087 of Lecture Notes in Computer Science, pp. 207\u2013220, Springer, 2000."},{"key":"31_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054113","volume-title":"Advances in Cryptology: EUROCRYPT\u2019 98","author":"V. Shoup","year":"1998","unstructured":"V. Shoup and R. Gennaro, \u201cSecuring threshold cryptosystems against chosen ciphertext attack,\u201d in Advances in Cryptology: EUROCRYPT\u2019 98 (K. Nyberg, ed.), vol. 1403 of Lecture Notes in Computer Science, Springer, 1998."},{"key":"31_CR20","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(84)90027-9","volume":"18","author":"R. Turpin","year":"1984","unstructured":"R. Turpin and B. A. Coan, \u201cExtending binary Byzantine agreement to multivalued Byzantine agreement,\u201d Information Processing Letters, vol. 18, pp. 73\u201376, 1984.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44647-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T06:22:27Z","timestamp":1556950947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44647-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424567","9783540446477"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44647-8_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}