### Attribute-Based Fully Homomorphic Encryption with a Bounded Number of Inputs

Michael Clear and Ciaran McGoldrick

##### Abstract

The only known way to achieve Attribute-based Fully Homomorphic Encryption (ABFHE) is through indistinguishability obfsucation. The best we can do at the moment without obfuscation is Attribute-Based Leveled FHE which allows circuits of an a priori bounded depth to be evaluated. This has been achieved from the Learning with Errors (LWE) assumption. However we know of no other way without obfuscation of constructing a scheme that can evaluate circuits of unbounded depth. In this paper, we present an ABFHE scheme that can evaluate circuits of unbounded depth but with one limitation: there is a bound N on the number of inputs that can be used in a circuit evaluation. The bound N could be thought of as a bound on the number of independent senders. Our scheme allows N to be exponentially large so we can set the parameters so that there is no limitation on the number of inputs in practice. Our construction relies on multi-key FHE and leveled ABFHE, both of which have been realized from LWE, and therefore we obtain a concrete scheme that is secure under LWE.

Available format(s)
Category
Public-key cryptography
Publication info
Published elsewhere. Africacrypt 2016
Keywords
attribute based encryptionfully homomorphic encryptionLWE
Contact author(s)
clearm @ scss tcd ie
History
Short URL
https://ia.cr/2016/099

CC BY

BibTeX

@misc{cryptoeprint:2016/099,
author = {Michael Clear and Ciaran McGoldrick},
title = {Attribute-Based Fully Homomorphic Encryption with a Bounded Number of Inputs},
howpublished = {Cryptology ePrint Archive, Paper 2016/099},
year = {2016},
note = {\url{https://eprint.iacr.org/2016/099}},
url = {https://eprint.iacr.org/2016/099}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.