The Shannon Cipher System With a Guessing Wiretapper: General Sources

DOI10.1109/TIT.2011.2110870MaRDI QIDQ5281009zbMATH OpenWikidataFDO

Authors Manjesh Kumar Hanawal, Rajesh Sundaresan

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1008.1970

Mathematics Subject Classification ID

Cryptography (94A60) Source coding (94A29)

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.

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)