Paper 2026/2461

Leakage-Resilient Incompressible Cryptography: Constructions and Barriers

KAARTIK BHUSHAN, CNRS, IRIF, Université Paris Cité
Rishab Goyal, University of Wisconsin-Madison
Venkata Koppula, Indian Institute of Technology Delhi
Varun Narayanan, Chennai Mathematical Institute
Manoj Prabhakaran, Indian Institute of Technology Bombay
Mahesh Sreekumar Rajasree, University of Warsaw
Abstract

We introduce Leakage-Resilient Incompressible cryptography, which simultaneously addresses two variants of side-channel attacks that have been tackled in theoretical cryptography. Leakage-resilience seeks to provide security against an adversary who learns a part of the secret-key and the entire ciphertext or signature; conversely, incompressible cryptography provides security against an adversary who learns the entire secret-key, but only a part of the ciphertext or signature. However, constructions in either of these security models can fail against an attack in the other model. In this work, we define a new model of security that subsumes both leakage-resilient cryptography and incompressible cryptography, and we present several non-trivial positive and negative results. On the positive side, first we present a transformation from incompressible symmetric-key encryption (SKE) to leakage-resilient incompressible SKE in the information-theoretic setting. Next, as one of our main results, we construct a leakage-resilient incompressible public-key encryption (PKE), combining an incompressible SKE and a new primitive that we call leakage-resilient non-committing key encapsulation mechanism (LR-NC-KEM). While an information-theoretic incompressible SKE suitable for use in both these constructions already exists in the literature (Dziembowski, CRYPTO 2006), we present a new construction achieving ciphertext-rate $\frac{1}{2}$ and compression-rate $\frac{1}{2}$, using an appropriate notion of invertible extractors; this leads to corresponding improvements in the final parameters we obtain in these constructions. We also construct a leakage-resilient incompressible signature scheme in the classical random oracle model, assuming $(\mathsf{DCR}\text{ or }\mathsf{LWE})$ and the Decisional Linear assumption, with signature-rate and compression-rate $1-o(1)$ and leakage-rate $1$. On the negative side, we show barriers to significantly improving the parameters we obtain, by showing impossibility of basing the security of such improved schemes on blackbox reductions. Apart from the general framework and the specific results we obtain, some of the intermediate tools that we define and instantiate, like LR-NC-KEM and invertible extractors, may be of independent interest.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
A minor revision of an IACR publication in ASIACRYPT 2024
DOI
10.1007/978-981-96-0941-3_7
Keywords
Incompressible cryptographyleakage-resilient encryptionextractors
Contact author(s)
kbhushan @ irif fr
rishab @ cs wisc edu
kvenkata @ cse iitd ac in
varunnkv @ gmail com
mp @ cse iitb ac in
srmahesh1994 @ gmail com
History
2026-10-14: approved
2026-10-13: received
See all versions
Short URL
https://ia.cr/2026/2461
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/2461,
      author = {KAARTIK BHUSHAN and Rishab Goyal and Venkata Koppula and Varun Narayanan and Manoj Prabhakaran and Mahesh Sreekumar Rajasree},
      title = {Leakage-Resilient Incompressible Cryptography: Constructions and Barriers},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/2461},
      year = {2026},
      doi = {10.1007/978-981-96-0941-3_7},
      url = {https://eprint.iacr.org/2026/2461}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.