Physical Layer Security for Ultra-Reliable and Low-Latency Communications

Chunhui Li; Jinhong Yuan; Riqing Chen; Robert Malaney; Shihao Yan

arxiv: 1906.08443 · v1 · pith:KIFHJRP7new · submitted 2019-06-20 · 💻 cs.IT · cs.CR· math.IT

Physical Layer Security for Ultra-Reliable and Low-Latency Communications

Riqing Chen , Chunhui Li , Shihao Yan , Robert Malaney , Jinhong Yuan This is my paper

Pith reviewed 2026-05-25 19:38 UTC · model grok-4.3

classification 💻 cs.IT cs.CRmath.IT

keywords physical layer securityultra-reliable low-latency communicationsURLLCwireless securitychannel state informationsecrecy metrics

0 comments

The pith

Physical layer security uses wireless channel randomness to secure URLLC with lower complexity and latency than cryptography.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This review paper examines physical layer security as a way to protect ultra-reliable and low-latency communications in future wireless networks. It defines metrics that quantify the necessary tradeoffs among latency, reliability, and secrecy levels. The authors outline the main technical obstacles to combining these goals and explain how channel state information can help overcome them. They close with suggested paths for further work. A reader would care because conventional encryption adds processing delays that clash with URLLC timing constraints.

Core claim

The paper states that physical layer security, which relies on transmission designs exploiting the intrinsic randomness of the wireless medium, achieves secrecy at lower complexity and with less added latency than traditional cryptography, and therefore merits investigation for URLLC; to support this it supplies appropriate performance metrics, identifies key challenges, discusses the potential role of channel state information, and recommends future research directions.

What carries the argument

Physical layer security technique that uses transmission designs based on the intrinsic randomness of the wireless medium to achieve secrecy.

If this is right

Metrics that jointly track latency, reliability, and secrecy become necessary for evaluating PLS designs in URLLC.
Channel state information can be leveraged to address the identified challenges in achieving PLS for URLLC.
Future research should target the specific open problems highlighted for PLS in the URLLC setting.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

If PLS meets the URLLC targets, network schedulers could allocate fewer resources to encryption overhead and more to data transmission.
The tradeoff metrics could be used to compare PLS against lightweight cryptography in standardized URLLC test scenarios.
Channel state information requirements identified here may drive new pilot design rules in 5G-Advanced or 6G specifications.

Load-bearing premise

Transmission designs based on the intrinsic randomness of the wireless medium can achieve secrecy while simultaneously satisfying the strict latency and reliability targets of URLLC.

What would settle it

A concrete demonstration that no transmission design exploiting wireless-medium randomness can simultaneously meet URLLC latency bounds, reliability targets, and a positive secrecy rate would falsify the central premise.

Figures

Figures reproduced from arXiv: 1906.08443 by Chunhui Li, Jinhong Yuan, Riqing Chen, Robert Malaney, Shihao Yan.

**Figure 2.** Figure 2: Error probability ǫ versus channel coding rate R for different values of the finite blocklength n. capacity is defined as the supremum of the code rate (i.e., the information rate) that can achieve weak secrecy (against a passive Eve) as a function of wiretap channel parameters, while guaranteeing an arbitrarily low error probability at Bob [7]. As such, this secrecy capacity cannot be used as a metric for… view at source ↗

**Figure 4.** Figure 4: Challenging problems and potential solutions on CSI [PITH_FULL_IMAGE:figures/full_fig_p004_4.png] view at source ↗

read the original abstract

Ultra-reliable and low-latency communication (URLLC) is one category of service to be provided by next-generation wireless networks. Motivated by increasing security concerns in such networks, this article focuses on physical layer security (PLS) in the context of URLLC. The PLS technique mainly uses transmission designs based on the intrinsic randomness of the wireless medium to achieve secrecy. As such, PLS is of lower complexity and incurs less latency than traditional cryptography. In this article, we first introduce appropriate performance metrics for evaluating PLS in URLLC, illustrating the tradeoff between latency, reliability, and security. We then identify the key challenging problems for achieving PLS for URLLC, and discuss the role that channel state information can have in providing potential solutions to these problems. Finally, we present our recommendations on future research directions in this emerging area.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This is a survey that maps existing PLS ideas onto URLLC but asserts lower latency without any overhead accounting or comparison.

read the letter

