The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
What Physical Layer Security Can Do for 6G Security
Open accessAbstract
While existing security protocols were designed with a focus on the core network, the enhancement of the security of the B5G access network becomes of critical importance. Despite the strengthening of 5G security protocols with respect to LTE, there are still open issues that have not been fully addressed. This work is articulated around the premise that rethinking the security design bottom up, starting at the physical layer, is not only viable in 6G but importantly, arises as an efficient way to overcome security hurdles in novel use cases, notably massive machine type communications (mMTC), ultra reliable low latency communications (URLLC) and autonomous cyberphysical systems. Unlike existing review papers that treat physical layer security orthogonally to cryptography, we will try to provide a few insights of underlying connections. Discussing many practical issues, we will present a comprehensive review of the state-of the-art in i) secret key generation from shared randomness, ii) the wiretap channels and fundamental limits, iii) authentication of devices using physical unclonable functions (PUFs), localization and multi-factor authentication, and, iv) jamming attacks at the physical layer. We finally conclude with the proposers' aspirations for the 6G security landscape, in the hyper-connectivity and semantic communications era.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Employing hardware-level security measures, such as the integration of secure enclaves and tamper-resistant modules, fortifies the security posture of the hardware infrastructure.
“These practical implementations serve as effective countermeasures to fortify the security posture of the hardware infrastructure, ensuring a resilient and protected environment for V2X communication.”
From Towards 6G V2X Sidelink: Survey of Resource Allocation—Mathematical Formulations, Challenges, and Proposed Solutions (2024) · cites this paper as [142]
Citations
Cites
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“A revolutionizing result in security was presented by Shannon in 1949 [15], when he demonstrated that perfect secrecy can be achieved if and only if (iff) the entropy of the secret key is greater or equal to the entropy of the plaintext.”
Background
Flagged first, then by citations
Research works printed but not linked: 26
- 10.1017/CBO9780511977985 · DOI
- 10.1109/ACCESS.2021.3120143 · DOI
- 2022, Security and privacy, 30
- 10.1109/TCOMM.2019.2945792 · DOI
- 10.1109/JIOT.2021.3114270 · DOI
- 10.1109/MCOMSTD.0001.2000082 · DOI
- 10.1109/GLOBECOM38437.2019.9013816 · DOI
- 10.1109/TIFS.2017.2713342 · DOI
- 10.1109/TIFS.2013.2286269 · DOI
- 10.1109/ACCESS.2022.3187967 · DOI
- 10.1002/spy2.11 · DOI
- 10.1002/j.1538-7305.1975.tb02040.x · DOI
- 10.1073/pnas.1618130114 · DOI
- 10.1109/TIT.2008.921678 · DOI
- 10.1109/TIT.2010.2043769 · DOI
- 10.1109/TIT.2019.2904500 · DOI
- 10.1109/MSP.2018.2841410 · DOI
- 10.1109/TSG.2012.2211046 · DOI
- 10.1109/JSAC.2013.130715 · DOI
- 10.1049/iet-stg.2020.0055 · DOI
- 10.1109/JSTSP.2015.2427775 · DOI
- 10.1109/18.476316 · DOI
- 10.1109/TIT.2015.2457926 · DOI
- 10.1109/SSP49050.2021.9513785 · DOI
- 10.1109/GLOBECOM38437.2019.9013809 · DOI
- 10.1186/s13638-020-01742-0 · DOI
Cited by
Sorted by citations
Annu, & Rajalakshmi, P. (2024) · IEEE Open Journal of Vehicular Technology · doi:10.1109/ojvt.2024.3368240 · Cited by 73
Metadata
- Authors
- Mitev, M., Chorti, A., Poor, H. V., & Fettweis, G. P.
- Affiliations
- Barkhausen Institut (DE)
- Princeton University (US)
- Venue
- IEEE Open Journal of Vehicular Technology
- Published
- 2023
- Volume
- 4
- Pages
- 375-388
- ISSN
- 2644-1330 (ISSN-L)
- OpenAlex
- W4321609174
- Cited by
- 184
- References
- 1
- Citations by year
- 2026: 48 · 2025: 67 · 2024: 53 · 2023: 16
- FWCI
- 13.67
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- IEEE Open Journal of Vehicular Technology (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- HAL (submittedVersion, other-oa)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University) (cc-by)
- Funders
- Saxon State Parliament
- National Science Foundation (CCF-1908308, CNS-2128448)
- Topics
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Wireless Communication Security Techniques
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Computer Networks and Communications › Cybersecurity and Information Systems
- Keywords
- physical layer security, 6G security, secret key generation, shared randomness, wiretap channel, physical unclonable functions, device authentication, localization, multi-factor authentication, jamming attacks, massive machine-type communications, ultra-reliable low-latency communication, semantic communication
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review