This paper surveys information-theoretic approaches to secure Integrated Sensing and Communication (ISAC), providing a comprehensive review of models, security formulations, and fundamental limits.

The paper characterizes the secure rate-distortion-perception (RDP) trade-off region for neural image compression over various noisy and noiseless channels, demonstrating that randomized distributed f…

The paper demonstrates that soft fusion in multi-warden covert communication has structural limits, showing that the Fusion Center gains no significant detection advantage from randomizing the number…

The paper develops a robust framework for covert quantum communication by analyzing performance over quantum channels with bounded uncertainty in transmissivity and noise, showing that worst-case secu…

The paper develops a formal theory to analyze how throughput changes in AI-enhanced cybersecurity pipelines when stage capacities are perturbed by multipliers.

This paper demonstrates that a proposed lightweight RFID authentication protocol is structurally insecure and susceptible to a multi-session algebraic attack, enabling full compromise of the secret ke…

The paper applies Stringology-Based Cryptanalysis (SBC) using KMP and Boyer-Moore algorithms to analyze EChaCha20, confirming that the cipher maintains strong pseudorandomness and exhibits rapid diffu…

The paper proposes a stochastic risk-aware optimization framework for covert quantum communication, significantly improving throughput and expanding feasible operating regions under realistic channel…

The paper analyzes robust covert wireless communication under bounded uncertainty, demonstrating that the adverse conditions governing reliability and covertness are distinct, thus requiring a conflic…

The paper establishes that the existence of many-time secure uncloneable encryption (UCE) can be shown to follow from relatively weak assumptions, such as the existence of many-time secure symmetric k…

The paper presents a lattice-based Ciphertext-Policy Attribute-Based Encryption (CP-ABE) scheme that supports $\mathsf{NC}^1$ access policies while maintaining constant-size ciphertexts.

The paper establishes a strong connection between scalable pseudorandom unitaries (PRUs) and the unitary synthesis problem, proving that any such PRU construction must require a classical oracle of si…

This paper analyzes the secret key rate of RIS-assisted THz MIMO CV-QKD systems under various eavesdropping scenarios, demonstrating that the RIS significantly enhances secure communication range and…

The paper analyzes subcodes of lambda-Gabidulin codes to construct highly efficient McEliece-like and Niederreiter-like cryptosystems, demonstrating that random subcodes of classical Gabidulin codes y…

The paper introduces the Asymmetric Collaborative Framework (ACF), a novel method that enables robust covert communication between autonomous agents despite inherent cognitive asymmetry caused by dyna…

The paper introduces PolyVeil, a protocol for private Boolean summation that uses permutation matrices in the Birkhoff polytope, achieving strong security guarantees while highlighting a fundamental t…

This paper extends quantum lattice reduction techniques (CDPR) from ideal to module lattices over cyclotomic rings, achieving a constant module reduction factor and providing a rigorous, bounded-preci…

The paper proposes an efficient and provably secure linguistic steganography method using range coding that achieves high embedding capacity and speed, outperforming existing methods.

The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…

The paper proposes a novel method using random walks and equitable partitions to derive an inequality for the total variation distance of codes, generalizing existing bounds for finite abelian groups.