pith. sign in

arxiv: 1311.1411 · v3 · pith:5RP2RMV4new · submitted 2013-11-06 · 💻 cs.IT · cs.CR· math.IT

Effective Secrecy: Reliability, Confusion and Stealth

classification 💻 cs.IT cs.CRmath.IT
keywords effectivesecrecystealthchannelscommunicationmeasuresecuritybinary
0
0 comments X
read the original abstract

A security measure called effective security is defined that includes strong secrecy and stealth communication. Effective secrecy ensures that a message cannot be deciphered and that the presence of meaningful communication is hidden. To measure stealth we use resolvability and relate this to binary hypothesis testing. Results are developed for wire-tap channels and broadcast channels with confidential messages.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.