{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T01:06:32Z","timestamp":1725671192001},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006873","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"1968-1972","source":"Crossref","is-referenced-by-count":4,"title":["Asymptotic converse bound for secret key capacity in hidden Markov model"],"prefix":"10.1109","author":[{"given":"Mohammad Reza Khalili","family":"Shoja","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George Traian","family":"Amariucai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengdao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuangqing","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2567440"},{"journal-title":"Asymptotic estimates in information theory with nonvanishing error probabilities","year":"2015","author":"tan","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705909"},{"journal-title":"A simple introduction to ergodic theory","year":"2008","author":"dajani","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523737"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2530084"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2550424"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2014.6804255"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/11593447_11","article-title":"Simple and tight bounds for information reconciliation and privacy amplification","author":"renner","year":"2005","journal-title":"Advances in Cryptology ASIACRYPT 2005"},{"key":"ref8","first-page":"127","article-title":"On bahadur efficiency of the maximum likelihood estimator in hidden markov models","author":"fuh","year":"2004","journal-title":"Statistica Sinica"},{"key":"ref7","first-page":"369","article-title":"A bound for multiparty secret key agreement and implications for a problem of secure computing","author":"tyagi","year":"2014","journal-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2447506"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006873.pdf?arnumber=8006873","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T18:20:08Z","timestamp":1570040408000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006873\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006873","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}