{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:33:26Z","timestamp":1742992406862,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_56","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"701-712","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Broadcast from Minicast Secure Against General Adversaries"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Raykov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"56_CR1","doi-asserted-by":"crossref","unstructured":"Backes, M., Bendun, F., Choudhury, A., Kate, A.: Asynchronous MPC with a strict honest majority using non-equivocation. In: PODC (2014)","DOI":"10.1145\/2611462.2611490"},{"key":"56_CR2","doi-asserted-by":"crossref","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Bit optimal distributed consensus. In: Computer Science Research (1992)","DOI":"10.1007\/978-1-4615-3422-8_27"},{"key":"56_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/978-3-642-40084-1_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"G Cohen","year":"2013","unstructured":"Cohen, G., Damg\u00e5rd, I.B., Ishai, Y., K\u00f6lker, J., Miltersen, P.B., Raz, R., Rothblum, R.D.: Efficient multiparty protocols via log-depth threshold formulae. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 185\u2013202. Springer, Heidelberg (2013)"},{"key":"56_CR4","doi-asserted-by":"crossref","unstructured":"Considine, J., Fitzi, M., Franklin, M., Levin, L.A., Maurer, U., Metcalf, D.: Byzantine agreement given partial broadcast. Journal of Cryptology (2005)","DOI":"10.1007\/s00145-005-0308-x"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"Coan, B.A., Welch, J.L.: Modular construction of a byzantine agreement protocol with optimal message bit complexity. Inf. and Comp. (1992)","DOI":"10.1016\/0890-5401(92)90004-Y"},{"key":"56_CR6","doi-asserted-by":"crossref","unstructured":"Dolev, D., Strong, H.R.: Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing (1983)","DOI":"10.1137\/0212045"},{"key":"56_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-39200-9_4","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"M Fitzi","year":"2003","unstructured":"Fitzi, M., Hirt, M., Holenstein, T., Wullschleger, J.: Two-threshold broadcast and detectable multi-party computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 51\u201367. Springer, Heidelberg (2003)"},{"key":"56_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BFb0056479","volume-title":"Distributed Computing","author":"M Fitzi","year":"1998","unstructured":"Fitzi, M., Maurer, U.M.: Efficient byzantine agreement secure against general adversaries. In: Kutten, S. (ed.) DISC 1998. LNCS, vol. 1499, pp. 134\u2013148. Springer, Heidelberg (1998)"},{"key":"56_CR9","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Maurer, U.: From partial consistency to global broadcast. In: STOC (2000)","DOI":"10.1145\/335305.335363"},{"key":"56_CR10","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC (1987)","DOI":"10.1145\/28395.28420"},{"key":"56_CR11","doi-asserted-by":"crossref","unstructured":"Hirt, M., Maurer, U.M.: Complete characterization of adversaries tolerable in secure multi-party computation. In: PODC (1997)","DOI":"10.1145\/259380.259412"},{"key":"56_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/978-3-642-54242-8_18","volume-title":"Theory of Cryptography","author":"M Hirt","year":"2014","unstructured":"Hirt, M., Maurer, U., Raykov, P.: Broadcast amplification. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 419\u2013439. Springer, Heidelberg (2014)"},{"key":"56_CR13","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"M Hirt","year":"2008","unstructured":"Hirt, M., Maurer, U.M., Zikas, V.: MPC vs. SFE : unconditional and computational security. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 1\u201318. Springer, Heidelberg (2008)"},{"key":"56_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/978-3-662-45608-8_24","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"M Hirt","year":"2014","unstructured":"Hirt, M., Raykov, P.: Multi-valued byzantine broadcast: the \n$$t < n$$\n case. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014, Part II. LNCS, vol. 8874, pp. 448\u2013465. Springer, Heidelberg (2014)"},{"key":"56_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/978-3-642-42045-0_10","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"M Hirt","year":"2013","unstructured":"Hirt, M., Tschudi, D.: Efficient general-adversary multi-party computation. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 181\u2013200. Springer, Heidelberg (2013)"},{"key":"56_CR16","doi-asserted-by":"crossref","unstructured":"Jaffe, A., Moscibroda, T., Sen, S.: On the price of equivocation in byzantine agreement. In: PODC (2012)","DOI":"10.1145\/2332432.2332491"},{"key":"56_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-319-10879-7_10","volume-title":"Security and Cryptography for Networks","author":"J Lampkins","year":"2014","unstructured":"Lampkins, J., Ostrovsky, R.: Communication-efficient MPC for general adversary structures. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 155\u2013174. Springer, Heidelberg (2014)"},{"key":"56_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/3-540-36413-7_2","volume-title":"Security in Communication Networks","author":"UM Maurer","year":"2003","unstructured":"Maurer, U.M.: Secure multi-party computation made simple. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol. 2576, pp. 14\u201328. Springer, Heidelberg (2003)"},{"key":"56_CR19","doi-asserted-by":"crossref","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM (1980)","DOI":"10.1145\/322186.322188"},{"key":"56_CR20","unstructured":"Pfitzmann, B., Waidner, M.: Information-theoretic pseudosignatures and Byzantine agreement for \n$$t \\ge n\/3$$\n. Technical report, IBM Research (1996)"},{"key":"56_CR21","doi-asserted-by":"crossref","unstructured":"Raykov, P.: Broadcast from minicast secure against general adversaries (2015). Cryptology ePrint Archive, Report 2015\/352 http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-662-47666-6_56"},{"key":"56_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/978-3-540-30186-8_32","volume-title":"Distributed Computing","author":"DVS Ravikant","year":"2004","unstructured":"Ravikant, D.V.S., Muthuramakrishnan, V., Srikanth, V., Srinathan, K., Pandu Rangan, C.: On byzantine agreement over (2,3)-uniform hypergraphs. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 450\u2013464. Springer, Heidelberg (2004)"},{"key":"56_CR23","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: FOCS (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T17:26:05Z","timestamp":1675272365000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}