The Shannon Cipher System With a Guessing Wiretapper: General Sources

Hanawal, Manjesh Kumar and Sundaresan, Rajesh (2011) The Shannon Cipher System With a Guessing Wiretapper: General Sources. In: IEEE Transactions on Information Theory, 57 (4). pp. 2503-2516.

PDF Shannon.pdf - Published Version Restricted to Registered users only Download (313kB) | Request a copy

Abstract

The Shannon cipher system is studied in the context of general sources using a notion of computational secrecy introduced by Merhav and Arikan. Bounds are derived on limiting exponents of guessing moments for general sources. The bounds are shown to be tight for i.i.d., 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.

Item Type:	Journal Article
Publication:	IEEE Transactions on Information Theory
Publisher:	IEEE
Additional Information:	Copyright 2011 IEEE. Personal use of this material is permitted.However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords:	Cipher systems;correct decoding exponent;error exponent; fixed-rate source coding;information spectrum;key rate; large deviations;length function;secrecy;sources with memory
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	20 Apr 2011 06:18
Last Modified:	20 Apr 2011 06:18
URI:	http://eprints.iisc.ac.in/id/eprint/36748

Actions (login required)

View Item