The Shannon Cipher System with a Guessing Wiretapper: General Sources
Information Theory
2010-08-12 v1 math.IT
Abstract
The Shannon cipher system is studied in the context of general sources using a notion of computational secrecy introduced by Merhav & Arikan. Bounds are derived on limiting exponents of guessing moments for general sources. The bounds are shown to be tight for iid, Markov, and unifilar sources, thus recovering some known results. A close relationship between error exponents and correct decoding exponents for fixed rate source compression on the one hand and exponents for guessing moments on the other hand is established.
Keywords
Cite
@article{arxiv.1008.1970,
title = {The Shannon Cipher System with a Guessing Wiretapper: General Sources},
author = {Manjesh Kumar Hanawal and Rajesh Sundaresan},
journal= {arXiv preprint arXiv:1008.1970},
year = {2010}
}
Comments
24 pages, Submitted to IEEE Transactions on Information Theory