Somewhat Homomorphic Encryption
Somewhat Homomorphic Encryption is a type of public-key encryption scheme that allows a limited number of homomorphic operations (specifically, a bounded number of additions and multiplications) on encrypted data, distinguishing it from fully homomorphic encryption by its restricted computational depth.
57
Publications
5.1K
Citations
163
Authors
96
Institutions
Publications per year
2017–2026
23
Parents
57
Efficient Fully Homomorphic Encryption from (Standard) LWE
Zvika Brakerski, Vinod Vaikuntanathan · 2011 · 1.5K citations
Xianrui Meng, Seny Kamara, Kobbi Nissim et al. · 2015 · 133 citations
1–5 of 57
163
5
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 163
96
KU Leuven
Leuven, Belgium
4 h-index
13 publications
551 citations

University of Toronto
Toronto, Canada
3 h-index
3 publications
2.1K citations
Saitama University
Saitama, Japan
3 h-index
4 publications
162 citations
National University of Singapore
Singapore, Singapore
3 h-index
6 publications
244 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
14 publications
409 citations

Worcester Polytechnic Institute
Worcester, United States
3 h-index
8 publications
375 citations
Agency for Science, Technology and Research
Singapore, Singapore
2 h-index
6 publications
306 citations
IBM (United States)
Armonk, United States
2 h-index
5 publications
651 citations
1–8 of 96
Repository · 7 publications · 1.1K citations
7
h-index
4 publications · 209 citations
4
h-index
2 publications · 76 citations
2
h-index
2 publications · 61 citations
2
h-index
2 publications · 52 citations
2
h-index
1–5