{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:52:55Z","timestamp":1740117175644,"version":"3.37.3"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100012913","name":"Tata Consultancy Services","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100012913","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1016\/j.ipl.2017.11.001","type":"journal-article","created":{"date-parts":[[2017,11,10]],"date-time":"2017-11-10T02:30:34Z","timestamp":1510281034000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["On minimal connectivity requirements for secure message transmission in directed networks"],"prefix":"10.1016","volume":"131","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9576-1317","authenticated-orcid":false,"given":"Ravi","family":"Kishore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chiranjeevi","family":"Vanarasa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinathan","family":"Kannan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ipl.2017.11.001_br0010","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/138027.138036","article-title":"Perfectly secure message transmission","volume":"40","author":"Dolev","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/j.ipl.2017.11.001_br0020","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","article-title":"Zur allgemeinen kurventheorie","volume":"10","author":"Menger","year":"1927","journal-title":"Fundam. Math."},{"issue":"6","key":"10.1016\/j.ipl.2017.11.001_br0030","doi-asserted-by":"crossref","first-page":"2582","DOI":"10.1109\/TIT.2008.921676","article-title":"Perfectly secure message transmission revisited","volume":"54","author":"Wang","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ipl.2017.11.001_br0040","series-title":"Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing","first-page":"278","article-title":"Brief announcement: perfectly secure message transmission in directed networks re-visited","author":"Patra","year":"2009"},{"key":"10.1016\/j.ipl.2017.11.001_br0050","series-title":"Proceedings of the 11th International Conference on Distributed Computing and Networking","first-page":"42","article-title":"On communication complexity of secure message transmission in directed networks","author":"Patra","year":"2010"},{"key":"10.1016\/j.ipl.2017.11.001_br0060","series-title":"Proceedings of the 6th International Conference on Security and Cryptography for Networks","first-page":"309","article-title":"Unconditionally reliable and secure message transmission in directed networks revisited","author":"Patra","year":"2008"},{"key":"10.1016\/j.ipl.2017.11.001_br0070","series-title":"Proceedings of the 17th International Conference on Distributed Computing and Networking","first-page":"29:1","article-title":"On perfectly secret message transmission in digraphs tolerating dual failures","author":"Kishore","year":"2016"},{"key":"10.1016\/j.ipl.2017.11.001_br0080","series-title":"Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing","first-page":"193","article-title":"On perfectly secure communication over arbitrary networks","author":"Kumar","year":"2002"},{"key":"10.1016\/j.ipl.2017.11.001_br0090","series-title":"Information Theoretic Security \u2013 8th International Conference","first-page":"33","article-title":"Round-optimal perfectly secret message transmission with linear communication complexity","author":"Kishore","year":"2015"},{"key":"10.1016\/j.ipl.2017.11.001_br0100","series-title":"Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology","first-page":"121","article-title":"Trading correctness for privacy in unconditional multi-party computation (extended abstract)","author":"Fitzi","year":"1998"},{"key":"10.1016\/j.ipl.2017.11.001_br0110","series-title":"Proceedings of the 5th International Conference on Information Theoretic Security","first-page":"32","article-title":"Minimal connectivity for unconditionally secure message transmission in synchronous directed networks","author":"Nayak","year":"2011"},{"issue":"1","key":"10.1016\/j.ipl.2017.11.001_br0120","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s001459910002","article-title":"Secure communication in minimal connectivity models","volume":"13","author":"Franklin","year":"2000","journal-title":"J. Cryptol."},{"key":"10.1016\/j.ipl.2017.11.001_br0130","series-title":"Proceedings of the 21st International Symposium on Distributed Computing","first-page":"496","article-title":"Perfectly reliable and secure communication in directed networks tolerating mixed adversary","author":"Patra","year":"2007"},{"key":"10.1016\/j.ipl.2017.11.001_br0140","series-title":"Proceedings of the 8th International Conference on Cryptology in India, Progress in Cryptology","first-page":"101","article-title":"Probabilistic perfectly reliable and secure message transmission \u2013 possibility, feasibility and optimality","author":"Srinathan","year":"2007"},{"issue":"11","key":"10.1016\/j.ipl.2017.11.001_br0150","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun. ACM"},{"key":"10.1016\/j.ipl.2017.11.001_br0160","series-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing","first-page":"73","article-title":"Verifiable secret sharing and multiparty protocols with honest majority (extended abstract)","author":"Rabin","year":"1989"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019017301886?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019017301886?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T13:03:30Z","timestamp":1575551010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019017301886"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":16,"alternative-id":["S0020019017301886"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2017.11.001","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[2018,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On minimal connectivity requirements for secure message transmission in directed networks","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2017.11.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}