This survey collects known ideas on physical layer security for ultra-reliable low-latency communications and organizes them around suitable metrics and open problems. It does not contain new derivations, techniques, or data. What it does reasonably well is lay out performance metrics that make the latency-reliability-security tradeoffs explicit and then walk through the main challenges, with particular attention to how channel state information can either enable or obstruct secrecy under tight timing constraints. The future-directions section is a straightforward list of gaps that follows from the challenges already identified. The soft spot is the repeated claim that PLS incurs lower complexity and latency than cryptography. The text states this as a general advantage but supplies no end-to-end latency budget that includes CSI acquisition, feedback, or artificial-noise generation, nor any numerical comparison against cryptographic alternatives at the sub-millisecond and 10^-5 error-rate targets that define URLLC. The stress-test note is accurate on this point; the assumption stays unexamined. Readers who need a compact entry point to the intersection of these two topics will get value from the overview and the cited references. Specialists already active in either area will not find new technical substance. The paper shows clear organization of the literature and honest identification of open issues, so it counts as serious engagement even though it is not a research contribution. I would bring it to a reading group only if the group is specifically looking at security for URLLC-type services. I would not cite it in my own work. A serious editor should send it to peer review if the venue accepts survey articles on emerging 5G/6G topics, with the understanding that referees will likely request more quantitative grounding on the latency claim.

Referee Report

3 major / 0 minor

Summary. The paper surveys physical layer security (PLS) for ultra-reliable low-latency communications (URLLC). It asserts that transmission designs exploiting wireless-medium randomness achieve secrecy with lower complexity and latency than cryptography. The manuscript introduces performance metrics to illustrate latency-reliability-security tradeoffs, identifies key challenges (with emphasis on channel state information), and offers recommendations for future research directions.

Significance. If the central motivation holds, the survey would usefully frame open problems at the intersection of PLS and URLLC. It receives credit for explicitly naming CSI acquisition as a central tension and for outlining qualitative tradeoffs. No machine-checked proofs, reproducible code, or falsifiable quantitative predictions are supplied.

major comments (3)

[Abstract / §1] Abstract and opening paragraphs: the claim that PLS 'is of lower complexity and incurs less latency than traditional cryptography' is load-bearing for the paper's motivation yet is advanced without any end-to-end latency budget that accounts for CSI estimation, feedback, or artificial-noise generation under URLLC targets (sub-ms latency, 10^{-5} reliability).
[Performance metrics] Performance-metrics section: the illustrated tradeoffs between latency, reliability, and security remain purely qualitative; no concrete URLLC parameter set (e.g., 1 ms latency bound, 99.999 % reliability) is used to quantify the metrics or to test whether PLS overheads remain compatible with those bounds.
[Key challenges / Role of CSI] Challenging-problems and CSI-role sections: the discussion correctly flags CSI as central but supplies no overhead accounting or comparison against cryptographic alternatives that would substantiate (or refute) the lower-latency assertion under the stated URLLC constraints.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the constructive comments. The feedback correctly identifies that the paper's motivation rests on a general claim about PLS advantages, and that the survey remains qualitative. We address each point below, agreeing to revisions that strengthen framing without altering the survey scope.

read point-by-point responses

Referee: [Abstract / §1] Abstract and opening paragraphs: the claim that PLS 'is of lower complexity and incurs less latency than traditional cryptography' is load-bearing for the paper's motivation yet is advanced without any end-to-end latency budget that accounts for CSI estimation, feedback, or artificial-noise generation under URLLC targets (sub-ms latency, 10^{-5} reliability).

Authors: We agree the claim is central to motivation. As a survey, the statement reflects the established PLS literature on avoiding key distribution overheads. However, we acknowledge it requires qualification under URLLC constraints. We will revise the abstract and introduction to state that PLS 'has the potential for lower complexity and latency' while explicitly noting that CSI-related overheads must be evaluated against sub-ms targets. This addresses the concern without introducing new quantitative analysis outside the paper's scope. revision: partial
Referee: [Performance metrics] Performance-metrics section: the illustrated tradeoffs between latency, reliability, and security remain purely qualitative; no concrete URLLC parameter set (e.g., 1 ms latency bound, 99.999 % reliability) is used to quantify the metrics or to test whether PLS overheads remain compatible with those bounds.

