{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:01:35Z","timestamp":1783008095398,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540374329","type":"print"},{"value":"9783540374336","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11818175_27","type":"book-chapter","created":{"date-parts":[[2006,9,23]],"date-time":"2006-09-23T02:21:52Z","timestamp":1158978112000},"page":"445-462","source":"Crossref","is-referenced-by-count":98,"title":["On Expected Constant-Round Protocols for Byzantine Agreement"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Katz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chiu-Yuen","family":"Koo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-47555-9_26","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"D. Beaver","year":"1993","unstructured":"Beaver, D., Haber, S.: Cryptographic protocols provably secure against dynamic adversaries. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 307\u2013323. Springer, Heidelberg (1993)"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: 22nd Annual ACM Symposium on Theory of Computing (STOC) (1990)","DOI":"10.1145\/100216.100287"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols. In: 2nd Annual ACM Symposium on Principles of Distributed Computing (PODC) (1983)","DOI":"10.1145\/800221.806707"},{"issue":"4","key":"27_CR4","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00446-002-0083-3","volume":"16","author":"M. Ben-Or","year":"2003","unstructured":"Ben-Or, M., El-Yaniv, R.: Resilient-optimal interactive consistency in constant time. Distributed Computing\u00a016(4), 249\u2013262 (2003)","journal-title":"Distributed Computing"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: National Computer Conference, vol.\u00a048, pp. 313\u2013317. AFIPS Press (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"4","key":"27_CR6","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1145\/31846.42229","volume":"34","author":"G. Bracha","year":"1987","unstructured":"Bracha, G.: An O(logn) expected rounds randomized Byzantine generals protocol. J. ACM\u00a034(4), 910\u2013920 (1987)","journal-title":"J. ACM"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography (extended abstract). In: 19th Annual ACM Symposium on Principles of Distributed Computing (PODC) (2000)","DOI":"10.1145\/343477.343531"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. In: 28th Annual ACM Symposium on Theory of Computing (STOC) (1996)","DOI":"10.1145\/237814.238015"},{"issue":"6","key":"27_CR10","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1109\/TSE.1985.232245","volume":"11","author":"B. Chor","year":"1985","unstructured":"Chor, B., Coan, B.: A simple and efficient randomized Byzantine agreement algorithm. IEEE Trans. Software Engineering\u00a011(6), 531\u2013539 (1985)","journal-title":"IEEE Trans. Software Engineering"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: 26th Annual IEEE Symposium on the Foundations of Computer Science (FOCS) (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/11535218_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"I.B. Damg\u00e5rd","year":"2005","unstructured":"Damg\u00e5rd, I.B., Ishai, Y.: Constant-round multiparty computation using a black-box pseudorandom generator. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 378\u2013394. Springer, Heidelberg (2005)"},{"issue":"4","key":"27_CR13","doi-asserted-by":"publisher","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. Computing\u00a012(4), 656\u2013666 (1983)","journal-title":"SIAM J. Computing"},{"issue":"3","key":"27_CR14","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1137\/0219032","volume":"19","author":"C. Dwork","year":"1990","unstructured":"Dwork, C., Shmoys, D., Stockmeyer, L.: Flipping persuasively in constant time. SIAM J. Computing\u00a019(3), 472\u2013499 (1990)","journal-title":"SIAM J. Computing"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Feldman, P.: Optimal Algorithms for Byzantine Agreement. PhD thesis, Massachusetts Institute of Technology (1988)","DOI":"10.1145\/62212.62225"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Feldman, P., Micali, S.: Byzantine agreement in constant expected time and trusting no one. In: 26th Annual IEEE Symposium on the Foundations of Computer Science (FOCS) (1985)","DOI":"10.1109\/SFCS.1985.14"},{"issue":"4","key":"27_CR17","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P. Feldman","year":"1997","unstructured":"Feldman, P., Micali, S.: An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM J. Computing\u00a026(4), 873\u2013933 (1997)","journal-title":"SIAM J. Computing"},{"issue":"4","key":"27_CR18","doi-asserted-by":"publisher","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. Information Processing Letters\u00a014(4), 183\u2013186 (1982)","journal-title":"Information Processing Letters"},{"key":"27_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11681878_17","volume-title":"Theory of Cryptography","author":"M. Fitzi","year":"2006","unstructured":"Fitzi, M., Garay, J.A., Gollakota, S., Pandu Rangan, C., Srinathan, K.: Round-optimal and efficient verifiable secret sharing. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 329\u2013342. Springer, Heidelberg (2006)"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Garay, J.A.: Efficient player-optimal protocols for strong and differential consensus. In: 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC) (2003)","DOI":"10.1145\/872035.872066"},{"issue":"1","key":"27_CR21","doi-asserted-by":"publisher","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\u2009>\u20093t processors in t\u2009+\u20091 rounds. SIAM J. Comput.\u00a027(1), 247\u2013290 (1998)","journal-title":"SIAM J. Comput."},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The round complexity of verifiable secret sharing and secure multicast. In: 33rd Annual ACM Symposium on Theory of Computing (STOC) (2001)","DOI":"10.1145\/380752.380853"},{"issue":"3","key":"27_CR23","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00145-005-0319-z","volume":"18","author":"S. Goldwasser","year":"2005","unstructured":"Goldwasser, S., Lindell, Y.: Secure computation without agreement. J. Cryptology\u00a018(3), 247\u2013287 (2005)","journal-title":"J. Cryptology"},{"key":"27_CR24","unstructured":"Katz, J., Koo, C.-Y.: On expected constant-round protocols for Byzantine agreement (2006), Available at: http:\/\/eprint.iacr.org\/065"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. In: STOC (to appear, 2006)","DOI":"10.1145\/1132516.1132532"},{"issue":"3","key":"27_CR26","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst.\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Lysyanskaya, A., Rabin, T.: On the composition of authenticated Byzantine agreement. In: 34th Annual ACM Symposium on Theory of Computing (STOC) (2002)","DOI":"10.1145\/509907.509982"},{"key":"27_CR28","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Lysyanskaya, A., Rabin, T.: Sequential composition of protocols without simultaneous termination. In: 21st Annual ACM Symposium on Principles of Distributed Computing (PODC) (2002)","DOI":"10.1145\/571825.571859"},{"key":"27_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/3-540-45708-9_26","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J.B. Nielsen","year":"2002","unstructured":"Nielsen, J.B.: A threshold pseudorandom function construction and its applications. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, p. 401. Springer, Heidelberg (2002)"},{"issue":"2","key":"27_CR30","doi-asserted-by":"publisher","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\u00a027(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"27_CR31","unstructured":"Pfitzmann, B., Waidner, M.: Information-theoretic pseudosignatures and Byzantine agreement for t \u2265 n\/3. Technical Report RZ 2882 (#90830), IBM Research (1996)"},{"key":"27_CR32","doi-asserted-by":"crossref","unstructured":"Rabin, M.: Randomized Byzantine generals. In: 24th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (1983)","DOI":"10.1109\/SFCS.1983.48"},{"issue":"11","key":"27_CR33","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Comm. ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Comm. ACM"},{"key":"27_CR34","doi-asserted-by":"crossref","unstructured":"Toueg, S.: Randomized Byzantine agreements. In: 3rd Annual ACM Symposium on Principles of Distributed Computing (PODC) (1984)","DOI":"10.1145\/800222.806744"},{"issue":"2","key":"27_CR35","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(84)90027-9","volume":"18","author":"R. Turpin","year":"1984","unstructured":"Turpin, R., Coan, A.B.: Extending binary Byzantine agreement to multivalued Byzantine agreement. Information Processing Letters\u00a018(2), 73\u201376 (1984)","journal-title":"Information Processing Letters"},{"key":"27_CR36","unstructured":"M.\u00a0Waidner. Byzantinische Verteilung ohne Kryptographische Annahmen trotz Beliebig Vieler Fehler (in German). PhD thesis, University of Karlsruhe (1991)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11818175_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:16:10Z","timestamp":1605626170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11818175_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540374329","9783540374336"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/11818175_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}