{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T12:10:07Z","timestamp":1751803807852,"version":"3.41.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437347","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:14:55Z","timestamp":1534536895000},"page":"466-470","source":"Crossref","is-referenced-by-count":3,"title":["Arbitrarily Varying Wiretap Channel: a New Scheme for the Proof of Strong Secrecy"],"prefix":"10.1109","author":[{"given":"Dan","family":"He","sequence":"first","affiliation":[]},{"given":"Yuan","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Wangmei","family":"Guo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1984.tb00072.x"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2351812"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF00533053"},{"key":"ref13","article-title":"Compound wiretap channel","author":"liang","year":"2008","journal-title":"EURASIP J Wireless Commun Networking"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2565483"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848839"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1023\/A:1007636609202","article-title":"Arbitrarily varying wiretap channel with channel state sequence known or unknown at the receiver","author":"he","year":"0","journal-title":"IEEE Trans Inf Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541350"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-642-36899-8_5","article-title":"Capacity results for arbitrarily varying wiretap channels","author":"bjelakovi?","year":"2013","journal-title":"Information Theory Combinatorics and Search Theory"},{"key":"ref5","first-page":"4","article-title":"Topics in multi-user information theory","volume":"4","author":"kramer","year":"2007","journal-title":"Foundations and Trends? in Communications and Information Theory"},{"key":"ref8","first-page":"40","article-title":"Almost independence and secrecy capacity","volume":"32","author":"csisz\u00e1r","year":"1996","journal-title":"Prob Inf Transmission"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946013010079"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems","year":"1981","author":"csisz\u00e1r","key":"ref9"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437347.pdf?arnumber=8437347","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T11:47:13Z","timestamp":1751802433000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437347\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437347","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}