Authors: The metrics section introduces conceptual frameworks to illustrate tradeoffs, consistent with a survey's purpose. We concur that concrete examples would improve clarity. In revision we will add a short illustrative paragraph applying the metrics to standard URLLC targets (1 ms latency bound, 10^{-5} reliability) using example expressions drawn from cited works, while clarifying that full system-level validation lies beyond this survey and is recommended as future research. revision: yes
Referee: [Key challenges / Role of CSI] Challenging-problems and CSI-role sections: the discussion correctly flags CSI as central but supplies no overhead accounting or comparison against cryptographic alternatives that would substantiate (or refute) the lower-latency assertion under the stated URLLC constraints.

Authors: The sections correctly position CSI acquisition as a core tension. Direct overhead comparisons depend on implementation details and are not resolved in the literature. We will expand the CSI discussion with additional references to existing comparison studies and will explicitly state that conclusive latency substantiation under URLLC remains an open problem, thereby reinforcing the paper's call for future work rather than claiming resolution. revision: partial

Circularity Check

0 steps flagged

No circularity: survey of known concepts with no derivations or fitted predictions

full rationale

The paper is a discussion/survey article on PLS for URLLC. It states the lower-complexity/lower-latency property of PLS as a direct consequence of using wireless-medium randomness (abstract), without deriving it from equations, fitting parameters to data, or invoking self-citations as load-bearing uniqueness theorems. No performance metrics are computed, no predictions are made from fitted inputs, and no ansatzes or renamings of known results occur. The text identifies challenges and tradeoffs but supplies no closed derivation chain that reduces to its own inputs. This matches the default non-circular case for conceptual survey papers.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

This is a review paper; no new free parameters, axioms, or invented entities are introduced.

pith-pipeline@v0.9.0 · 5681 in / 808 out tokens · 26209 ms · 2026-05-25T19:38:52.964235+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

The PLS technique mainly uses transmission designs based on the intrinsic randomness of the wireless medium to achieve secrecy. As such, PLS is of lower complexity and incurs less latency than traditional cryptography.
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

we identify the security gap and rate interval as two useful performance metrics for evaluating physical layer security in the context of URLLC

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

15 extracted references · 15 canonical work pages

[1]

5G-based systems design for Tactile in ternet,

C. Li, C. Li, K. Hosseini, S. B. Lee, J. Jiang, W. Chen, G. Ho rn, T. Ji, J. E. Smee, and J. Li, “5G-based systems design for Tactile in ternet,” Proceedings of the IEEE , pp. 1–18, Aug. 2018

work page 2018
[2]

Ultra-r eliable and low-latency communications in 5G downlink: Physical layer aspects,

H. Ji, S. Park, J. Y eo, Y . Kim, J. Lee, and B. Shim, “Ultra-r eliable and low-latency communications in 5G downlink: Physical layer aspects,” IEEE Wireless Commun. , vol. 25, no. 3, pp. 124–130, Jun. 2018

work page 2018
[3]

Securing mmWave vehicular commu- nication links with multiple transmit antennas,

M. E. Eltayeb and R. W. Heath, “Securing mmWave vehicular commu- nication links with multiple transmit antennas,” in Proc. IEEE Int. Conf. Commun. (ICC) W orkshop, Kansas City, MO, May 2018, pp. 1–6. 6

work page 2018
[4]

Ultra-reliable low latency ce llular networks: Use cases, challenges and approaches,

H. Chen, R. Abbas, P . Cheng, M. Shirvanimoghaddam, W. Har djawana, W. Bao, Y . Li, and B. Vucetic, “Ultra-reliable low latency ce llular networks: Use cases, challenges and approaches,” IEEE Commun. Mag. , vol. 56, no. 12, pp. 119–125, Dec. 2018

work page 2018
[5]

Safeguarding 5G wireless communication networks using ph ysical layer security,

N. Y ang, L. Wang, G. Geraci, M. Elkashlan, J. Y uan, and M. D . Renzo, “Safeguarding 5G wireless communication networks using ph ysical layer security,” IEEE Commun. Mag. , vol. 53, no. 4, pp. 20–27, Apr. 2015

work page 2015
[6]

Coding for secrecy: An overview of error-contro l coding techniques for physical-layer security,

W. K. Harrison, J. Almeida, M. R. Bloch, S. W. McLaughlin, and J. Barros, “Coding for secrecy: An overview of error-contro l coding techniques for physical-layer security,” IEEE Signal Process. Mag. , vol. 30, no. 5, pp. 41–50, Sep. 2013

work page 2013
[7]

Analysis of short blocklength codes for secrecy,

W. K. Harrison, D. Sarmento, J. P . Vilela, and M. A. C. Gome s, “Analysis of short blocklength codes for secrecy,” EURASIP J. Wireless Commun. Netw., pp. 1–15, Oct. 2018

