For AVWCs strong secrecy capacity equals semantic secrecy capacity; for GAVWCs the gap is bounded and vanishes if the jammer choice is sub-double-exponential in block length.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 4years
2026 4verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
Exact secure RDP regions are characterized for noiseless channels and bounded for broadcast channels, with common randomness and random binning shown to achieve strong secrecy, low distortion, and high perceptual quality simultaneously.
Identification capacity of ISI Gaussian channels permits super-exponential message growth ~2^(n log n R) even when ISI taps scale as n^κ for κ in [0, 1/2).
General inner and outer bounds are given for the achievable region of (D1, D2, L) pairs in hierarchical joint source-channel coding with first-phase leakage constraint, plus a capacity-achieving condition.
citing papers explorer
-
Cryptographic and Information-theoretic Security Capacities for General Arbitrarily Varying Wiretap Channels
For AVWCs strong secrecy capacity equals semantic secrecy capacity; for GAVWCs the gap is bounded and vanishes if the jammer choice is sub-double-exponential in block length.
-
Secure Rate-Distortion-Perception: A Randomized Distributed Function Computation Approach for Realism
Exact secure RDP regions are characterized for noiseless channels and bounded for broadcast channels, with common randomness and random binning shown to achieve strong secrecy, low distortion, and high perceptual quality simultaneously.
-
Identification for ISI Gaussian Channels
Identification capacity of ISI Gaussian channels permits super-exponential message growth ~2^(n log n R) even when ISI taps scale as n^κ for κ in [0, 1/2).
-
Hierarchical Joint Source-Channel Coding with Constrained Information Leakage
General inner and outer bounds are given for the achievable region of (D1, D2, L) pairs in hierarchical joint source-channel coding with first-phase leakage constraint, plus a capacity-achieving condition.