Achieving Secure and Fresh Information Updates via Short-Packet Communications

Enhancing the security and freshness of timely status update systems within next generation ultra-reliable and low-latency communications (xURLLC) demands in-depth exploration. In this letter, we focus on a security-aware information update system, where a confidential source transmits updates to a legitimate user via short-packet communications (SPC), with an eavesdropper attempting to wiretap. For this scenario, we propose a novel metric, age-of-secure-information (AoSI) to capture the security-freshness tradeoff. Analyzing the evolution of AoSI, we derive the simplified average AoSI and formulate an optimization problem minimizing it via allocating the blocklength of each update period. Via convex approximation, we propose an iterative algorithm to obtain solutions. Evaluations on system performance are presented via simulations.

Authors

Institutions

Publication Details

Journal
IEEE Wireless Communications Letters
Published
2024-09-17
DOI
https://doi.org/10.1109/lwc.2024.3462717
Citations
5
Primary Topic
Opportunistic and Delay-Tolerant Networks
Type
article
Field-Weighted Citation Impact
1.74
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Achieving Secure and Fresh Information Updates via Short-Packet Communications

Xiaopeng Yuan, Yulin Hu, Anke Schmeink, Yao Zhu et al.
5 citations
IEEE Wireless Communications Letters
Opportunistic and Delay-Tolerant Networks
1.74
article

Achieving Secure and Fresh Information Updates via Short-Packet Communications

Xiaopeng Yuan, Yulin Hu, Anke Schmeink, Yao Zhu, Hao Xu
article en
5 citations

Abstract

Enhancing the security and freshness of timely status update systems within next generation ultra-reliable and low-latency communications (xURLLC) demands in-depth exploration. In this letter, we focus on a security-aware information update system, where a confidential source transmits updates to a legitimate user via short-packet communications (SPC), with an eavesdropper attempting to wiretap. For this scenario, we propose a novel metric, age-of-secure-information (AoSI) to capture the security-freshness tradeoff. Analyzing the evolution of AoSI, we derive the simplified average AoSI and formulate an optimization problem minimizing it via allocating the blocklength of each update period. Via convex approximation, we propose an iterative algorithm to obtain solutions. Evaluations on system performance are presented via simulations.

IEEE Wireless Communications LettersVol. 13(11)
Wuhan University (CN), RWTH Aachen University (DE)
Openalex Percentile: Top 14%
Opportunistic and Delay-Tolerant Networks
1.74
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.