The paper constructs high-rate public-key pseudorandom codes (PRCs) robust against edit errors, providing the first such binary constructions under assumptions that yield Hamming-robust PRCs.

The paper compares various strong secrecy capacities for Arbitrarily Varying and General Arbitrarily Varying Wiretap Channels, establishing equivalences under specific conditions and bounding the capa…

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 introduces the linear canonical Riesz potential (LCRP) and analyzes its convergence properties, leveraging these findings to propose a novel, secure, and efficient asymmetric cascaded LCRP m…

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 addresses secure distributed hypothesis testing, proving impossibility in the standard setting and achieving secure testing for simple and general classes by incorporating a shared secret ke…

Gaussian Shannon proposes a novel watermarking framework that treats diffusion generation as a noisy communication channel, enabling both robust tracing and exact bit-level recovery of embedded waterm…

This paper proposes a novel Simultaneous Data Compression and Encryption (SDCE) system that combines chaotic map-based encryption with Huffman encoding to securely and efficiently transmit large video…

The paper introduces the PML envelope, a novel definition that provides a robust and operationally meaningful measure of information leakage about a secret, satisfying both post-processing robustness…

This paper introduces a dual-layer side-channel attack framework that exploits the variable workload introduced by dynamic image preprocessing in local Vision-Language Models (VLMs) to infer sensitive…

The paper demonstrates that AI agents can conduct a secret, undetectable conversation by exchanging a key using a novel cryptographic primitive, even if they start with no shared secret.

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…

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 introduces SeedHijack, a novel, undetectable supply-chain attack that biases LLM watermarking signals by hijacking the underlying Pseudo-Random Number Generator (PRNG) without altering the g…

The paper introduces SeedHijack, a novel, undetectable supply-chain attack that biases LLM watermarking signals by hijacking the underlying PRNG, thereby amplifying the watermark without altering the…

This paper develops a formal economic framework to assess the security of VDF-based randomness beacons, demonstrating that many proposed delays are economically insecure due to rational, profit-motiva…

The paper proposes a Jacobian-guided anisotropic noise reshaping technique to selectively attenuate noise in task-relevant subspaces, significantly enhancing data utility while maintaining Local Diffe…

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…

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 SB-ECC, a novel score-based decoder that models error correction as continuous-time denoising, achieving state-of-the-art performance across various code families and noise levels…