Perfectly secure encryption of individual sequences

TL;DR

This paper introduces a notion of finite-state encryptability for individual sequences, showing it equals finite-state compressibility, and explores its properties and extensions including side information and lossy reconstruction.

Contribution

It establishes the equivalence between finite-state encryptability and compressibility for individual sequences, extending classical information theory results to a deterministic setting.

Findings

Finite-state encryptability equals finite-state compressibility for all sequences.

Redundancy in encryption decays slower than in compression.

Extensions include side information and lossy reconstruction scenarios.

Abstract

In analogy to the well-known notion of finite--state compressibility of individual sequences, due to Lempel and Ziv, we define a similar notion of "finite-state encryptability" of an individual plaintext sequence, as the minimum asymptotic key rate that must be consumed by finite-state encrypters so as to guarantee perfect secrecy in a well-defined sense. Our main basic result is that the finite-state encryptability is equal to the finite-state compressibility for every individual sequence. This is in parallelism to Shannon's classical probabilistic counterpart result, asserting that the minimum required key rate is equal to the entropy rate of the source. However, the redundancy, defined as the gap between the upper bound (direct part) and the lower bound (converse part) in the encryption problem, turns out to decay at a different rate (in fact, much slower) than the analogous redundancy associated with the compression problem. We also extend our main theorem in several directions, allowing: (i) availability of side information (SI) at the encrypter/decrypter/eavesdropper, (ii) lossy reconstruction at the decrypter, and (iii) the combination of both lossy reconstruction and SI, in the spirit of the Wyner--Ziv problem.