On Covert Communication Against Sequential Change-Point Detection
We investigate covert communication under a sequential change-point detection (SCPD) framework, where a transmitter, Alice, attempts to communicate reliably with a receiver, Bob, over an additive white Gaussian noise channel, while simultaneously ensuring covertness (low probability of detection) wi...
Saved in:
| Published in: | IEEE transactions on information theory Vol. 67; no. 11; pp. 7285 - 7303 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.11.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 0018-9448, 1557-9654 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We investigate covert communication under a sequential change-point detection (SCPD) framework, where a transmitter, Alice, attempts to communicate reliably with a receiver, Bob, over an additive white Gaussian noise channel, while simultaneously ensuring covertness (low probability of detection) with respect to an adversary, Willie. Different from the binary hypothesis test based detection framework considered in prior works where Willie collects all signal samples together and makes a decision in a batch manner, we view Willie's detection process as an SCPD process that works in a real-time manner. We establish a new criterion to evaluate the covertness of the communication between Alice and Bob, and investigate the performance of covert communication accordingly. Subject to the proposed constraint on covertness, we investigate the feasible transmit power and transmission duration under three SCPD algorithms, namely, the Shewhart test, the finite moving average chart (FMAC), and the cumulative sum (CUSUM) test, and characterize how the covert communication throughput scales with the average run length to false alarm (ARL2FA) of Willie's detector as the ARL2FA increases without bound. Our theoretical results can be viewed as upper bounds on the covert communication throughput that can be achieved, and we show that compared with the case where Willie performs the CUSUM test, Alice and Bob achieve a higher covert communication throughput if Willie performs the Shewhart test or the FMAC. |
|---|---|
| AbstractList | We investigate covert communication under a sequential change-point detection (SCPD) framework, where a transmitter, Alice, attempts to communicate reliably with a receiver, Bob, over an additive white Gaussian noise channel, while simultaneously ensuring covertness (low probability of detection) with respect to an adversary, Willie. Different from the binary hypothesis test based detection framework considered in prior works where Willie collects all signal samples together and makes a decision in a batch manner, we view Willie's detection process as an SCPD process that works in a real-time manner. We establish a new criterion to evaluate the covertness of the communication between Alice and Bob, and investigate the performance of covert communication accordingly. Subject to the proposed constraint on covertness, we investigate the feasible transmit power and transmission duration under three SCPD algorithms, namely, the Shewhart test, the finite moving average chart (FMAC), and the cumulative sum (CUSUM) test, and characterize how the covert communication throughput scales with the average run length to false alarm (ARL2FA) of Willie's detector as the ARL2FA increases without bound. Our theoretical results can be viewed as upper bounds on the covert communication throughput that can be achieved, and we show that compared with the case where Willie performs the CUSUM test, Alice and Bob achieve a higher covert communication throughput if Willie performs the Shewhart test or the FMAC. |
| Author | Wang, Hui-Ming Poor, H. Vincent Huang, Ke-Wen |
| Author_xml | – sequence: 1 givenname: Ke-Wen orcidid: 0000-0002-6223-6153 surname: Huang fullname: Huang, Ke-Wen email: xjtu-huangkw@outlook.com organization: School of Information and Communications Engineering and the Ministry of Education Key Laboratory for Intelligent Networks and Network Security, Xi'an Jiaotong University, Xi'an, China – sequence: 2 givenname: Hui-Ming orcidid: 0000-0003-4107-9512 surname: Wang fullname: Wang, Hui-Ming email: xjbswhm@gmail.com organization: School of Information and Communications Engineering and the Ministry of Education Key Laboratory for Intelligent Networks and Network Security, Xi'an Jiaotong University, Xi'an, China – sequence: 3 givenname: H. Vincent orcidid: 0000-0002-2062-131X surname: Poor fullname: Poor, H. Vincent email: poor@princeton.edu organization: Department of Electrical and Computer Engineering, Princeton University, Princeton, NJ, USA |
| BookMark | eNp9kE1LAzEQhoNUsK3eBS8LnrfO5Gs3x1K_CoUK1nPIptma0mZrNhX8925t8eDB0zDwPvMOz4D0QhMcIdcII0RQd4vpYkSB4oghcAl4RvooRJErKXiP9AGwzBXn5QUZtO26W7lA2ifjecgmzaeLqRvb7T54a5JvQjZeGR_alL26j70LyZtNNnk3YeXyl8aHlN275OwheUnOa7Np3dVpDsnb48Ni8pzP5k_TyXiWW6ow5byoC0mtUFzWki4lMCOFk-AoLwxgZZaiclBYiVKqZYm2MIpSNIxLTiuo2JDcHu_uYtO91Ca9bvYxdJWaipJJpiinXQqOKRubto2u1rvotyZ-aQR9EKU7UfogSp9EdYj8g1iffiSkaPzmP_DmCHrn3G-PEsgoB_YNc_V1cw |
| CODEN | IETTAW |
| CitedBy_id | crossref_primary_10_1109_COMST_2023_3263921 crossref_primary_10_1109_TCOMM_2023_3237998 |
| Cites_doi | 10.1109/TCOMM.2020.2969416 10.1109/JSAC.2013.130923 10.1093/biomet/41.1-2.100 10.1109/TIT.2016.2548471 10.1109/SPAWC.2018.8445896 10.1109/LCOMM.2015.2507594 10.1109/ISITA.2008.4895424 10.1007/978-0-387-87835-5 10.1214/aos/1176350164 10.1080/07474946.2013.774621 10.2307/3214131 10.1109/TIT.1975.1055346 10.1109/TWC.2016.2614502 10.1109/TWC.2017.2720736 10.1109/JSTSP.2015.2421477 10.1109/ISIT.2014.6874904 10.1137/1.9781611970302 10.1109/TIT.2017.2679057 10.1109/ISIT.2019.8849341 10.1109/TIT.2018.2878526 10.1214/aos/1176347887 10.1109/TIT.2016.2530089 10.1080/07474946.2014.916927 10.1214/aos/1176349142 10.1109/ITW.2016.7606822 10.1109/CNS.2017.8228657 10.1109/MCOM.2015.7355562 10.1080/00401706.1985.10488031 10.1080/07474946.2012.719443 10.1109/TSP.2017.2788416 10.1214/aoms/1177693055 10.1214/aoms/1177698701 10.1109/TIFS.2018.2818650 10.1109/ISIT.2019.8849248 10.1109/ISIT.2013.6620765 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021 |
| DBID | 97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/TIT.2021.3104601 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE/IET Electronic Library CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1557-9654 |
| EndPage | 7303 |
| ExternalDocumentID | 10_1109_TIT_2021_3104601 9513240 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Innovation Team Research Fund of Shaanxi Province grantid: 2019TD-013 – fundername: National Natural Science Foundation of China grantid: 61941118; 62171364 funderid: 10.13039/501100001809 |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c291t-47f762c5946f62d603a65e60e247a01bad5be07c61669d81c7a9221a34642b0b3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 8 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000709078200024&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0018-9448 |
| IngestDate | Mon Jun 30 06:08:30 EDT 2025 Sat Nov 29 03:31:46 EST 2025 Tue Nov 18 22:18:25 EST 2025 Wed Aug 27 02:26:09 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 11 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c291t-47f762c5946f62d603a65e60e247a01bad5be07c61669d81c7a9221a34642b0b3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-2062-131X 0000-0002-6223-6153 0000-0003-4107-9512 |
| PQID | 2583639242 |
| PQPubID | 36024 |
| PageCount | 19 |
| ParticipantIDs | crossref_primary_10_1109_TIT_2021_3104601 crossref_citationtrail_10_1109_TIT_2021_3104601 ieee_primary_9513240 proquest_journals_2583639242 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-11-01 |
| PublicationDateYYYYMMDD | 2021-11-01 |
| PublicationDate_xml | – month: 11 year: 2021 text: 2021-11-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on information theory |
| PublicationTitleAbbrev | TIT |
| PublicationYear | 2021 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref35 ref13 ref34 ref12 ref37 ref15 ref36 ref14 ref31 ref30 ref33 ref11 ref32 ref10 ref2 ref1 ref19 ref18 tartakovsky (ref16) 2013 ref24 ref23 ref26 ref25 ref20 ref22 ref21 ref28 ref27 ref29 ref8 ref7 ref9 ref4 ref3 ref6 ref5 poor (ref17) 2009 |
| References_xml | – ident: ref27 doi: 10.1109/TCOMM.2020.2969416 – ident: ref2 doi: 10.1109/JSAC.2013.130923 – ident: ref22 doi: 10.1093/biomet/41.1-2.100 – ident: ref4 doi: 10.1109/TIT.2016.2548471 – ident: ref11 doi: 10.1109/SPAWC.2018.8445896 – ident: ref12 doi: 10.1109/LCOMM.2015.2507594 – ident: ref25 doi: 10.1109/ISITA.2008.4895424 – ident: ref30 doi: 10.1007/978-0-387-87835-5 – ident: ref24 doi: 10.1214/aos/1176350164 – ident: ref20 doi: 10.1080/07474946.2013.774621 – ident: ref32 doi: 10.2307/3214131 – ident: ref18 doi: 10.1109/TIT.1975.1055346 – ident: ref14 doi: 10.1109/TWC.2016.2614502 – ident: ref8 doi: 10.1109/TWC.2017.2720736 – ident: ref7 doi: 10.1109/JSTSP.2015.2421477 – ident: ref13 doi: 10.1109/ISIT.2014.6874904 – ident: ref31 doi: 10.1137/1.9781611970302 – ident: ref34 doi: 10.1109/TIT.2017.2679057 – ident: ref19 doi: 10.1109/ISIT.2019.8849341 – ident: ref6 doi: 10.1109/TIT.2018.2878526 – ident: ref21 doi: 10.1214/aos/1176347887 – year: 2009 ident: ref17 publication-title: Quickest Detection – ident: ref5 doi: 10.1109/TIT.2016.2530089 – ident: ref36 doi: 10.1080/07474946.2014.916927 – year: 2013 ident: ref16 publication-title: Sequential Analysis Hypothesis Testing and Change-Point Detection – ident: ref26 doi: 10.1214/aos/1176349142 – ident: ref15 doi: 10.1109/ITW.2016.7606822 – ident: ref10 doi: 10.1109/CNS.2017.8228657 – ident: ref1 doi: 10.1109/MCOM.2015.7355562 – ident: ref29 doi: 10.1080/00401706.1985.10488031 – ident: ref33 doi: 10.1080/07474946.2012.719443 – ident: ref35 doi: 10.1109/TSP.2017.2788416 – ident: ref23 doi: 10.1214/aoms/1177693055 – ident: ref28 doi: 10.1214/aoms/1177698701 – ident: ref9 doi: 10.1109/TIFS.2018.2818650 – ident: ref37 doi: 10.1109/ISIT.2019.8849248 – ident: ref3 doi: 10.1109/ISIT.2013.6620765 |
| SSID | ssj0014512 |
| Score | 2.4187922 |
| Snippet | We investigate covert communication under a sequential change-point detection (SCPD) framework, where a transmitter, Alice, attempts to communicate reliably... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 7285 |
| SubjectTerms | Algorithms Communication Communication system security Covert communication Detectors False alarms low probability of detection communication Random noise Security sequential change-point detection Surveillance Throughput Transmitters Upper bounds Wireless communication |
| Title | On Covert Communication Against Sequential Change-Point Detection |
| URI | https://ieeexplore.ieee.org/document/9513240 https://www.proquest.com/docview/2583639242 |
| Volume | 67 |
| WOSCitedRecordID | wos000709078200024&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 | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE/IET Electronic Library customDbUrl: eissn: 1557-9654 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014512 issn: 0018-9448 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH5sw4MenG6K0yk5eBGsa9I0aY5DHXqZAyfsVtI0lcHoZOv8-03SrjgUwVsOSSnv5SXfl_cL4NowHcMbNPOiNJKGoATakzSMPJ-RRHKWyiDLXLMJPh5Hs5mYNOC2zoXRWrvgM31nh86Xny7Vxj6VDQwasPXjmtDknJW5WrXHgIa4rAyOjQEbzrF1SfpiMH2eGiJIsOGn1g2Id64g11Plx0HsbpdR-3__dQSHFYpEw1Ltx9DQeQfa2w4NqDLYDhx8KzfYheFLju5tyGaBdvJC0PBdzg1MRK8urtrY_AKVWQfeZDnPC_SgCxexlZ_A2-hxev_kVS0UPEUELjzKM3PaqVBQljGSMj-QLNTM14Ry6eNEpmGifa4YZkykEVZcCkKwDKjhJYmfBKfQype5PgOUqSANlA4zoSUVJBVJlBk0wBXliVQR7cFgK9VYVfXFbZuLRex4hi9io4fY6iGu9NCDm3rFR1lb44-5XSv3el4l8h70t4qLK-NbxySMAgO8DPg4_33VBezbb5cphX1oFauNvoQ99VnM16srt6--ACZqyNk |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFH_oFNSD8xPnZw5eBOuSNE2b41CHwzkHTvBW0jSVwehk6_z7TdJuOBTBWw4JLe_lJb9f3hfApWE6hjdo7kVpJA1B8bUnWRB5mNNEhjyVfpa5ZhNhrxe9vYn-ClwvcmG01i74TN_YofPlp2M1s09lTYMGbP24VVgLGKO4zNZa-AxYQMra4MSYsGEdc6ckFs1BZ2CoICWGoVpHIFm6hFxXlR9Hsbtf2vX__dkObFc4ErVKxe_Cis73oD7v0YAqk92DrW8FB_eh9ZyjWxu0WaClzBDUepdDAxTRi4usNlY_QmXegdcfD_MC3enCxWzlB_Davh_cPnhVEwVPUUEKj4WZOe9UIBjPOE059iUPNMeaslBiksg0SDQOFSecizQiKpSCUiJ9ZphJghP_EGr5ONdHgDLlp77SQSa0ZIKmIokygwdCxcJEqog1oDmXaqyqCuO20cUodkwDi9joIbZ6iCs9NOBqseKjrK7xx9x9K_fFvErkDTidKy6uzG8a0yDyDfQy8OP491UXsPEweOrG3U7v8QQ27XfKBMNTqBWTmT6DdfVZDKeTc7fHvgDFLswg |
| 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%3Ajournal&rft.genre=article&rft.atitle=On+Covert+Communication+Against+Sequential+Change-Point+Detection&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Huang%2C+Ke-Wen&rft.au=Wang%2C+Hui-Ming&rft.au=Poor%2C+H.+Vincent&rft.date=2021-11-01&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=67&rft.issue=11&rft.spage=7285&rft.epage=7303&rft_id=info:doi/10.1109%2FTIT.2021.3104601&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TIT_2021_3104601 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon |