{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:04:18Z","timestamp":1750309458394,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T00:00:00Z","timestamp":1735948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,1,4]]},"DOI":"10.1145\/3700838.3700873","type":"proceedings-article","created":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T12:58:12Z","timestamp":1735822692000},"page":"191-200","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Perfectly Secure Message Transmission Tolerating Omission Faults -- Possibility Feasibility, and Optimality"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9576-1317","authenticated-orcid":false,"given":"Ravi","family":"Kishore","sequence":"first","affiliation":[{"name":"Ecole Centrale School of Engineering, Mahindra University, Hyderabad, Telangana, India"}]}],"member":"320","published-online":{"date-parts":[[2025,1,4]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_24"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872069"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"crossref","unstructured":"Ashwinkumar Badanidiyuru Arpita Patra Ashish Choudhury Kannan Srinathan and C.\u00a0Pandu Rangan. 2012. On the trade-off between network connectivity round complexity and communication complexity of reliable message transmission. J. ACM 59 5 (2012) pp. 22.","DOI":"10.1145\/2371656.2371657"},{"key":"e_1_3_3_2_5_2","unstructured":"Konstantinos Brazitikos and Vassilis Zikas. 2024. General Adversary Structures in Byzantine Agreement and Multi-Party Computation with Active and Omission Corruption. Cryptology ePrint Archive Paper 2024\/209. https:\/\/eprint.iacr.org\/2024\/209 https:\/\/eprint.iacr.org\/2024\/209."},{"key":"e_1_3_3_2_6_2","first-page":"148","volume-title":"Distributed Computing and Networking, 10th International Conference, ICDCN 2009, Hyderabad, India, January 3-6. Proceedings","author":"Choudhary Ashish","year":"2009","unstructured":"Ashish Choudhary, Arpita Patra, B.\u00a0V. Ashwinkumar, Kannan Srinathan, and C.\u00a0Pandu Rangan. 2009. On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. In Distributed Computing and Networking, 10th International Conference, ICDCN 2009, Hyderabad, India, January 3-6. Proceedings. 148\u2013162."},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46035-7_33"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"crossref","unstructured":"Danny Dolev Cynthia Dwork Orli Waarts and Moti Yung. 1993. Perfectly Secure Message Transmission. J. ACM 40 1 (1993) pp. 17\u201347.","DOI":"10.1145\/138027.138036"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"crossref","unstructured":"Ravi Kishore Ashutosh Kumar Chiranjeevi Vanarasa and Kannan Srinathan. 2018. On the Price of Proactivizing Round-Optimal Perfectly Secret Message Transmission. IEEE Trans. Inf. Theory 64 2 (2018) 1404\u20131422.","DOI":"10.1109\/TIT.2017.2776099"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/2833312.2833327"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"crossref","unstructured":"Ravi Kishore Chiranjeevi Vanarasa and Kannan Srinathan. 2018. On minimal connectivity requirements for secure message transmission in directed networks. Inf. Process. Lett. 131 (2018) 1\u20136.","DOI":"10.1016\/j.ipl.2017.11.001"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"crossref","unstructured":"Kaoru Kurosawa and Kazuhiro Suzuki. 2009. Truly efficient 2-round perfectly secure message transmission scheme. IEEE Trans. Information Theory 55 11 (2009) pp. 5223\u20135232.","DOI":"10.1109\/TIT.2009.2030434"},{"key":"e_1_3_3_2_13_2","unstructured":"Julian Loss Kecheng Shi and Gilad Stern. 2024. Optimal Consensus in the Presence of Overlapping Faults and Total Omission. IACR Cryptol. ePrint Arch. (2024) 807. https:\/\/eprint.iacr.org\/2024\/807"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281153"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/11941378_16"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75142-7_43"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"crossref","unstructured":"Arpita Patra Ashish Choudhury C.\u00a0Pandu Rangan and Kannan Srinathan. 2010. Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility feasibility and optimality. IJACT 2 2 (2010) pp. 159\u2013197.","DOI":"10.1504\/IJACT.2010.038309"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/SPDP.1995.530671"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"crossref","unstructured":"Hasan\u00a0Md. Sayeed and Hosame Abu-Amara. 1996. Efficient Perfectly Secure Message Transmission in Synchronous Networks. Inf. Comput. 126 1 (1996) pp. 53\u201361.","DOI":"10.1006\/inco.1996.0033"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"crossref","unstructured":"Adi Shamir. 1979. How to Share a Secret. Commun. ACM 22 11 (1979) pp. 612\u2013613.","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53641-4_12"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"crossref","unstructured":"Gabriele Spini and Gilles Z\u00e9mor. 2020. Efficient Protocols for Perfectly Secure Message Transmission With Applications to Secure Network Coding. IEEE Trans. Inf. Theory 66 10 (2020) 6340\u20136353.","DOI":"10.1109\/TIT.2020.2994285"},{"key":"e_1_3_3_2_23_2","unstructured":"K. Srinathan. 2006. Secure distributed communication. Ph.\u00a0D. Dissertation. IIT Madras."},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36178-2_14"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_33"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77026-8_9"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_17"}],"event":{"name":"ICDCN 2025: 26th International Conference on Distributed Computing and Networking","acronym":"ICDCN 2025","location":"Hyderabad India"},"container-title":["Proceedings of the 26th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700838.3700873","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3700838.3700873","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:22Z","timestamp":1750295422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700838.3700873"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,4]]},"references-count":26,"alternative-id":["10.1145\/3700838.3700873","10.1145\/3700838"],"URL":"https:\/\/doi.org\/10.1145\/3700838.3700873","relation":{},"subject":[],"published":{"date-parts":[[2025,1,4]]},"assertion":[{"value":"2025-01-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}