The Shannon Cipher System With a Guessing Wiretapper: General Sources
From MaRDI portal
Publication:5281009
DOI10.1109/TIT.2011.2110870zbMATH Open1366.94500arXiv1008.1970WikidataQ122420590 ScholiaQ122420590MaRDI QIDQ5281009FDOQ5281009
Authors: Manjesh Kumar Hanawal, Rajesh Sundaresan 
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1008.1970
This page was built for publication: The Shannon Cipher System With a Guessing Wiretapper: General Sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281009)
