{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:04:53Z","timestamp":1730196293366,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1109\/allerton.2011.6120200","type":"proceedings-article","created":{"date-parts":[[2012,1,6]],"date-time":"2012-01-06T21:40:38Z","timestamp":1325886038000},"page":"439-444","source":"Crossref","is-referenced-by-count":10,"title":["Universally attainable error and information exponents, and equivocation rate for the broadcast channels with confidential messages"],"prefix":"10.1109","author":[{"given":"Masahito","family":"Hayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryutaroh","family":"Matsumoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2010","author":"soma","journal-title":"On Universal Wiretap Channel Coding","key":"17"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"15","article-title":"Strong security and separated code constructions for the broadcast channels with confidential messages","author":"matsumoto","year":"2011","journal-title":"IEICE Trans Fundamentals"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1109\/ISNETCOD.2011.5979076"},{"year":"2009","author":"liang","journal-title":"Information Theoretic Security","key":"13"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1109\/ISIT.2011.6033896"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1109\/TIT.1977.1055655"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1155\/2009\/142374"},{"year":"1981","author":"csisza?r","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems","key":"3"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1016\/0022-0000(79)90044-8"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1109\/18.476316"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1109\/TIT.1980.1056275"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1109\/TIT.2006.871040"},{"year":"1968","author":"gallager","journal-title":"Information Theory and Reliable Communication","key":"6"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1109\/TIT.1978.1055892"},{"key":"4","first-page":"40","article-title":"Almost independence and secrecy capacity","volume":"32","author":"csisza?r","year":"1996","journal-title":"Problems of Information Transmission"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1109\/ISIT.2009.5205953"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1109\/TIT.2011.2110950"}],"event":{"name":"2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2011,9,28]]},"location":"Monticello, IL","end":{"date-parts":[[2011,9,30]]}},"container-title":["2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6111659\/6120135\/06120200.pdf?arnumber=6120200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T23:51:51Z","timestamp":1494633111000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6120200\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/allerton.2011.6120200","relation":{},"subject":[],"published":{"date-parts":[[2011,9]]}}}