.png){kind=icon}
Return
Efficient Leveled (Multi) Identity-Based Fully Homomorphic Encryption Schemes
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2922685.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Fully homomorphic encryption
identity-based encryption
identity-based fully homomorphic encryption
learning with errors
multi-identity fully homomorphic encryption
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveTheory of diffusion charging of arbitrarily shaped conductive aerosol particles by unipolar ions
PREAI
ShareSaveShareSave
View more