Paper 2022/1317
On the Optimal Succinctness and Efficiency of Functional Encryption and Attribute-Based Encryption
Abstract
We investigate the optimal (asymptotic) efficiency of functional encryption (FE) and attribute-based encryption (ABE) by proving inherent space-time trade-offs and constructing nearly optimal schemes. We consider the general notion of partially hiding functional encryption (PHFE), capturing both FE and ABE, and the most efficient computation model of random-access machines (RAM). In PHFE, a secret key
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- A major revision of an IACR publication in EUROCRYPT 2023
- DOI
- 10.1007/978-3-031-30620-4_16
- Keywords
- functional encryptionattribute-based encryptionlower boundsobfuscationgarblingPIR
- Contact author(s)
-
aayushja @ andrew cmu edu
rachel @ cs washington edu
luoji @ cs washington edu - History
- 2023-11-01: revised
- 2022-10-04: received
- See all versions
- Short URL
- https://ia.cr/2022/1317
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/1317, author = {Aayush Jain and Huijia Lin and Ji Luo}, title = {On the Optimal Succinctness and Efficiency of Functional Encryption and Attribute-Based Encryption}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/1317}, year = {2022}, doi = {10.1007/978-3-031-30620-4_16}, url = {https://eprint.iacr.org/2022/1317} }