Paper 2026/2526
Faster ABE for Turing Machines from Circular Evasive LWE
Abstract
We present a new ABE for Turing machines, where - encryption runs in time $O(T)$ and produces a ciphertext of size $O(T)$ for time $T$ computation; - key generation produces a key of size $O(1)$; - security relies on the (public-coin) circular evasive LWE assumption. In fact, we obtain an ABE for a simple and more general model of computation which we refer to as iterated (local) computation. We improve on the recent construction of Agrawal, Kumari, and Yamada (CRYPTO 24) in three ways: (i) faster encryption and smaller ciphertext size; (ii) smaller key size, and (iii) weaker assumptions, eliminating the need for circular tensor LWE.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- A major revision of an IACR publication in EUROCRYPT 2025
- DOI
- 10.1007/978-3-031-91131-6_4
- Keywords
- attribute-based encryptionlatticesevasive LWETuring Machinescircular assumption
- Contact author(s)
-
cini valerio @ gmail com
wee @ di ens fr - History
- 2026-10-19: approved
- 2026-10-18: received
- See all versions
- Short URL
- https://ia.cr/2026/2526
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/2526,
author = {Valerio Cini and Hoeteck Wee},
title = {Faster {ABE} for Turing Machines from Circular Evasive {LWE}},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/2526},
year = {2026},
doi = {10.1007/978-3-031-91131-6_4},
url = {https://eprint.iacr.org/2026/2526}
}
