{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T02:43:19Z","timestamp":1747104199344},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1109\/tit.2010.2090251","type":"journal-article","created":{"date-parts":[[2010,12,29]],"date-time":"2010-12-29T22:05:04Z","timestamp":1293660304000},"page":"572-585","source":"Crossref","is-referenced-by-count":10,"title":["On Optimal Secure Message Transmission by Public Discussion"],"prefix":"10.1109","volume":"57","author":[{"given":"Hongsong","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaoquan","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reihaneh","family":"Safavi-Naini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed Ashraful","family":"Tuhin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85093-9_1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_18"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_9"},{"key":"ref13","author":"kurosawa","year":"2007","journal-title":"Almost Secure (1-Round n-Channel) Message Transmission Scheme"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_19"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref16","author":"patra","year":"2007","journal-title":"Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks Possibility Feasibility and Optimality"},{"key":"ref17","first-page":"73","article-title":"verifiable secret sharing and multiparty protocols with honest majority (extended abstract)","author":"rabin","year":"1989","journal-title":"ACM Symp Theory of Computing"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0033"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205936"},{"key":"ref4","first-page":"11","article-title":"multiparty unconditionally secure protocols (extended abstract)","author":"chaum","year":"1988","journal-title":"Proc Symp Foundations of Computer Science"},{"key":"ref3","first-page":"1","article-title":"completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract)","author":"ben-or","year":"1988","journal-title":"Proc ACM Symp Theory of Computing"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0217061"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/138027.138036"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_17"},{"key":"ref7","first-page":"502","author":"desmedt","year":"2002","journal-title":"Adv Cryptol EUROCRYPT'02"},{"key":"ref2","first-page":"394","author":"agarwal","year":"0","journal-title":"Advances in CryptologyCRYPTO 2006"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85093-9_2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910002"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/978-3-540-28628-8_33","author":"srinathan","year":"2004","journal-title":"Advances in Cryptology-CRYPTO 2004"},{"key":"ref22","author":"wullschleger","year":"2006","journal-title":"Oblivious Transfer Amplification"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/135419.135437"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90033-7"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5673678\/05673781.pdf?arnumber=5673781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:00Z","timestamp":1633909620000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5673781\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1]]},"references-count":23,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2090251","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1]]}}}