work page 2018
[8]

Channel coding rat e in the ﬁnite blocklength regime,

Y . Polyanskiy, H. Poor, and S. V erdu, “Channel coding rat e in the ﬁnite blocklength regime,” IEEE Trans. Inf. Theory , vol. 56, no. 5, pp. 2307– 2359, May 2010

work page 2010
[9]

LDPC codes for the Gaussian wiretap channel,

D. Klinc, J. Ha, S. W. McLaughlin, J. Barros, and B. Kwak, “ LDPC codes for the Gaussian wiretap channel,” IEEE Trans. Inf. F orensics Security., vol. 6, no. 3, pp. 532–540, Sep. 2011

work page 2011
[10]

BER-based physical layer s ecurity with ﬁnite codelength: Combining strong converse and error ampl iﬁcation,

I. Kim, B. Kim, and J. K. Ahn, “BER-based physical layer s ecurity with ﬁnite codelength: Combining strong converse and error ampl iﬁcation,” IEEE Trans. Commun. , vol. 64, no. 9, pp. 3844–3857, Sep. 2016

work page 2016
[11]

On secrecy above se crecy capacity,

R. Rajesh, S. M. Shah, and V . Sharma, “On secrecy above se crecy capacity,” in Proc. IEEE Int. Conf. Commun. Syst. , Nov. 2012, pp. 70– 74

work page 2012
[12]

Secrecy-reliab ility tradeoff for semi-deterministic wiretap channels at ﬁnite blocklen gth,

W. Y ang, R. F. Schaefer, and H. V . Poor, “Secrecy-reliab ility tradeoff for semi-deterministic wiretap channels at ﬁnite blocklen gth,” in Proc. IEEE Int. Symp. Inf. Theory. , Jun. 2017, pp. 2133–2137

work page 2017
[13]

Sh ort- packet downlink transmission with non-orthogonal multipl e access,

X. Sun, S. Y an, N. Y ang, Z. Ding, C. Shen, and Z. Zhong, “Sh ort- packet downlink transmission with non-orthogonal multipl e access,” IEEE Trans. Wireless Commun. , vol. 17, no. 7, pp. 4550–4564, Jul. 2018

work page 2018
[14]

On stochastic geometry model ling of cellular uplink transmission with truncated channel inver sion power control,

H. ElSawy and E. Hossain, “On stochastic geometry model ling of cellular uplink transmission with truncated channel inver sion power control,” IEEE Trans. Wireless Commun., vol. 13, no. 8, pp. 4454–4469, Aug. 2014

work page 2014
[15]

Location-based beamforming for enhancing secrecy in Rician wiretap channels,

S. Y an and R. Malaney, “Location-based beamforming for enhancing secrecy in Rician wiretap channels,” IEEE Trans. Wireless Commun. , vol. 15, no. 4, pp. 2780–2791, Apr. 2016. Riqing Chen (riqing.chen@fafu.edu.cn) received the B.Eng . degree in commu- nication engineering from Tongji University, China, in 200 1, the M.Sc. degree in communications and sign...

work page 2016

[1] [1]

5G-based systems design for Tactile in ternet,

C. Li, C. Li, K. Hosseini, S. B. Lee, J. Jiang, W. Chen, G. Ho rn, T. Ji, J. E. Smee, and J. Li, “5G-based systems design for Tactile in ternet,” Proceedings of the IEEE , pp. 1–18, Aug. 2018

work page 2018

[2] [2]

Ultra-r eliable and low-latency communications in 5G downlink: Physical layer aspects,

H. Ji, S. Park, J. Y eo, Y . Kim, J. Lee, and B. Shim, “Ultra-r eliable and low-latency communications in 5G downlink: Physical layer aspects,” IEEE Wireless Commun. , vol. 25, no. 3, pp. 124–130, Jun. 2018

work page 2018

[3] [3]

Securing mmWave vehicular commu- nication links with multiple transmit antennas,

M. E. Eltayeb and R. W. Heath, “Securing mmWave vehicular commu- nication links with multiple transmit antennas,” in Proc. IEEE Int. Conf. Commun. (ICC) W orkshop, Kansas City, MO, May 2018, pp. 1–6. 6

work page 2018

[4] [4]

Ultra-reliable low latency ce llular networks: Use cases, challenges and approaches,

