{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:01:32Z","timestamp":1725544892108},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642113215"},{"type":"electronic","value":"9783642113222"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11322-2_10","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T10:17:59Z","timestamp":1265710679000},"page":"54-66","source":"Crossref","is-referenced-by-count":0,"title":["On Composability of Reliable Unicast and Broadcast"],"prefix":"10.1007","author":[{"given":"Anuj","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandeep","family":"Hans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Srinathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly Secure Message Transmission. JACM\u00a040(1), 17\u201347 (1993)","journal-title":"JACM"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s001459910002","volume":"13","author":"M. Franklin","year":"2000","unstructured":"Franklin, M., Wright, R.: Secure Communication in Minimal Connectivity Models. Journal of Cryptology\u00a013(1), 9\u201330 (2000)","journal-title":"Journal of Cryptology"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Sayeed, H., Abu-Amara, H.: Perfectly Secure Message Transmission in Asynchronous Networks. In: IPDPS (1995)","DOI":"10.1109\/SPDP.1995.530671"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73458-1_33","volume-title":"Information Security and Privacy","author":"K. Srinathan","year":"2007","unstructured":"Srinathan, K., Raghavendra, P., Rangan, C.P.: On proactive perfectly secure message transmission. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol.\u00a04586, Springer, Heidelberg (2007)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Franklin, M., Yung, M.: Secure Hypergraphs: Privacy from Partial Broadcast. In: STOC, pp. 36\u201344 (1995)","DOI":"10.1145\/225058.225077"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00145-001-0002-y","volume":"14","author":"Y. Wang","year":"2001","unstructured":"Wang, Y., Desmedt, Y.: Secure Communication in Multicast Channels: The Answer to Franklin and Wright\u2019s Question. Journal of Cryptology\u00a014(2), 121\u2013135 (2001)","journal-title":"Journal of Cryptology"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-46035-7_33","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"Y.G. Desmedt","year":"2002","unstructured":"Desmedt, Y.G., Wang, Y.: Perfectly secure message transmission revisited. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 502\u2013517. Springer, Heidelberg (2002)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Srinathan, K., Rangan, C.P.: Possibility and complexity of probabilistic reliable communications in directed networks. In: PODC (2006)","DOI":"10.1145\/1146381.1146421"},{"issue":"2","key":"10_CR9","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"},{"issue":"3","key":"10_CR10","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."},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed consensus. J. ACM\u00a034(1), 77\u201397 (1987)","journal-title":"J. ACM"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Dolev, D.: The byzantine generals strike again. Technical report, Stanford, CA, USA (1981)","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Maurer, U.: From partial consistency to global broadcast. In: STOC 2000, pp. 494\u2013503 (2000)","DOI":"10.1145\/335305.335363"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Maurer, U.M.: Efficient byzantine agreement secure against general adversaries. In: International Symposium on Distributed Computing, pp. 134\u2013148 (1998)","DOI":"10.1007\/BFb0056479"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Altmann, B., Fitzi, M., Maurer, U.M.: Byzantine agreement secure against general adversaries in the dual failure model. In: International Symposium on Distributed Computing, pp. 123\u2013137 (1999)","DOI":"10.1007\/3-540-48169-9_9"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BFb0020438","volume-title":"Distributed Algorithms","author":"J.A. Garay","year":"1994","unstructured":"Garay, J.A.: Reaching (and Maintaining) Agreement in the Presence of Mobile Faults. In: Tel, G., Vit\u00e1nyi, P.M.B. (eds.) WDAG 1994. LNCS, vol.\u00a0857, pp. 253\u2013264. Springer, Heidelberg (1994)"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized byzantine generals. In: FOCS, pp. 403\u2013409 (1983)","DOI":"10.1109\/SFCS.1983.48"},{"issue":"4","key":"10_CR19","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":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/BFb0022150","volume-title":"Distributed Algorithms","author":"M. Borcherding","year":"1995","unstructured":"Borcherding, M.: On the number of authenticated rounds in byzantine agreement. In: Helary, J.-M., Raynal, M. (eds.) WDAG 1995. LNCS, vol.\u00a0972, pp. 230\u2013241. Springer, Heidelberg (1995)"},{"key":"10_CR21","unstructured":"Borcherding, M.: Partially authenticated algorithms for byzantine agreement. In: ISCA 1996, pp. 8\u201311 (1996)"},{"issue":"2","key":"10_CR22","doi-asserted-by":"publisher","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. Distributed Computing\u00a02(2), 80\u201394 (1987)","journal-title":"Distributed Computing"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-61769-8_4","volume-title":"Distributed Algorithms","author":"M. Borcherding","year":"1996","unstructured":"Borcherding, M.: Levels of authentication in distributed agreement. In: Babao\u011flu, \u00d6., Marzullo, K. (eds.) WDAG 1996. LNCS, vol.\u00a01151, pp. 40\u201355. Springer, Heidelberg (1996)"},{"issue":"2","key":"10_CR24","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jcss.2008.08.001","volume":"75","author":"J. Katz","year":"2009","unstructured":"Katz, J., Koo, C.Y.: On expected constant-round protocols for byzantine agreement. J. Comput. Syst. Sci.\u00a075(2), 91\u2013112 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR25","unstructured":"Gong, L., Lincoln, P., Rushby, J.: Byzantine agreement with authentication: Observations and applications in tolerating hybrid and link faults (1995)"},{"key":"10_CR26","first-page":"136","volume-title":"FOCS","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: FOCS, pp. 136\u2013145. IEEE Computer Society Press, Los Alamitos (2001), http:\/\/eprint.iacr.org\/2000\/067"},{"key":"10_CR27","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/509907.509982","volume-title":"STOC","author":"Y. Lindell","year":"2002","unstructured":"Lindell, Y., Lysysanskaya, A., Rabin, T.: On the Composition of Authenticated Byzantine Agreement. In: STOC, pp. 514\u2013523. ACM Press, New York (2002)"},{"key":"10_CR28","unstructured":"Gupta, A., Hans, S., Srinathan, K., Rangan, C.P.: On composability of reliable unicast and broadcast. Technical report, International Institute of Information Technology, Hyderabad Complete version http:\/\/researchweb.iiit.ac.in\/~anujgupta\/Work.htm"},{"key":"10_CR29","first-page":"59","volume-title":"PODC","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Merritt, M.: Easy impossibility proofs for distributed consensus problems. In: PODC, pp. 59\u201370. ACM, New York (1985)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11322-2_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T04:28:33Z","timestamp":1685420913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11322-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642113215","9783642113222"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11322-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}