Universal Encryption of Individual Sequences Under Maximal Information Leakage

Neri Merhav

doi:10.3390/e27060551

Universal Encryption of Individual Sequences Under Maximal Information Leakage

Neri Merhav

Electrical and Computer Engineering

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

We consider the Shannon cipher system in the framework of individual sequences and finite-state encrypters under the metric of maximal information leakage. 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 bitstream.

Original language	English
Article number	551
Journal	Entropy
Volume	27
Issue number	6
DOIs	https://doi.org/10.3390/e27060551
State	Published - Jun 2025

Keywords

Lempel–Ziv algorithm
Shannon cipher system
finite-state machine
maximal leakage

All Science Journal Classification (ASJC) codes

Information Systems
Mathematical Physics
Physics and Astronomy (miscellaneous)
General Physics and Astronomy
Electrical and Electronic Engineering

Access to Document

10.3390/e27060551

Cite this

@article{2c1aa5600cda4133a87f1eba6c444a88,

title = "Universal Encryption of Individual Sequences Under Maximal Information Leakage",

abstract = "We consider the Shannon cipher system in the framework of individual sequences and finite-state encrypters under the metric of maximal information leakage. 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 bitstream.",

keywords = "Lempel–Ziv algorithm, Shannon cipher system, finite-state machine, maximal leakage",

author = "Neri Merhav",

note = "Publisher Copyright: {\textcopyright} 2025 by the author.",

year = "2025",

month = jun,

doi = "10.3390/e27060551",

language = "الإنجليزيّة",

volume = "27",

journal = "Entropy",

issn = "1099-4300",

publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",

number = "6",

}

TY - JOUR

T1 - Universal Encryption of Individual Sequences Under Maximal Information Leakage

AU - Merhav, Neri

PY - 2025/6

Y1 - 2025/6

N2 - We consider the Shannon cipher system in the framework of individual sequences and finite-state encrypters under the metric of maximal information leakage. 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 bitstream.

AB - We consider the Shannon cipher system in the framework of individual sequences and finite-state encrypters under the metric of maximal information leakage. 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 bitstream.

KW - Lempel–Ziv algorithm

KW - Shannon cipher system

KW - finite-state machine

KW - maximal leakage

UR - http://www.scopus.com/inward/record.url?scp=105009098231&partnerID=8YFLogxK

U2 - 10.3390/e27060551

DO - 10.3390/e27060551

M3 - مقالة

SN - 1099-4300

VL - 27

JO - Entropy

JF - Entropy

IS - 6

M1 - 551

ER -

Universal Encryption of Individual Sequences Under Maximal Information Leakage

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this