H. Chen, R. Abbas, P . Cheng, M. Shirvanimoghaddam, W. Har djawana, W. Bao, Y . Li, and B. Vucetic, “Ultra-reliable low latency ce llular networks: Use cases, challenges and approaches,” IEEE Commun. Mag. , vol. 56, no. 12, pp. 119–125, Dec. 2018

work page 2018

[5] [5]

Safeguarding 5G wireless communication networks using ph ysical layer security,

N. Y ang, L. Wang, G. Geraci, M. Elkashlan, J. Y uan, and M. D . Renzo, “Safeguarding 5G wireless communication networks using ph ysical layer security,” IEEE Commun. Mag. , vol. 53, no. 4, pp. 20–27, Apr. 2015

work page 2015

[6] [6]

Coding for secrecy: An overview of error-contro l coding techniques for physical-layer security,

W. K. Harrison, J. Almeida, M. R. Bloch, S. W. McLaughlin, and J. Barros, “Coding for secrecy: An overview of error-contro l coding techniques for physical-layer security,” IEEE Signal Process. Mag. , vol. 30, no. 5, pp. 41–50, Sep. 2013

work page 2013

[7] [7]

Analysis of short blocklength codes for secrecy,

W. K. Harrison, D. Sarmento, J. P . Vilela, and M. A. C. Gome s, “Analysis of short blocklength codes for secrecy,” EURASIP J. Wireless Commun. Netw., pp. 1–15, Oct. 2018

work page 2018

[8] [8]

Channel coding rat e in the ﬁnite blocklength regime,

Y . Polyanskiy, H. Poor, and S. V erdu, “Channel coding rat e in the ﬁnite blocklength regime,” IEEE Trans. Inf. Theory , vol. 56, no. 5, pp. 2307– 2359, May 2010

work page 2010

[9] [9]

LDPC codes for the Gaussian wiretap channel,

D. Klinc, J. Ha, S. W. McLaughlin, J. Barros, and B. Kwak, “ LDPC codes for the Gaussian wiretap channel,” IEEE Trans. Inf. F orensics Security., vol. 6, no. 3, pp. 532–540, Sep. 2011

work page 2011

[10] [10]

BER-based physical layer s ecurity with ﬁnite codelength: Combining strong converse and error ampl iﬁcation,

I. Kim, B. Kim, and J. K. Ahn, “BER-based physical layer s ecurity with ﬁnite codelength: Combining strong converse and error ampl iﬁcation,” IEEE Trans. Commun. , vol. 64, no. 9, pp. 3844–3857, Sep. 2016

work page 2016

[11] [11]

On secrecy above se crecy capacity,

R. Rajesh, S. M. Shah, and V . Sharma, “On secrecy above se crecy capacity,” in Proc. IEEE Int. Conf. Commun. Syst. , Nov. 2012, pp. 70– 74

work page 2012

[12] [12]

Secrecy-reliab ility tradeoff for semi-deterministic wiretap channels at ﬁnite blocklen gth,

W. Y ang, R. F. Schaefer, and H. V . Poor, “Secrecy-reliab ility tradeoff for semi-deterministic wiretap channels at ﬁnite blocklen gth,” in Proc. IEEE Int. Symp. Inf. Theory. , Jun. 2017, pp. 2133–2137

work page 2017

[13] [13]

Sh ort- packet downlink transmission with non-orthogonal multipl e access,

X. Sun, S. Y an, N. Y ang, Z. Ding, C. Shen, and Z. Zhong, “Sh ort- packet downlink transmission with non-orthogonal multipl e access,” IEEE Trans. Wireless Commun. , vol. 17, no. 7, pp. 4550–4564, Jul. 2018

work page 2018

[14] [14]

On stochastic geometry model ling of cellular uplink transmission with truncated channel inver sion power control,

H. ElSawy and E. Hossain, “On stochastic geometry model ling of cellular uplink transmission with truncated channel inver sion power control,” IEEE Trans. Wireless Commun., vol. 13, no. 8, pp. 4454–4469, Aug. 2014

work page 2014

[15] [15]

Location-based beamforming for enhancing secrecy in Rician wiretap channels,

S. Y an and R. Malaney, “Location-based beamforming for enhancing secrecy in Rician wiretap channels,” IEEE Trans. Wireless Commun. , vol. 15, no. 4, pp. 2780–2791, Apr. 2016. Riqing Chen (riqing.chen@fafu.edu.cn) received the B.Eng . degree in commu- nication engineering from Tongji University, China, in 200 1, the M.Sc. degree in communications and sign...

work page 2016