{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:37:48Z","timestamp":1743025068168,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207273"},{"type":"electronic","value":"9783642207280"}],"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-20728-0_4","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T09:45:24Z","timestamp":1304588724000},"page":"32-51","source":"Crossref","is-referenced-by-count":4,"title":["Minimal Connectivity for Unconditionally Secure Message Transmission in Synchronous Directed Networks"],"prefix":"10.1007","author":[{"given":"Manan","family":"Nayak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shashank","family":"Agrawal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Srinathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","first-page":"1","volume-title":"Proceedings of the 20th Symposium on Theory of Computing (STOC)","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-cryptographic Fault-tolerant Distributed Computation. In: Proceedings of the 20th Symposium on Theory of Computing (STOC), pp. 1\u201310. ACM Press, New York (1988)"},{"key":"4_CR2","first-page":"11","volume-title":"Proceedings of 20th Symposium on Theory of Computing (STOC)","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Crepeau, C., Damgard, I.: Multi-party Unconditionally Secure Protocols. In: Proceedings of 20th Symposium on Theory of Computing (STOC), pp. 11\u201319. ACM Press, New York (1988)"},{"key":"4_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)"},{"issue":"1","key":"4_CR4","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"},{"key":"4_CR5","first-page":"218","volume-title":"Proceedings of the 19th Symposium on Theory of Computing (STOC)","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to Play any Mental Game. In: Proceedings of the 19th Symposium on Theory of Computing (STOC), pp. 218\u2013229. ACM Press, New York (1987)"},{"key":"4_CR6","first-page":"25","volume-title":"Proceedings of the 16th Symposium on Principles of Distributed Computing (PODC)","author":"M. Hirt","year":"1997","unstructured":"Hirt, M., Maurer, U.: Complete Characterization of Adversaries Tolerable in Secure Multi-party Computation. In: Proceedings of the 16th Symposium on Principles of Distributed Computing (PODC), pp. 25\u201334. ACM Press, New York (1997)"},{"key":"4_CR7","first-page":"193","volume-title":"Proceedings of the 21st Symposium on Principles of Distributed Computing (PODC)","author":"M.V.N.A. Kumar","year":"2002","unstructured":"Kumar, M.V.N.A., Goundan, P.R., Srinathan, K., Pandu Rangan, C.: On perfectly secure communication over arbitrary networks. In: Proceedings of the 21st Symposium on Principles of Distributed Computing (PODC), pp. 193\u2013202. ACM Press, Monterey (2002)"},{"issue":"3","key":"4_CR8","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."},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-76969-9_6","volume-title":"Cryptology and Network Security","author":"A. Patra","year":"2007","unstructured":"Patra, A., Shankar, B., Choudhary, A., Srinathan, K., Rangan, C.P.: Perfectly secure message transmission in directed networks tolerating threshold and non threshold adversary. In: Bao, F., Ling, S., Okamoto, T., Wang, H., Xing, C. (eds.) CANS 2007. LNCS, vol.\u00a04856, pp. 80\u2013101. Springer, Heidelberg (2007)"},{"key":"4_CR10","first-page":"73","volume-title":"Proceedings of the 21st Symposium on Theory of Computing (STOC)","author":"T. Rabin","year":"1989","unstructured":"Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In: Proceedings of the 21st Symposium on Theory of Computing (STOC), pp. 73\u201385. ACM Press, New York (1989)"},{"key":"4_CR11","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":"4_CR12","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., Pandu Rangan, C.: 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":"4_CR13","first-page":"171","volume-title":"ASIACCS 2009: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security","author":"K. Srinathan","year":"2009","unstructured":"Srinathan, K., Patra, A., Choudhary, A., Pandu Rangan, C.: Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary. In: ASIACCS 2009: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, pp. 171\u2013182. ACM, New York (2009)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Srinathan, K., Pandu Rangan, C.: Possibility and complexity of probabilistic reliable communications in directed networks. In: Proceedings of 25th ACM Symposium on Principles of Distributed Computing, PODC 2006 (2006)","DOI":"10.1145\/1146381.1146421"},{"key":"4_CR15","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","Information Theoretic Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20728-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T02:53:48Z","timestamp":1558580028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20728-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207273","9783642207280"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20728-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}