A5066606693- Coding theory and cryptography
- Cryptography and Data Security
- Complexity and Algorithms in Graphs
Hangzhou Normal University
2019-2021
State Key Laboratory of Cryptology
2019-2021
The first identity-based fully homomorphic encryption (IBFHE) scheme was constructed from (IBE) and lattice-based cryptography by Gentry, Sahai, Waters in CRYPTO 2013. Their IBFHE is improved this paper, exploiting Alperin-Sheriff Peikert's tight simple noise analysis method when evaluating homomorphically Micciancio powerful novel trapdoor. Furthermore, using the masking scheme(Mukherjee Wichs EUROCRYPT 2016), we construct an efficient multi-identity (MIFHE) expanding a "fresh" ciphertext...
With the development of new computing models such as cloud computing, user’s data are at risk being leaked. Fully homomorphic encryption (FHE) provides a possible way to fundamentally solve problem. It enables third party who does not know anything about secret key and plaintexts homomorphically perform any computable functions on corresponding ciphertexts. In 2009, Gentry proposed first FHE scheme. After that, its inefficiency has always been bottleneck practical schemes applications. At...