{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:43:43Z","timestamp":1760240623881,"version":"build-2065373602"},"reference-count":33,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T00:00:00Z","timestamp":1564099200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001729","name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning","doi-asserted-by":"publisher","award":["RIT15-0091"],"award-info":[{"award-number":["RIT15-0091"]}],"id":[{"id":"10.13039\/501100001729","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010661","name":"Horizon 2020","doi-asserted-by":"publisher","award":["694630"],"award-info":[{"award-number":["694630"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004063","name":"Knut och Alice Wallenbergs Stiftelse","doi-asserted-by":"publisher","award":["65542"],"award-info":[{"award-number":["65542"]}],"id":[{"id":"10.13039\/501100004063","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>This paper investigates the problem of secret key generation over a wiretap channel when the terminals observe correlated sources. These sources are independent of the main channel and the users overhear them before the transmission takes place. A novel outer bound is proposed and, employing a previously reported inner bound, the secret key capacity is derived under certain less-noisy conditions on the channel or source components. This result improves upon the existing literature where the more stringent condition of degradedness is required. Furthermore, numerical evaluation of the achievable scheme and previously reported results for a binary model are presented; a comparison of the numerical bounds provides insights on the benefit of the chosen scheme.<\/jats:p>","DOI":"10.3390\/e21080732","type":"journal-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T08:45:39Z","timestamp":1564130739000},"page":"732","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The Secret Key Capacity of a Class of Noisy Channels with Correlated Sources"],"prefix":"10.3390","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8974-6591","authenticated-orcid":false,"given":"Germ\u00e1n","family":"Bassi","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, 100 44 Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8717-2117","authenticated-orcid":false,"given":"Pablo","family":"Piantanida","sequence":"additional","affiliation":[{"name":"CentraleSup\u00e9lec\u2013French National Center for Scientific Research (CNRS)\u2013Universit\u00e9 Paris-Sud, 3 Rue Joliot-Curie, F-91192 Gif-sur-Yvette, France"},{"name":"Montreal Institute for Learning Algorithms (MILA), Universit\u00e9 de Montr\u00e9al, 2920 Chemin de la Tour, Montr\u00e9al, QC H3T 1N8, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6594-3371","authenticated-orcid":false,"given":"Shlomo","family":"Shamai (Shitz)","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Technion\u2013Israel Institute of Technology, Haifa 32000, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,7,26]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","article-title":"The Wire-Tap Channel","volume":"54","author":"Wyner","year":"1975","journal-title":"Bell Syst. Tech. J."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1109\/TIT.1978.1055892","article-title":"Broadcast Channels with Confidential Messages","volume":"24","year":"1978","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication Theory of Secrecy Systems","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell Syst. Tech. J."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-319-23609-4_1","article-title":"Physical Layer Security: A Paradigm Shift in Data Confidentiality","volume":"Volume 358","author":"Baldi","year":"2016","journal-title":"Physical and Data-Link Security Techniques for Future Communication Systems"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1561\/0100000072","article-title":"Multiterminal Secrecy by Public Discussion","volume":"Volume 13","author":"Narayan","year":"2016","journal-title":"Foundations and Trends\u00ae in Communications and Information Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/18.256484","article-title":"Secret Key Agreement by Public Discussion from Common Information","volume":"39","author":"Maurer","year":"1993","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1109\/18.243431","article-title":"Common Randomness in Information Theory and Cryptography\u2014Part I: Secret Sharing","volume":"39","author":"Ahlswede","year":"1993","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/18.825796","article-title":"Common Randomness and Secret Key Generation with a Helper","volume":"46","author":"Narayan","year":"2000","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2437","DOI":"10.1109\/TIT.2008.921705","article-title":"Secrecy Capacities for Multiterminal Channel Models","volume":"54","author":"Narayan","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/TIT.2012.2216254","article-title":"Secrecy Generation for Multiaccess Channel Models","volume":"59","author":"Narayan","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"3973","DOI":"10.1109\/TIT.2010.2050832","article-title":"Information-Theoretic Key Agreement of Multiple Terminals\u2014Part I","volume":"56","author":"Gohari","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"3997","DOI":"10.1109\/TIT.2010.2050925","article-title":"Information-Theoretic Key Agreement of Multiple Terminals\u2014Part II: Channel Model","volume":"56","author":"Gohari","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/TIT.2011.2173629","article-title":"Secret-Key Generation Using Correlated Sources and Channels","volume":"58","author":"Khisti","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"6747","DOI":"10.1109\/TIT.2012.2208579","article-title":"Secrecy via Sources and Channels","volume":"58","author":"Prabhakaran","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Bunin, A., Piantanida, P., and Shamai, S. (2016, January 16\u201318). The Gaussian Wiretap Channel with Correlated Sources at the Terminals: Secret Communication and Key Generation. Proceedings of the 2016 ICSEE International Conference on the Science of Electrical Engineering, Eilat, Israel.","DOI":"10.1109\/ICSEE.2016.7806128"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1765","DOI":"10.1109\/JSAC.2013.130910","article-title":"Key Agreement over a Generalized Multiple Access Channel Using Noiseless and Noisy Feedback","volume":"31","author":"Salimi","year":"2013","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"5627","DOI":"10.1109\/TIT.2013.2264355","article-title":"Common Information and Secret Key Capacity","volume":"59","author":"Tyagi","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"3796","DOI":"10.1109\/TIT.2016.2567440","article-title":"Secret Key Agreement: General Capacity and Second-Order Asymptotics","volume":"62","author":"Hayashi","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"3785","DOI":"10.1109\/TIT.2016.2539347","article-title":"Coded Cooperative Data Exchange for a Secret Key","volume":"62","author":"Courtade","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Boche, H., Schaefer, R.F., and Poor, H.V. (2019, January 12\u201317). On the Computability of the Secret Key Capacity under Rate Constraints. Proceedings of the 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Brighton, UK.","DOI":"10.1109\/ICASSP.2019.8683122"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1109\/TIT.2007.911157","article-title":"Wiretap Channel with Side Information","volume":"54","author":"Chen","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Liu, W., and Chen, B. (2007, January 4\u20137). Wiretap Channel with Two-Sided Channel State Information. Proceedings of the 2007 41st Asilomar Conference on Signals, Systems and Computers (ACSSC), Pacific Grove, CA, USA.","DOI":"10.1109\/ACSSC.2007.4487347"},{"key":"ref_23","first-page":"19","article-title":"Coding for Channel with Random Parameters","volume":"9","author":"Gelfand","year":"1980","journal-title":"Probl. Control Inf. Theory"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Muramatsu, J. (July, January 29). General Formula for Secrecy Capacity of Wiretap Channel with Noncausal State. Proceedings of the 2014 IEEE International Symposium on Information Theory (ISIT), Honolulu, HI, USA.","DOI":"10.1109\/ISIT.2014.6874787"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Goldfeld, Z., Cuff, P., and Permuter, H.H. (2016). Wiretap Channels with Random States Non-Causally Available at the Encoder. arXiv.","DOI":"10.1109\/ICSEE.2016.7806196"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1456","DOI":"10.1109\/TIFS.2015.2407153","article-title":"Key Generation over Wiretap Models with Non-Causal Side Information","volume":"10","author":"Zibaeenejad","year":"2015","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Bunin, A., Goldfeld, Z., Permuter, H.H., Shamai, S., Cuff, P., and Piantanida, P. (2018). Key and Message Semantic-Security over State-Dependent Channels. IEEE Trans. Inf. Forensics Secur.","DOI":"10.1109\/ISIT.2018.8437854"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"2213","DOI":"10.1109\/TIT.2018.2883299","article-title":"The Wiretap Channel with Generalized Feedback: Secure Communication and Key Generation","volume":"65","author":"Bassi","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"El Gamal, A., and Kim, Y.H. (2011). Network Information Theory, Cambridge University Press.","DOI":"10.1017\/CBO9781139030687"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Bassi, G., Piantanida, P., and Shamai, S. (2016, January 10\u201315). Secret Key Generation over Noisy Channels with Common Randomness. Proceedings of the 2016 IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain.","DOI":"10.1109\/ISIT.2016.7541351"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Bassi, G., Piantanida, P., and Shamai, S. (2016). Secret Key Generation over Noisy Channels with Correlated Sources. arXiv.","DOI":"10.1109\/ISIT.2016.7541351"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Cao, D., and Kang, W. (2017, January 11\u201313). Secret key generation from correlated sources and secure link. Proceedings of the 2017 9th International Conference on Wireless Communications and Signal Processing (WCSP), Nanjing, China.","DOI":"10.1109\/WCSP.2017.8171157"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Nair, C. (July, January 28). Capacity Regions of Two New Classes of 2-Receiver Broadcast Channels. Proceedings of the 2009 IEEE International Symposium on Information Theory (ISIT), Seoul, Korea.","DOI":"10.1109\/ISIT.2009.5205399"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/8\/732\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:09:59Z","timestamp":1760188199000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/8\/732"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,26]]},"references-count":33,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2019,8]]}},"alternative-id":["e21080732"],"URL":"https:\/\/doi.org\/10.3390\/e21080732","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2019,7,26]]}}}