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

Authors

163

  1. FV
    Fréderik Vercauteren

    KU Leuven, Belgium

    5 publications · 1.2K citations

    5

    h-index

  2. CG
    Craig Gentry

    IBM (United States), United States

    4 publications · 317 citations

    4

    h-index

  3. BS
    Berk Sunar

    Worcester Polytechnic Institute, United States

    4 publications · 174 citations

    4

    h-index

  4. SH
    Shai Halevi

    IBM (United States), United States

    4 publications · 317 citations

    4

    h-index

  5. YD
    Yarkın Doröz

    Worcester Polytechnic Institute, United States

    4 publications · 174 citations

    4

    h-index

1–5 of 163

Venues

  1. IACR Cryptology ePrint Archive

    Repository · 7 publications · 1.1K citations

    7

    h-index

  2. IEEE Transactions on Computers

    4 publications · 209 citations

    4

    h-index

  3. IEEE Internet of Things Journal

    2 publications · 76 citations

    2

    h-index

  4. Security and Communication Networks

    2 publications · 61 citations

    2

    h-index

  5. IEEE Access

    2 publications · 52 citations

    2

    h-index

1–5