Empirical Bounds on the Rate of Secret Bits Extracted from Received Signal Strength
Symmetric cryptography relies on pairs of identical secret keys shared by the legitimate communicating parties. To implement a symmetric-key algorithm for cryptography, a major concern is to develop secure methods for distribution of the secret key. In securing the wireless fading channels by symmet...
Uloženo v:
| Vydáno v: | 2019 53rd Annual Conference on Information Sciences and Systems (CISS) s. 1 - 6 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.03.2019
|
| Témata: | |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Symmetric cryptography relies on pairs of identical secret keys shared by the legitimate communicating parties. To implement a symmetric-key algorithm for cryptography, a major concern is to develop secure methods for distribution of the secret key. In securing the wireless fading channels by symmetric-key algorithms, the physical layer properties of the channel can be exploited for distribution of the secret keys. In this approach, the channel state provides a common randomness which is shared by the legitimate users but is mostly unknown to an eavesdropper. by means of signal processing techniques, this common randomness is extracted into random secret keys. This paper establishes an information theoretic upper bound on the rate at which the secret keys can be extracted. Instead of the conventional approach that relies on mathematical models for the wireless channel, this paper adopts an experimental approach to estimate this bound from empirical data. A set of signal processing techniques is developed here to numerically estimate this bound for a pair of received signal strength (RSS) recorded by indoor commercial radios. |
|---|---|
| AbstractList | Symmetric cryptography relies on pairs of identical secret keys shared by the legitimate communicating parties. To implement a symmetric-key algorithm for cryptography, a major concern is to develop secure methods for distribution of the secret key. In securing the wireless fading channels by symmetric-key algorithms, the physical layer properties of the channel can be exploited for distribution of the secret keys. In this approach, the channel state provides a common randomness which is shared by the legitimate users but is mostly unknown to an eavesdropper. by means of signal processing techniques, this common randomness is extracted into random secret keys. This paper establishes an information theoretic upper bound on the rate at which the secret keys can be extracted. Instead of the conventional approach that relies on mathematical models for the wireless channel, this paper adopts an experimental approach to estimate this bound from empirical data. A set of signal processing techniques is developed here to numerically estimate this bound for a pair of received signal strength (RSS) recorded by indoor commercial radios. |
| Author | Azizi, Sima Komaee, Arash |
| Author_xml | – sequence: 1 givenname: Sima surname: Azizi fullname: Azizi, Sima email: sima.azizi@siu.edu organization: Department of Electrical and Computer Engineering, Southern Illinois University, Carbondale, IL, 62901, USA – sequence: 2 givenname: Arash surname: Komaee fullname: Komaee, Arash email: akomaee@siu.edu@siu.edu organization: Department of Electrical and Computer Engineering, Southern Illinois University, Carbondale, IL, 62901, USA |
| BookMark | eNotj81KAzEURiPYha19AHGTF5gxdzI_maUdRi0UhKYLdyVNbtpAJymZKPr2DrSrw7c5fGdO7n3wSMgTsByAtS_dWsq8YNDmom45K8QdmUNTCACo4OuByH64uOi0OtNV-PZmpMHTdEK6VQlpsFSijpjoyqWR9r8pKp3QUBvDQLeo0f1MS7qjnwQyRfTHdHokM6vOIy5vXJDdW7_rPrLN5_u6e91kDpoqZbpsVVUWXJVQWWsaJg4GuQGOwpS20MZOdw2WrGaV4A1Tda10rfkBuAUQfEGer1qHiPtLdIOKf_tbJv8HAqBMDA |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/CISS.2019.8693028 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 172811151X 9781728111513 |
| EndPage | 6 |
| ExternalDocumentID | 8693028 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-i175t-c49a5423a415ffd708bde3d13e8d4f2cdf028de406058370a66ac6c3b13f1183 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000493551600081&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Thu Jun 29 18:38:06 EDT 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i175t-c49a5423a415ffd708bde3d13e8d4f2cdf028de406058370a66ac6c3b13f1183 |
| PageCount | 6 |
| ParticipantIDs | ieee_primary_8693028 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-March |
| PublicationDateYYYYMMDD | 2019-03-01 |
| PublicationDate_xml | – month: 03 year: 2019 text: 2019-March |
| PublicationDecade | 2010 |
| PublicationTitle | 2019 53rd Annual Conference on Information Sciences and Systems (CISS) |
| PublicationTitleAbbrev | CISS |
| PublicationYear | 2019 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.6853086 |
| Snippet | Symmetric cryptography relies on pairs of identical secret keys shared by the legitimate communicating parties. To implement a symmetric-key algorithm for... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Communication system security Cryptography Fading channels Mutual information mutual information rate secret key Stochastic processes symmetric-key algorithm Transceivers Wireless communication wireless fading channel |
| Title | Empirical Bounds on the Rate of Secret Bits Extracted from Received Signal Strength |
| URI | https://ieeexplore.ieee.org/document/8693028 |
| WOSCitedRecordID | wos000493551600081&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEA1t8eBJpRW_ycGja3c32XxcW1oUpBS3h97KbjKpe3C3tKn4802yRRG8eAshkDAJeS-ZmTcI3RPIpNRKRBk1MqJATCQN8KhQPFWGMkHKoDP7wmczsVzKeQc9fOfCAEAIPoNH3wy-fN2ovf8qGwpfty8VXdTlnLW5WgdHZRLL4fg5z32sltv8dtyvgikBL6Yn_5vpFA1-Eu_w_BtSzlAH6j7KJ--bKih54JEvgrTDTY0db8OvjifixuDcUz-LR5Xd4cmnDQLMGvvEEexYIbj7TOO8Wrsjg70Tul7btwFaTCeL8VN0qIUQVQ7gbaSoLDJHfQoHuMZoHotSA9EJAaGpSZU2brkaHDzHmdezKRgrFFOkTIhxbwhyjnp1U8MFwjp1bypFmFAsprwESSFVcVK4flMmurxEfW-P1aZVu1gdTHH1d_c1OvYmb6OyblDPbvdwi47Uh61227uwRV-mDJUU |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH5BNNGTGjD-tgePTra129orBAIRCXEcuJGtfcUd3AgM459vuxGMiRdvTdOkzWvT72vfe98DeKQYCKEkdwKmhcOQakdojJxERr7ULOQ0rXRmx9FkwudzMW3A0z4XBhGr4DN8ts3Kl68KubVfZR1u6_b5_AAOA8Z8t87W2rkqPVd0eqM4ttFaZvvrkb9KplSIMTj931xn0P5JvSPTPaicQwPzFsT9j1VWaXmQri2DtCFFTgxzI2-GKZJCk9iSv5J0s3JD-l9lJcGsiE0dIYYXornRFImzpTk0xLqh82X53obZoD_rDZ1dNQQnMxBfOpKJJDDkJzGQq7WKXJ4qpMqjyBXTvlTaLFehAWg3sIo2SRgmMpQ09ag2rwh6Ac28yPESiPLNq0rSkMvQZVGKgqEvXS8x_Tr1VHoFLWuPxarWu1jsTHH9d_cDHA9nr-PFeDR5uYETa_46RusWmuV6i3dwJD_LbLO-r7brG5Z7mFs |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2019+53rd+Annual+Conference+on+Information+Sciences+and+Systems+%28CISS%29&rft.atitle=Empirical+Bounds+on+the+Rate+of+Secret+Bits+Extracted+from+Received+Signal+Strength&rft.au=Azizi%2C+Sima&rft.au=Komaee%2C+Arash&rft.date=2019-03-01&rft.pub=IEEE&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FCISS.2019.8693028&rft.externalDocID=8693028 |