Paper 2026/2822
Threshold Batched Attribute-Based Encryption from Succinct LWE
Abstract
Batched identity-based encryption (BIBE) enables a single compact key to decrypt ciphertexts associated with a designated batch of identities. Batched attribute-based encryption (B-ABE) extends this functionality to attribute-based access control, while threshold batched attribute-based encryption (TB-ABE) further distributes the decryption capability among multiple parties. Existing constructions of TB-ABE rely on bilinear pairings, motivating post-quantum alternatives. In this work, we give, to the best of our knowledge, the first lattice-based candidate construction of TB-ABE. Our construction combines the succinct polynomial-digest mechanism underlying lattice-based BIBE with key-homomorphic evaluation for arithmetic-circuit policies and linear secret sharing. We prove security under the ℓ-succinct LWE assumption, assuming the required share-uniformity property of the underlying ramp threshold sharing scheme.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Accepted at Indocrypt 2026
- Keywords
- Attribute-based encryptionBatched encryptionThreshold CryptographyLattice-Based Cryptography
- Contact author(s)
-
shayeef_r @ isical ac in
rpsarkar @ iiitl ac in
mriganka @ isical ac in - History
- 2026-11-10: approved
- 2026-11-08: received
- See all versions
- Short URL
- https://ia.cr/2026/2822
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/2822,
author = {Shayeef Murshid and Ramprasad Sarkar and Mriganka Mandal},
title = {Threshold Batched Attribute-Based Encryption from Succinct {LWE}},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/2822},
year = {2026},
url = {https://eprint.iacr.org/2026/2822}
}