Homomorphic Encryption
Homomorphic Encryption is a form of encryption that belongs to the class of cryptographic systems wherein computations on plaintext can be performed on ciphertext without requiring decryption, distinguishing itself by preserving algebraic structure through computable operations on encrypted data.
3.4K
Publications
189.5K
Citations
7.6K
Authors
1.9K
Institutions
Publications per year
2017–2026
2.1K
3.4K
Fully homomorphic encryption using ideal lattices
Craig Gentry · 2009 · 6.6K citations
A fully homomorphic encryption scheme
Dan Boneh, Craig Gentry · 2009 · 2.4K citations
1–5 of 3.4K
7.6K
27
h-index
24
h-index
21
h-index
21
h-index
Massachusetts Institute of Technology, United States
24 publications · 8.7K citations
20
h-index
1–5 of 7.6K
1.9K

Xidian University
Xi'an, China
32 h-index
176 publications
8.6K citations
Seoul National University
Seoul, South Korea
32 h-index
175 publications
11.9K citations

Harbin Institute of Technology
Harbin, China
30 h-index
126 publications
11.2K citations

Chinese Academy of Sciences
Beijing, China
29 h-index
84 publications
7.1K citations

University of Electronic Science and Technology of China
Chengdu, China
27 h-index
103 publications
5.4K citations

City University of Hong Kong
Hong Kong, Hong Kong
26 h-index
55 publications
6.1K citations

Dalian Maritime University
Dalian, China
26 h-index
70 publications
5.1K citations
Microsoft (United States)
Redmond, United States
26 h-index
71 publications
8.6K citations
1–8 of 1.9K
177 publications · 6.4K citations
43
h-index
61 publications · 7.5K citations
41
h-index
64 publications · 6.2K citations
40
h-index
54 publications · 5.4K citations
39
h-index
79 publications · 4.3K citations
38
h-index
1–5