Derives second-order asymptotic converse and matching achievability bounds on average detection delay for covert Bayesian quickest change detection under PFA and ECB constraints, quantifying square-root-order covert sensing gain.
A capacity result for batch steganography,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2verdicts
UNVERDICTED 2representative citing papers
Develops quantum steganography protocols for combinations of classical, entanglement, and quantum communication as covers and cyphers, with improvements relaxing shared-key requirements under milder assumptions.
citing papers explorer
-
Covert Bayesian Quickest Change Detection
Derives second-order asymptotic converse and matching achievability bounds on average detection delay for covert Bayesian quickest change detection under PFA and ECB constraints, quantifying square-root-order covert sensing gain.
-
Steganography Protocols for Quantum Channels
Develops quantum steganography protocols for combinations of classical, entanglement, and quantum communication as covers and cyphers, with improvements relaxing shared-key requirements under milder assumptions.