Paper 2026/2697
Batched Threshold Predicate Encryption from Succinct LWE
, Indian Statistical Institute Kolkata, Indian Institute of Information Technology Lucknow, Indian Statistical Institute KolkataAbstract
Predicate encryption extends attribute-based encryption by providing fine-grained access control while hiding the attribute associated with a ciphertext beyond what the secret keys held by an adversary necessarily reveal. Batched identity-based encryption enables authorization with respect to a designated collection of identities. We introduce batched threshold predicate encryption (BT-PE), which combines batch-scoped authorization, expressive predicate-based access control, and threshold decryption. We give a lattice-based construction supporting polynomial-size arithmetic-circuit predicates, compact batch digests, and compact per-party key shares. Decryption is possible only when the encrypted attribute belongs to the authorized batch, satisfies the required predicate, and a sufficiently large set of parties participates. We prove correctness and query-selective one-sided security under the $\ell$-succinct LWE assumption, together with standard assumptions on digital signatures and compute-and-compare obfuscation.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Major revision. Accepted at ICISC 2026
- Keywords
- Predicate EncryptionBatched EncryptionThreshold CryptographyLattice-Based Cryptography
- Contact author(s)
-
shayeef_r @ isical ac in
rpsarkar @ iiitl ac in
mriganka @ isical ac in - History
- 2026-11-04: approved
- 2026-10-30: received
- See all versions
- Short URL
- https://ia.cr/2026/2697
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/2697,
author = {Shayeef Murshid and Ramprasad Sarkar and Mriganka Mandal},
title = {Batched Threshold Predicate Encryption from Succinct {LWE}},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/2697},
year = {2026},
url = {https://eprint.iacr.org/2026/2697}
}
