{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T07:06:24Z","timestamp":1746860784682},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2012,2,1]],"date-time":"2012-02-01T00:00:00Z","timestamp":1328054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1109\/tit.2011.2173629","type":"journal-article","created":{"date-parts":[[2012,2,7]],"date-time":"2012-02-07T21:19:58Z","timestamp":1328649598000},"page":"652-670","source":"Crossref","is-referenced-by-count":51,"title":["Secret-Key Generation Using Correlated Sources and Channels"],"prefix":"10.1109","volume":"58","author":[{"given":"Ashish","family":"Khisti","sequence":"first","affiliation":[]},{"given":"Suhas N.","family":"Diggavi","sequence":"additional","affiliation":[]},{"given":"Gregory W.","family":"Wornell","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.568694"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921680"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111750"},{"key":"ref12","first-page":"3","article-title":"Capacity of the product and sum of two un-matched broadcast channels","author":"gamal","year":"1980","journal-title":"Probl Inf Transm"},{"key":"ref13","author":"gamal","year":"2010","journal-title":"Lecture notes on network information theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050832"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4594958"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2009.5425429"},{"key":"ref17","article-title":"Secret-key generation using correlated sources and noisy channels","author":"khisti","year":"2008","journal-title":"Presentation at the Inf Theory and its Appl (ITA) Workshop"},{"key":"ref18","article-title":"Secret key generation using correlated sources and noisy channels","author":"khisti","year":"2008","journal-title":"Proc Int Symp Inf Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921861"},{"key":"ref28","author":"prabhakaran","year":"0","journal-title":"Secrecy via Sources and ChannelsA Secret-KeySecret Message Rate Trade-Off Region"},{"key":"ref4","first-page":"1","article-title":"Biometric methods for secure communications in body sensor networks: Resource-efficient key management and signal-level data scrambling","author":"bui","year":"2008","journal-title":"EURASIP J Adv Signal Process Special Issue on Adv Signal Process Pattern Recogn Methods for Biometr"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921858"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921908"},{"key":"ref6","first-page":"48","article-title":"Almost independence and secrecy capacity (in russian)","volume":"32","author":"csiszr","year":"1996","journal-title":"Probl Inf Transm"},{"key":"ref29","article-title":"A separation result for secure communication","author":"prabhakaran","year":"2007","journal-title":"Proc Allerton Conf Comm Contr Comp"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICPPW.2003.1240399"},{"key":"ref8","author":"csiszr","year":"1981","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055892"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055184"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.825796"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2068852"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2132430"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2068852"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018322"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928272"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-45539-6_24","article-title":"Information-theoretic key agreement: From weak to strong secrecy for free","volume":"1807","author":"maurer","year":"2000","journal-title":"Proc Eurocrypt 2000"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6145469\/06145481.pdf?arnumber=6145481","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:53:31Z","timestamp":1633910011000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6145481\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2]]},"references-count":32,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2173629","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2]]}}}