On the Shannon Cipher System With a Wiretapper Guessing Subject to Distortion and Reliability Requirements
Abstract
In this paper we discuss the processes in the Shannon cipher system with discrete memoryless source and a guessing wiretapper. The wiretapper observes a cryptogram of N-vector of ciphered messages in the public channel and tries to guess successively the vector of messages within given distortion level and small probability of error less than \-NE\ with positive reliability index E. The security of the system is measured by the expected number of guesses which wiretapper needs for the approximate reconstruction of the vector of source messages. The distortion, the reliability criteria and the possibility of upper limiting the number of guesses extend the approach studied by Merhav and Arikan. A single-letter characterization is given for the region of pairs (RL,R) (of the rate RL of the maximum number of guesses L(N) and the rate R of the average number of guesses) in dependence on key rate RK, distortion level and reliability E.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.