{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:26:02Z","timestamp":1740144362801,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1320351","CNS-1527579"],"award-info":[{"award-number":["CCF-1320351","CNS-1527579"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSA","award":["H98230-15-1-0281"],"award-info":[{"award-number":["H98230-15-1-0281"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1109\/tifs.2018.2855638","type":"journal-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T18:37:26Z","timestamp":1531420646000},"page":"514-524","source":"Crossref","is-referenced-by-count":1,"title":["On the Secret Key Capacity of Sibling Hidden Markov Models"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1953-657X","authenticated-orcid":false,"given":"Mohammad Reza","family":"Khalili Shoja","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4471-6425","authenticated-orcid":false,"given":"George T.","family":"Amariucai","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2972-6580","authenticated-orcid":false,"given":"Zhengdao","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5913-1441","authenticated-orcid":false,"given":"Shuangqing","family":"Wei","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2508-1420","authenticated-orcid":false,"given":"Jing","family":"Deng","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511819407.008"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.025"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.01.012"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139976602"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878230"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.81.036701"},{"key":"ref10","first-page":"24","article-title":"An additive autoregressive hidden Markov model for energy disaggregation","author":"early","year":"2015","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2014.6804255"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2567440"},{"key":"ref13","first-page":"127","article-title":"On bahadur efficiency of the maximum likelihood estimator in hidden Markov models","author":"fuh","year":"2004","journal-title":"Statist Sinica"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006873"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018340"},{"key":"ref16","first-page":"199","article-title":"Simple and tight bounds for information reconciliation and privacy amplification","author":"renner","year":"2005","journal-title":"Proc Int Conf Theory Appl Cryptol Inf Secur"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2278971"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2276628"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2530084"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2447506"},{"key":"ref4","first-page":"324","article-title":"KERMAN: A key establishment algorithm based on harvesting randomness in MANETs","author":"shoja","year":"2016","journal-title":"Proc Int Conf Secur Manage (SAM)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705909"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2550424"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2303162"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.5948\/UPO9781614440277","author":"dajani","year":"2002","journal-title":"Ergodic Theory of Numbers"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2003.808975"},{"journal-title":"Evolution of social networks","year":"1997","author":"stokman","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/90.503760"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12014"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref20","first-page":"3","article-title":"Universal hash families and the leftover hash lemma, and applications to cryptography and computing","volume":"42","author":"stinson","year":"2002","journal-title":"J Computer Math Combination Computing"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12066-8","author":"han","year":"2003","journal-title":"Information-spectrum methods in information theory"},{"key":"ref21","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":"Proc Int Conf Theory Appl Cryptographic Techn"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620720"},{"key":"ref23","first-page":"233","article-title":"Smooth Rényi entropy and applications","author":"renner","year":"2004","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref26","first-page":"155","article-title":"On the redundancy of variable-rate slepian-Wolf coding","author":"kuzuoka","year":"2012","journal-title":"Proc Int Symp Inf Theory Appl (ISITA)"},{"journal-title":"Asymptotic Estimates in Information Theory With Non-Vanishing Error Probabilities","year":"2015","author":"tan","key":"ref25"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/10206\/8424103\/8410616-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/8424103\/08410616.pdf?arnumber=8410616","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:15:47Z","timestamp":1657746947000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8410616\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":35,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tifs.2018.2855638","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"type":"print","value":"1556-6013"},{"type":"electronic","value":"1556-6021"}],"subject":[],"published":{"date-parts":[[2019,2]]}}}