{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T04:02:57Z","timestamp":1743825777595,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642319112"},{"type":"electronic","value":"9783642319129"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31912-9_30","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T07:57:56Z","timestamp":1342252676000},"page":"450-466","source":"Crossref","is-referenced-by-count":0,"title":["On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks"],"prefix":"10.1007","author":[{"given":"Ashish","family":"Choudhury","sequence":"first","affiliation":[]},{"given":"Arpita","family":"Patra","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/11818175_24","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"S. Agarwal","year":"2006","unstructured":"Agarwal, S., Cramer, R., de Haan, R.: Asymptotically Optimal Two-Round Perfectly Secure Message Transmission. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 394\u2013408. Springer, Heidelberg (2006)"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-92295-7_19","volume-title":"Distributed Computing and Networking","author":"A. Choudhary","year":"2008","unstructured":"Choudhary, A., Patra, A., Ashwinkumar, B.V., Srinathan, K., Pandu Rangan, C.: On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds.) ICDCN 2009. LNCS, vol.\u00a05408, pp. 148\u2013162. Springer, Heidelberg (2008); Full version to appear in JPDC 2011"},{"key":"30_CR3","unstructured":"Choudhury, A.: Protocols for reliable and secure message transmission. Cryptology ePrint Archive, Report 2010\/281 (2010)"},{"issue":"1","key":"30_CR4","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"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-70936-7_17","volume-title":"Theory of Cryptography","author":"M. Fitzi","year":"2007","unstructured":"Fitzi, M., Franklin, M.K., Garay, J.A., Vardhan, S.H.: Towards Optimal and Efficient Perfectly Secure Message Transmission. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 311\u2013322. Springer, Heidelberg (2007)"},{"issue":"1","key":"30_CR6","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":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-540-78967-3_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"K. Kurosawa","year":"2008","unstructured":"Kurosawa, K., Suzuki, K.: Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 324\u2013340. Springer, Heidelberg (2008)"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/11941378_16","volume-title":"Progress in Cryptology - INDOCRYPT 2006","author":"A. Patra","year":"2006","unstructured":"Patra, A., Choudhary, A., Srinathan, K., Pandu Rangan, C.: Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol.\u00a04329, pp. 221\u2013235. Springer, Heidelberg (2006)"},{"issue":"2","key":"30_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1504\/IJACT.2010.038309","volume":"2","author":"A. Patra","year":"2010","unstructured":"Patra, A., Choudhary, A., Srinathan, K., Pandu Rangan, C.: Unconditionally reliable and secure message transmission in undirected synchronous networks: Possibility, feasibility and optimality. IJACT\u00a02(2), 159\u2013197 (2010)","journal-title":"IJACT"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Sayeed, H., Abu-Amara, H.: Perfectly secure message transmission in asynchronous networks. In: IEEE Symposium on Parallel and Distributed Processing, pp. 100\u2013105 (1995)","DOI":"10.1109\/SPDP.1995.530671"},{"issue":"1","key":"30_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/inco.1996.0033","volume":"126","author":"H. Sayeed","year":"1996","unstructured":"Sayeed, H., Abu-Amara, H.: Efficient perfectly secure message transmission in synchronous networks. Information and Computation\u00a0126(1), 53\u201361 (1996)","journal-title":"Information and Computation"},{"issue":"11","key":"30_CR12","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. Communications of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/978-3-540-28628-8_33","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"K. Srinathan","year":"2004","unstructured":"Srinathan, K., Narayanan, A., Pandu Rangan, C.: Optimal Perfectly Secure Message Transmission. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 545\u2013561. Springer, Heidelberg (2004)"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-77026-8_9","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"K. Srinathan","year":"2007","unstructured":"Srinathan, K., Patra, A., Choudhary, A., Pandu Rangan, C.: Probabilistic Perfectly Reliable and Secure Message Transmission \u2013 Possibility, Feasibility and Optimality. In: Srinathan, K., Pandu Rangan, C., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol.\u00a04859, pp. 101\u2013122. Springer, Heidelberg (2007)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Srinathan, K., Prasad, N.R., Pandu Rangan, C.: On the optimal communication complexity of multiphase protocols for perfect communication. In: IEEE S&P, pp. 311\u2013320 (2007)","DOI":"10.1109\/SP.2007.31"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31912-9_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T04:05:49Z","timestamp":1743739549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31912-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642319112","9783642319129"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31912-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}