Hanawal, Manjesh Kumar and Sundaresan, Rajesh (2009) The Shannon Cipher System with a Guessing Wiretapper: General Sources. In: IEEE International Symposium on Information Theory (ISIT 2009), JUN 28-JUL 03, 2009, Seoul, pp. 1949-1953.
This is the latest version of this item.
Restricted to Registered users only
Download (608Kb) | Request a copy
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 formfixed rate source compression on the one hand and exponents for guessing moments on the other hand is established.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2009 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.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||23 Aug 2010 12:41|
|Last Modified:||19 Sep 2010 06:14|
Available Versions of this Item
- The Shannon Cipher System with a Guessing Wiretapper: General Sources. (deposited 23 Aug 2010 12:41) [Currently Displayed]
Actions (login required)