Pith. sign in

REVIEW 2 cited by

A Superposition Code-Based Semantic Communication Approach with Quantifiable and Controllable Security

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2401.13980 v4 pith:VLVDO4GI submitted 2024-01-25 cs.IT eess.IVmath.IT

classification cs.ITeess.IVmath.IT
keywords constellationsecuritysemcommethodsemanticdatadecodingeavesdropper
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper addresses the challenge of achieving security in semantic communication (SemCom) over a wiretap channel, where a legitimate receiver coexists with an eavesdropper experiencing a poorer channel condition. Despite previous efforts to secure SemCom against eavesdroppers, guarantee of approximately zero information leakage remains an open issue. In this work, we propose a secure SemCom approach based on superposition code, aiming to provide quantifiable and controllable security for digital SemCom systems. The proposed method employs a double-layered constellation map, where semantic information is associated with satellite constellation points and cloud center constellation points are randomly selected. By carefully allocating power between these two layers of constellation, we ensure that the symbol error probability (SEP) of the eavesdropper when decoding satellite constellation points is nearly equivalent to random guessing, while maintaining a low SEP for the legitimate receiver to successfully decode the semantic information. Simulation results demonstrate that the peak signal-to-noise ratio (PSNR) and mean squared error (MSE) of the eavesdropper's reconstructed data, under the proposed method, can range from decoding Gaussian-distributed random noise to approaching the variance of the data. This validates the effectiveness of our method in nearly achieving the experimental upper bound of security for digital SemCom systems when both eavesdroppers and legitimate users utilize identical decoding schemes. Furthermore, the proposed method consistently outperforms benchmark techniques, showcasing superior data security and robustness against eavesdropping. The implementation code is publicly available at: https://github.com/1weixuanchen/ A-Superposition-Code-Based-Semantic-Communication.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Secure Goal-Oriented Communication: Defending against Eavesdropping Timing Attacks

    cs.CR 2025-07 conditional novelty 6.0 of 10

    A timing side channel in goal-oriented communication lets an eavesdropper infer the state of a Markov process, and two simple scheduling heuristics reduce that leakage by about half with only a small loss of task reward.

  2. Shuffling for Semantic Secrecy

    cs.CR 2025-07 conditional novelty 5.0 of 10

    Random shuffling of semantic features, used as a shared secret key, is shown to protect a learned semantic communication system against eavesdroppers while adding little computational overhead.

Pith tools