{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:56Z","timestamp":1740131696980,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Tata Consultancy Services, India"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1109\/tit.2017.2776099","type":"journal-article","created":{"date-parts":[[2017,11,21]],"date-time":"2017-11-21T19:09:55Z","timestamp":1511291395000},"page":"1404-1422","source":"Crossref","is-referenced-by-count":2,"title":["On the Price of Proactivizing Round-Optimal Perfectly Secret Message Transmission"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9576-1317","authenticated-orcid":false,"given":"Ravi","family":"Kishore","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0432-7532","authenticated-orcid":false,"given":"Ashutosh","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Chiranjeevi","family":"Vanarasa","sequence":"additional","affiliation":[]},{"given":"Kannan","family":"Srinathan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Distributed Algorithms","year":"1996","author":"lynch","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.12.004"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"ref30","first-page":"193","article-title":"On perfectly secure communication over arbitrary networks","author":"ashwin kumar","year":"2002","journal-title":"Proc 21st Ann Symp Principles of Distributed Computing (PODC)"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/0204043"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2628036"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89641-8_21"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225077"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76969-9_6"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/259380.259412"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/112600.112605"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73458-1_33"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70500-0_13"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055724"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36178-2_14"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1533057.1533083"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030434"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910002"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.4064\/fm-10-1-96-115"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2371656.2371657"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090251"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_17"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921676"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20728-0_4"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SPDP.1995.530671"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/138027.138036"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2014.01.012"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17470-9_3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85093-9_15"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2011.03.004"},{"key":"ref21","first-page":"148","article-title":"On minimal connectivity requirement for secure message transmission in asynchronous networks","author":"choudhary","year":"2009","journal-title":"Proc 10th Int Conf Distrib Comput Netw (ICDCN)"},{"key":"ref24","first-page":"497","article-title":"Asynchronous perfectly secure computation tolerating generalized adversaries","author":"ashwin kumar","year":"2002","journal-title":"Proc 7th Austral Conf Inf Secur Privacy (ACISP)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25578-6_26"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146421"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15763-9_20"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8263292\/08116667.pdf?arnumber=8116667","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:24:27Z","timestamp":1642004667000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8116667\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":36,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2776099","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2018,2]]}}}