DocumentCode
1472427
Title
The Shannon Cipher System With a Guessing Wiretapper: General Sources
Author
Hanawal, Manjesh Kumar ; Sundaresan, Rajesh
Volume
57
Issue
4
fYear
2011
fDate
4/1/2011 12:00:00 AM
Firstpage
2503
Lastpage
2516
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.
Keywords
cryptography; decoding; source coding; Shannon cipher system; computational secrecy; correct decoding exponent; fixed rate source compression; guessing wiretapper; Decoding; Encoding; Encryption; Entropy; Markov processes; Upper bound; Cipher systems; correct decoding exponent; error exponent; fixed-rate source coding; information spectrum; key rate; large deviations; length function; secrecy; sources with memory;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2011.2110870
Filename
5730595
Link To Document