Leveled Homomorphic Encryption

Leveled Homomorphic Encryption is a form of homomorphic encryption that permits only a bounded number of homomorphic operations, specifically designed to support computations of arbitrary but a priori bounded depth circuits, distinguishing it from fully homomorphic encryption which allows unbounded operations.

20

Publications

5.4K

Citations

66

Authors

50

Institutions

Publications per year

2017–2026

12

Authors

66

  1. CG
    Craig Gentry

    IBM (United States), United States

    4 publications · 3.5K citations

    4

    h-index

  2. ZB
    Zvika Brakerski

    Weizmann Institute of Science, Israel

    4 publications · 4K citations

    4

    h-index

  3. VV
    Vinod Vaikuntanathan

    Massachusetts Institute of Technology, United States

    4 publications · 4K citations

    4

    h-index

  4. NP
    Nigel P. Smart

    University of Bristol, United Kingdom

    1 publications · 18 citations

    1

    h-index

  5. KR
    Kurt Rohloff

    New Jersey Institute of Technology, United States

    1 publications · 69 citations

    1

    h-index

1–5 of 66

Venues

  1. IEEE Access

    3 publications · 98 citations

    3

    h-index

  2. IEEE Transactions on Computers

    1 publications · 54 citations

    1

    h-index

  3. arXiv (Cornell University)

    Repository · 1 publications · 33 citations

    1

    h-index

  4. Journal of Cryptology

    1 publications · 915 citations

    1

    h-index

  5. Designs Codes and Cryptography

    1 publications · 49 citations

    1

    h-index

1–5