{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:55:58Z","timestamp":1725771358638},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642542411"},{"type":"electronic","value":"9783642542428"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54242-8_18","type":"book-chapter","created":{"date-parts":[[2014,2,2]],"date-time":"2014-02-02T21:42:54Z","timestamp":1391377374000},"page":"419-439","source":"Crossref","is-referenced-by-count":2,"title":["Broadcast Amplification"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hirt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ueli","family":"Maurer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Raykov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (STOC 1996), pp. 479\u2013488. ACM (1996)","DOI":"10.1145\/237814.237996"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-1-4615-3422-8_27","volume-title":"Computer Science Research","author":"P. Berman","year":"1992","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Bit optimal distributed consensus. In: Computer Science Research, pp. 313\u2013322. Plenum Publishing Corporation, New York (1992)"},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00145-005-0308-x","volume":"18","author":"J. Considine","year":"2005","unstructured":"Considine, J., Fitzi, M., Franklin, M., Levin, L.A., Maurer, U., Metcalf, D.: Byzantine agreement given partial broadcast. Journal of Cryptology\u00a018(3), 191\u2013217 (2005)","journal-title":"Journal of Cryptology"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0890-5401(92)90004-Y","volume":"97","author":"B.A. Coan","year":"1992","unstructured":"Coan, B.A., Welch, J.L.: Modular construction of a byzantine agreement protocol with optimal message bit complexity. Information and Computation\u00a097, 61\u201385 (1992)","journal-title":"Information and Computation"},{"issue":"4","key":"18_CR5","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 Journal on Computing\u00a012(4), 656\u2013666 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR6","first-page":"163","volume-title":"Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing, PODC, 2006","author":"M. Fitzi","year":"2006","unstructured":"Fitzi, M., Hirt, M.: Optimally efficient multi-valued Byzantine agreement. In: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing, PODC, 2006, pp. 163\u2013168. ACM, New York (2006)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1145\/62212.62225","volume-title":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988","author":"P. Feldman","year":"1988","unstructured":"Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 148\u2013161. ACM, New York (1988)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Maurer, U.: From partial consistency to global broadcast. In: Yao, F. (ed.) Proc.\u00a032nd ACM Symposium on Theory of Computing \u2014 STOC 2000, pp. 494\u2013503. ACM (May 2000)","DOI":"10.1145\/335305.335363"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/11761679_30","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"D. Hofheinz","year":"2006","unstructured":"Hofheinz, D., M\u00fcller-Quade, J., Unruh, D.: On the (Im-)Possibility of extending coin toss. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 504\u2013521. Springer, Heidelberg (2006)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-642-39206-1_47","volume-title":"Automata, Languages, and Programming","author":"M. Hirt","year":"2013","unstructured":"Hirt, M., Raykov, P.: On the complexity of broadcast setup. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol.\u00a07965, pp. 552\u2013563. Springer, Heidelberg (2013)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y. Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 145\u2013161. Springer, Heidelberg (2003)"},{"issue":"3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/2402.322398","volume":"30","author":"L. Lamport","year":"1983","unstructured":"Lamport, L.: The weak byzantine generals problem. J. ACM\u00a030(3), 668\u2013676 (1983)","journal-title":"J. ACM"},{"key":"18_CR13","first-page":"11","volume-title":"Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011","author":"G. Liang","year":"2011","unstructured":"Liang, G., Vaidya, N.: Error-free multi-valued consensus with Byzantine failures. In: Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, pp. 11\u201320. ACM, New York (2011)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-30186-8_27","volume-title":"Distributed Computing","author":"U. Maurer","year":"2004","unstructured":"Maurer, U.: Towards a theory of consistency primitives. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 379\u2013389. Springer, Heidelberg (2004)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-25873-2_4","volume-title":"Principles of Distributed Systems","author":"A. Patra","year":"2011","unstructured":"Patra, A.: Error-free multi-valued broadcast and Byzantine agreement with optimal communication complexity. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol.\u00a07109, pp. 34\u201349. Springer, Heidelberg (2011)"},{"issue":"2","key":"18_CR16","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M.C. Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM\u00a027(2), 228\u2013234 (1980)","journal-title":"Journal of the ACM"},{"key":"18_CR17","unstructured":"Pfitzmann, B., Waidner, M.: Information-theoretic pseudosignatures and Byzantine agreement for t \u2265 n\/3. Technical report, IBM Research (1996)"},{"issue":"2","key":"18_CR18","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, B.A.: Extending binary Byzantine agreement to multivalued Byzantine agreement. Information Processing Letters\u00a018(2), 73\u201376 (1984)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54242-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T01:44:36Z","timestamp":1558835076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54242-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642542411","9783642542428"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54242-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}