Efficient Leveled (Multi) Identity-Based Fully Homomorphic Encryption Schemes

39Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The first identity-based fully homomorphic encryption (IBFHE) scheme was constructed from identity-based encryption (IBE) and lattice-based cryptography by Gentry, Sahai, and Waters in CRYPTO 2013. Their IBFHE scheme is improved in this paper, exploiting Alperin-Sheriff and Peikert's tight and simple noise analysis method when evaluating homomorphically and Micciancio and Peikert's powerful and novel trapdoor. Furthermore, using the masking scheme(Mukherjee and Wichs in EUROCRYPT 2016), we construct an efficient multi-identity fully homomorphic encryption (MIFHE) scheme by expanding a 'fresh' ciphertext under a single identity key to an 'expanded' one under a combined key that enables ciphertexts under different identities to be homomorphically evaluated.

Cite

CITATION STYLE

APA

Shen, T., Wang, F., Chen, K., Wang, K., & Li, B. (2019). Efficient Leveled (Multi) Identity-Based Fully Homomorphic Encryption Schemes. IEEE Access, 7, 79299–79310. https://doi.org/10.1109/ACCESS.2019.2922685

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