π€ AI Summary
This paper investigates universal, model-free encryption of individual sequences under the maximal information leakage metric, focusing on the fundamental limits of finite-state encryptors. We propose a fully data-driven, assumption-free construction: cascading LempelβZiv adaptive compression with a one-time pad (OTP). For individual sequences, we derive the first tight upper and lower bounds on the maximal leakage rate and rigorously prove that our scheme asymptotically achieves the optimal leakage performance. Our key contributions are threefold: (1) establishing the minimum achievable maximal leakage rate for universal encryption; (2) providing the first explicit, implementable model-free construction attaining this fundamental limit; and (3) unifying individual-sequence information theory, finite-state machine modeling, and adaptive compression theory to establish a novel paradigm for secure encryption without statistical assumptions.
π Abstract
We consider the Shannon cipher system in the framework of individual sequences and finite-state encrypters under the metric of maximal leakage of information. A lower bound and an asymptotically matching upper bound on the leakage are derived, which lead to the conclusion that asymptotically minimum leakage can be attained by Lempel-Ziv compression followed by one-time pad encryption of the compressed bit-stream.