Paper 2026/2837
Adaptive Leaky LWE and Its Security
Abstract
The Leaky LWE problem, proposed by Lai, Swarnakar, and Woo (CiC '25), studies whether LWE samples remain pseudorandom in the presence of noisy linear information about their secrets and errors. In Leaky LWE, the leakage matrix may depend on the public matrix, but must be chosen before the LWE challenge is revealed. We study $t$-round adaptive Leaky LWE, where each leakage matrix may depend on the challenge and all preceding leakage answers. Under explicit norm, smoothing, and sampling conditions, we reduce Gaussian-secret LWE to this problem at the corresponding source parameters for polynomially many rounds. The reduction preserves the public-matrix distribution and access to its correlated oracle, and supports rectangular leakage matrices and non-spherical discrete Gaussians over arbitrary orders in number fields.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- LWEHint-MLWELeaky LWEAdaptive Leaky LWE
- Contact author(s)
-
chuanqi zhang @ monash edu
muhammed esgin @ monash edu
ron steinfeld @ monash edu - History
- 2026-11-11: approved
- 2026-11-09: received
- See all versions
- Short URL
- https://ia.cr/2026/2837
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/2837,
author = {Chuanqi Zhang and Muhammed F. Esgin and Ron Steinfeld},
title = {Adaptive Leaky {LWE} and Its Security},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/2837},
year = {2026},
url = {https://eprint.iacr.org/2026/2837}
}