Paper 2025/2210
Multi-Client Functional Encryption for Small Domains
Abstract
In this paper, we revisit the problem of multi-client functional encryption (MCFE) for general functions. Specifically, we consider the setting of private-key MCFE for constant-arity functions where the input domain is polynomial in the security parameter. Surprisingly, we show that in this setting it is possible to construct a private-key MCFE scheme secure for a bounded number of key and encryption queries based only on the minimal assumption that one-way functions exist. In contrast, all prior constructions of MCFE for general functions require very strong assumptions such as indistinguishability obfuscation or multilinear maps. Our main technique is to show that private-key MCFE for polynomial input domain can be built from any private-key multi-input functional encryption (MIFE) while inheriting the security properties of the underlying MIFE. Instantiating our construction with the MIFE of Brakerski et al. (Eurocrypt 2016) gives us a construction based only on the existence of one-way functions.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Functional EncryptionMulti-Client Functional EncryptionMulti-Input Functional Encryption
- Contact author(s)
-
suvasree @ gwu edu
m vaid @ gwu edu
arkady @ gwu edu - History
- 2026-07-09: revised
- 2025-12-08: received
- See all versions
- Short URL
- https://ia.cr/2025/2210
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/2210,
author = {Suvasree Biswas and Mohit Vaid and Arkady Yerukhimovich},
title = {Multi-Client Functional Encryption for Small Domains},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/2210},
year = {2025},
url = {https://eprint.iacr.org/2025/2210}
}
