The Secret Key Capacity of a Class of Noisy Channels with Correlated Sources

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 previ...

Full description

Saved in:
Bibliographic Details
Published in:Entropy (Basel, Switzerland) Switzerland), 2019-07, Vol.21 (8), p.732
Main Authors: Bassi, Germán, Piantanida, Pablo, Shamai (Shitz), Shlomo
Format: Article
Language:English
Subjects:
Communication
Correlated Sources
Electronic surveillance
Engineering Sciences
Information-Theoretic Security
Secret Key Agreement
Secret Key Capacity
Wiretap Channel
Wiretapping
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c518t-afb742293d39fb155c8d198664dd770c88969bd675c09b3c5a34929958394613
cites cdi_FETCH-LOGICAL-c518t-afb742293d39fb155c8d198664dd770c88969bd675c09b3c5a34929958394613
container_end_page
container_issue 8
container_start_page 732
container_title Entropy (Basel, Switzerland)
container_volume 21
creator Bassi, Germán
Piantanida, Pablo
Shamai (Shitz), Shlomo
description 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.
doi_str_mv 10.3390/e21080732
format article
fullrecord <record><control><sourceid>proquest_doaj_</sourceid><recordid>TN_cdi_doaj_primary_oai_doaj_org_article_e0f029a8acd9463a8329bc362fe5f6f2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><doaj_id>oai_doaj_org_article_e0f029a8acd9463a8329bc362fe5f6f2</doaj_id><sourcerecordid>2466770916</sourcerecordid><originalsourceid>FETCH-LOGICAL-c518t-afb742293d39fb155c8d198664dd770c88969bd675c09b3c5a34929958394613</originalsourceid><addsrcrecordid>eNpdUk1vEzEQXSEQLS0H_sFKXOCw1N9rX5CiLdCqET004mp5vePuhs062E6r_HucpCqkJ49m3nvzxjNF8QGjL5QqdAEEI4lqSl4VpxgpVTGK0Ov_4pPiXYxLhAglWLwtTiglomZMnBbzRQ_lHdgAqbyBbdmYtbFD2pbelaZsRhPjLvzph5iLvZkmGGP5OKS-bHwIMJoEXXnnN8FCPC_eODNGeP_0nhWL798WzVU1v_1x3czmleVYpsq4tmaEKNpR5VrMuZUdVlII1nV1jayUSqi2EzW3SLXUckOZIkpxSRUTmJ4V1wfZzpulXodhZcJWezPofcKHe21CGuwIGpBDRBlpbJep1EhKVGupIA64E45kreqgFR9hvWmP1C6HX7O92u_Ua8IlEijjvx7wGbyCzsKUghmPaMeVaej1vX_QNcec7M1_Pgj0L2hXs7ne5bJfhvKYDzvsp6dmwf_ZQEx6NUQL42gm8JuoCRMif5jCIkM_voAu806mvIXsnEkquWD8X3MbfIwB3LMDjPTulPTzKdG_1GO2Iw</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2548385645</pqid></control><display><type>article</type><title>The Secret Key Capacity of a Class of Noisy Channels with Correlated Sources</title><source>Publicly Available Content Database</source><source>PubMed Central</source><source>Directory of Open Access Journals</source><creator>Bassi, Germán ; Piantanida, Pablo ; Shamai (Shitz), Shlomo</creator><creatorcontrib>Bassi, Germán ; Piantanida, Pablo ; Shamai (Shitz), Shlomo</creatorcontrib><description>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.</description><identifier>ISSN: 1099-4300</identifier><identifier>EISSN: 1099-4300</identifier><identifier>DOI: 10.3390/e21080732</identifier><identifier>PMID: 33267446</identifier><language>eng</language><publisher>Basel: MDPI AG</publisher><subject>Communication ; Correlated Sources ; Electronic surveillance ; Engineering Sciences ; Information-Theoretic Security ; Secret Key Agreement ; Secret Key Capacity ; Wiretap Channel ; Wiretapping</subject><ispartof>Entropy (Basel, Switzerland), 2019-07, Vol.21 (8), p.732</ispartof><rights>2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>Attribution</rights><rights>2019 by the authors. 2019</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c518t-afb742293d39fb155c8d198664dd770c88969bd675c09b3c5a34929958394613</citedby><cites>FETCH-LOGICAL-c518t-afb742293d39fb155c8d198664dd770c88969bd675c09b3c5a34929958394613</cites><orcidid>0000-0002-6594-3371 ; 0000-0002-8974-6591 ; 0000-0002-8717-2117</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/2548385645/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2548385645?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>230,314,727,780,784,864,885,2100,25751,27922,27923,37010,37011,44588,53789,53791,74896</link.rule.ids><backlink>$$Uhttps://centralesupelec.hal.science/hal-02940461$$DView record in HAL$$Hfree_for_read</backlink><backlink>$$Uhttps://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-258060$$DView record from Swedish Publication Index$$Hfree_for_read</backlink></links><search><creatorcontrib>Bassi, Germán</creatorcontrib><creatorcontrib>Piantanida, Pablo</creatorcontrib><creatorcontrib>Shamai (Shitz), Shlomo</creatorcontrib><title>The Secret Key Capacity of a Class of Noisy Channels with Correlated Sources</title><title>Entropy (Basel, Switzerland)</title><description>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.</description><subject>Communication</subject><subject>Correlated Sources</subject><subject>Electronic surveillance</subject><subject>Engineering Sciences</subject><subject>Information-Theoretic Security</subject><subject>Secret Key Agreement</subject><subject>Secret Key Capacity</subject><subject>Wiretap Channel</subject><subject>Wiretapping</subject><issn>1099-4300</issn><issn>1099-4300</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><sourceid>DOA</sourceid><recordid>eNpdUk1vEzEQXSEQLS0H_sFKXOCw1N9rX5CiLdCqET004mp5vePuhs062E6r_HucpCqkJ49m3nvzxjNF8QGjL5QqdAEEI4lqSl4VpxgpVTGK0Ov_4pPiXYxLhAglWLwtTiglomZMnBbzRQ_lHdgAqbyBbdmYtbFD2pbelaZsRhPjLvzph5iLvZkmGGP5OKS-bHwIMJoEXXnnN8FCPC_eODNGeP_0nhWL798WzVU1v_1x3czmleVYpsq4tmaEKNpR5VrMuZUdVlII1nV1jayUSqi2EzW3SLXUckOZIkpxSRUTmJ4V1wfZzpulXodhZcJWezPofcKHe21CGuwIGpBDRBlpbJep1EhKVGupIA64E45kreqgFR9hvWmP1C6HX7O92u_Ua8IlEijjvx7wGbyCzsKUghmPaMeVaej1vX_QNcec7M1_Pgj0L2hXs7ne5bJfhvKYDzvsp6dmwf_ZQEx6NUQL42gm8JuoCRMif5jCIkM_voAu806mvIXsnEkquWD8X3MbfIwB3LMDjPTulPTzKdG_1GO2Iw</recordid><startdate>20190726</startdate><enddate>20190726</enddate><creator>Bassi, Germán</creator><creator>Piantanida, Pablo</creator><creator>Shamai (Shitz), Shlomo</creator><general>MDPI AG</general><general>MDPI</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7TB</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>HCIFZ</scope><scope>KR7</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>7X8</scope><scope>1XC</scope><scope>VOOES</scope><scope>5PM</scope><scope>ADTPV</scope><scope>AFDQA</scope><scope>AOWAS</scope><scope>D8T</scope><scope>D8V</scope><scope>ZZAVC</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0002-6594-3371</orcidid><orcidid>https://orcid.org/0000-0002-8974-6591</orcidid><orcidid>https://orcid.org/0000-0002-8717-2117</orcidid></search><sort><creationdate>20190726</creationdate><title>The Secret Key Capacity of a Class of Noisy Channels with Correlated Sources</title><author>Bassi, Germán ; Piantanida, Pablo ; Shamai (Shitz), Shlomo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c518t-afb742293d39fb155c8d198664dd770c88969bd675c09b3c5a34929958394613</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Communication</topic><topic>Correlated Sources</topic><topic>Electronic surveillance</topic><topic>Engineering Sciences</topic><topic>Information-Theoretic Security</topic><topic>Secret Key Agreement</topic><topic>Secret Key Capacity</topic><topic>Wiretap Channel</topic><topic>Wiretapping</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bassi, Germán</creatorcontrib><creatorcontrib>Piantanida, Pablo</creatorcontrib><creatorcontrib>Shamai (Shitz), Shlomo</creatorcontrib><collection>CrossRef</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>SciTech Premium Collection</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>MEDLINE - Academic</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><collection>PubMed Central (Full Participant titles)</collection><collection>SwePub</collection><collection>SWEPUB Kungliga Tekniska Högskolan full text</collection><collection>SwePub Articles</collection><collection>SWEPUB Freely available online</collection><collection>SWEPUB Kungliga Tekniska Högskolan</collection><collection>SwePub Articles full text</collection><collection>Directory of Open Access Journals</collection><jtitle>Entropy (Basel, Switzerland)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bassi, Germán</au><au>Piantanida, Pablo</au><au>Shamai (Shitz), Shlomo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The Secret Key Capacity of a Class of Noisy Channels with Correlated Sources</atitle><jtitle>Entropy (Basel, Switzerland)</jtitle><date>2019-07-26</date><risdate>2019</risdate><volume>21</volume><issue>8</issue><spage>732</spage><pages>732-</pages><issn>1099-4300</issn><eissn>1099-4300</eissn><abstract>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.</abstract><cop>Basel</cop><pub>MDPI AG</pub><pmid>33267446</pmid><doi>10.3390/e21080732</doi><orcidid>https://orcid.org/0000-0002-6594-3371</orcidid><orcidid>https://orcid.org/0000-0002-8974-6591</orcidid><orcidid>https://orcid.org/0000-0002-8717-2117</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1099-4300
ispartof Entropy (Basel, Switzerland), 2019-07, Vol.21 (8), p.732
issn 1099-4300
1099-4300
language eng
recordid cdi_doaj_primary_oai_doaj_org_article_e0f029a8acd9463a8329bc362fe5f6f2
source Publicly Available Content Database; PubMed Central; Directory of Open Access Journals
subjects Communication
Correlated Sources
Electronic surveillance
Engineering Sciences
Information-Theoretic Security
Secret Key Agreement
Secret Key Capacity
Wiretap Channel
Wiretapping
title The Secret Key Capacity of a Class of Noisy Channels with Correlated Sources
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T20%3A31%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_doaj_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20Secret%20Key%20Capacity%20of%20a%20Class%20of%20Noisy%20Channels%20with%20Correlated%20Sources&rft.jtitle=Entropy%20(Basel,%20Switzerland)&rft.au=Bassi,%20Germ%C3%A1n&rft.date=2019-07-26&rft.volume=21&rft.issue=8&rft.spage=732&rft.pages=732-&rft.issn=1099-4300&rft.eissn=1099-4300&rft_id=info:doi/10.3390/e21080732&rft_dat=%3Cproquest_doaj_%3E2466770916%3C/proquest_doaj_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c518t-afb742293d39fb155c8d198664dd770c88969bd675c09b3c5a34929958394613%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2548385645&rft_id=info:pmid/33267446&rfr_iscdi=true