{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:00Z","timestamp":1773377940560,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61871264"],"award-info":[{"award-number":["61871264"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"Shanghai Municipal Science and Technology","doi-asserted-by":"publisher","award":["2021SHZDZX0102"],"award-info":[{"award-number":["2021SHZDZX0102"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517973","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"843-848","source":"Crossref","is-referenced-by-count":2,"title":["Strong Secrecy of Arbitrarily Varying Wiretap Channels with Constraints by Stochastic Code"],"prefix":"10.1109","author":[{"given":"Yiqi","family":"Chen","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University,Department of Computer Science and Engineering,Shanghai,China"}]},{"given":"Dan","family":"He","sequence":"additional","affiliation":[{"name":"Intel Asia-Pacific Research & Development Ltd.,Shanghai,China"}]},{"given":"Chenhao","family":"Ying","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University,Department of Computer Science and Engineering,Shanghai,China"}]},{"given":"Yuan","family":"Luo","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University,Department of Computer Science and Engineering,Shanghai,China"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055346"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2565482"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2550587"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173973"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref15","author":"chen","year":"0","journal-title":"Strong secrecy of arbitrarily varying wiretap channel with constraints"},{"key":"ref16","article-title":"Coloring hypergraphs: A new approach to multi-user source coding, 1","volume":"4","author":"ahlswede","year":"1979","journal-title":"J Combinatorics Information and System Sciences"},{"key":"ref17","author":"chen","year":"0","journal-title":"Strong secrecy of arbitrarily varying multiple access channels"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437347"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.3390\/e18070238"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.2627"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.2598"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2861776"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36899-8_5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394876"},{"key":"ref2","first-page":"159","article-title":"Elimination of correlation in random codes for arbitrarily varying channels","volume":"44","author":"ahlswede","year":"1978","journal-title":"Probability Theory and Related Fields"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706106"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2619701"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517973.pdf?arnumber=9517973","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:37Z","timestamp":1773347737000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517973\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517973","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}