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.
Wire- less information-theoretic security,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CR 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Shuffling for Semantic Secrecy
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.