Dynamic Multi Target Homomorphic Attribute-Based Encryption

2Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose multi target homomorphic attribute-based encryption (MT-HABE) with dynamic homomorphic evaluation: it can take as input arbitrary additional ciphertexts during homomorphic computation. In the previous MT-HABE of Brakerski et al. (TCC 2016-B), the output of homomorphic computation, which is related to a policy set, cannot be computed with a fresh ciphertext whose attribute does not satisfy any policy in the set. This is because the underlying multi-key fully homomorphic encryption (MKFHE) is single-hop: some keys are related to the output of homomorphic computation, which cannot be combined with ciphertexts encrypted under other keys. To implement dynamic homomorphic evaluations, we construct MT-HABE from a dual variant of multi-hop MKFHE proposed by Peikert and Shiehian (TCC 2016-B).

Cite

CITATION STYLE

APA

Hiromasa, R., & Kawai, Y. (2017). Dynamic Multi Target Homomorphic Attribute-Based Encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10655 LNCS, pp. 25–43). Springer Verlag. https://doi.org/10.1007/978-3-319-71045-7_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free