{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T16:16:17Z","timestamp":1725639377655},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255779"},{"type":"electronic","value":"9783642255786"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25578-6_26","type":"book-chapter","created":{"date-parts":[[2011,12,5]],"date-time":"2011-12-05T21:36:57Z","timestamp":1323121017000},"page":"359-378","source":"Crossref","is-referenced-by-count":1,"title":["Secure Message Transmission in Asynchronous Directed Graphs"],"prefix":"10.1007","author":[{"given":"Shashank","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhinav","family":"Mehta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Srinathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_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":"26_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., Rangan, C.P.: 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)"},{"key":"26_CR3","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)"},{"doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. In: Annual IEEE Symposium on Foundations of Computer Science, vol.\u00a01, pp. 36\u201345 (1990)","key":"26_CR4","DOI":"10.1109\/FSCS.1990.89522"},{"issue":"2","key":"26_CR5","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"},{"key":"26_CR6","first-page":"36","volume-title":"Proceedings of 27th Symposium on Theory of Computing (STOC)","author":"M. Franklin","year":"1995","unstructured":"Franklin, M., Yung, M.: Secure Hypergraphs: Privacy from Partial Broadcast. In: Proceedings of 27th Symposium on Theory of Computing (STOC), pp. 36\u201344. ACM Press, New York (1995)"},{"issue":"1","key":"26_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s001459910002","volume":"13","author":"M.K. Franklin","year":"2000","unstructured":"Franklin, M.K., Wright, R.N.: Secure communication in minimal connectivity models. J. Cryptology\u00a013(1), 9\u201330 (2000)","journal-title":"J. Cryptology"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.: Player Simulation and General Adversary Structures in Perfect Multi-party Computation. Journal of Cryptology\u00a013(1), 31\u201360 (2000)","journal-title":"Journal of Cryptology"},{"doi-asserted-by":"crossref","unstructured":"Kumar, M., Goundan, P.R., Srinathan, K., Rangan, C.P.: On perfectly secure communication over arbitrary networks. In: Proceedings of the 21st Symposium on Principles of Distributed Computing (PODC), Monterey, California, USA, pp. 193\u2013202. ACM Press (July 2002)","key":"26_CR9","DOI":"10.1145\/571825.571858"},{"issue":"11","key":"26_CR10","doi-asserted-by":"publisher","first-page":"5223","DOI":"10.1109\/TIT.2009.2030434","volume":"55","author":"K. Kurosawa","year":"2009","unstructured":"Kurosawa, K., Suzuki, K.: Truly efficient 2-round perfectly secure message transmission scheme. IEEE Trans. Inf. Theor.\u00a055(11), 5223\u20135232 (2009)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"3","key":"26_CR11","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 Transactions on Programming Languages and Systems\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"26_CR12","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-15763-9_20","volume-title":"Distributed Computing","author":"A. Mehta","year":"2010","unstructured":"Mehta, A., Agrawal, S., Srinathan, K.: Brief Announcement: Synchronous las Vegas URMT iff Asynchronous Monte Carlo URMT. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 201\u2013203. Springer, Heidelberg (2010)"},{"unstructured":"Mehta, A., Agrawal, S., Srinathan, K.: Interplay between (im)perfectness, synchrony and connectivity: The case of probabilistic reliable communication. Cryptology ePrint Archive, Report 2010\/392 (2010), \n                    \n                      http:\/\/eprint.iacr.org\/","key":"26_CR14"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-20728-0_4","volume-title":"Information Theoretic Security","author":"M. Nayak","year":"2011","unstructured":"Nayak, M., Agrawal, S., Srinathan, K.: Minimal Connectivity for Unconditionally Secure Message Transmission in Synchronous Directed Networks. In: Fehr, S. (ed.) ICITS 2011. LNCS, vol.\u00a06673, pp. 32\u201351. Springer, Heidelberg (2011)"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-540-85855-3_21","volume-title":"Security and Cryptography for Networks","author":"A. Patra","year":"2008","unstructured":"Patra, A., Choudhary, A., Rangan, C.P.: Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol.\u00a05229, pp. 309\u2013326. Springer, Heidelberg (2008)"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-11322-2_9","volume-title":"Distributed Computing and Networking","author":"A. Patra","year":"2010","unstructured":"Patra, A., Choudhary, A., Rangan, C.P.: On Communication Complexity of Secure Message Transmission in Directed Networks. In: Kant, K., Pemmaraju, S.V., Sivalingam, K.M., Wu, J. (eds.) ICDCN 2010. LNCS, vol.\u00a05935, pp. 42\u201353. Springer, Heidelberg (2010)"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/1281100.1281153","volume-title":"Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007","author":"A. Patra","year":"2007","unstructured":"Patra, A., Choudhary, A., Rangan, C.P.: Constant phase efficient protocols for secure message transmission in directed networks. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, pp. 322\u2013323. ACM, New York (2007)"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-540-75142-7_43","volume-title":"Distributed Computing","author":"A. Patra","year":"2007","unstructured":"Patra, A., Choudhary, A., Srinathan, K., Rangan, C.P.: Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 496\u2013498. Springer, Heidelberg (2007)"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/73007.73014","volume-title":"STOC 1989: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing","author":"T. Rabin","year":"1989","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: STOC 1989: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pp. 73\u201385. ACM, New York (1989)"},{"key":"26_CR21","first-page":"100","volume-title":"SPDP 1995: Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing","author":"H.M. Sayeed","year":"1995","unstructured":"Sayeed, H.M., Abu-Amara, H.: Perfectly secure message transmission in asynchronous networks. In: SPDP 1995: Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing, p. 100. IEEE Computer Society, Washington, DC, USA (1995)"},{"key":"26_CR22","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, 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"26_CR23","first-page":"1048","volume-title":"SODA 2008: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"B. Shankar","year":"2008","unstructured":"Shankar, B., Gopal, P., Srinathan, K., Rangan, C.P.: Unconditionally reliable message transmission in directed networks. In: SODA 2008: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1048\u20131055. Society for Industrial and Applied Mathematics, Philadelphia (2008)"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Rangan, C.P.: Optimal Perfectly Secure Message Transmission. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 545\u2013561. Springer, Heidelberg (2004)"},{"key":"26_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","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, pp. 461\u2013473. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Srinathan, K., Rangan, C.P.: Possibility and complexity of probabilistic reliable communications in directed networks. In: Proceedings of 25th ACM Symposium on Principles of Distributed Computing, PODC 2006 (2006)","key":"26_CR26","DOI":"10.1145\/1146381.1146421"},{"issue":"1","key":"26_CR27","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/974121.974124","volume":"33","author":"Y. Wang","year":"2004","unstructured":"Wang, Y.: Robust key establishment in sensor networks. SIGMOD Rec.\u00a033(1), 14\u201319 (2004)","journal-title":"SIGMOD Rec."},{"key":"26_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-14496-7_14","volume-title":"Information Theoretic Security","author":"Q. Yang","year":"2010","unstructured":"Yang, Q., Desmedt, Y.: Cryptanalysis of Secure Message Transmission Protocols with Feedback. In: Kurosawa, K. (ed.) Information Theoretic Security. LNCS, vol.\u00a05973, pp. 159\u2013176. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25578-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T09:00:04Z","timestamp":1555750804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25578-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255779","9783642255786"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25578-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}