Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

Jump to content

HElib

From Wikipedia, the free encyclopedia
HElib
DeveloperIBM
ReleaseMay 5, 2013; 13 years ago (2013-05-05)
Stable release
2.3.0 / July 18, 2023; 3 years ago (2023-07-18)
Written inC++
PlatformMicrosoft Windows, MacOS, Linux
LicenseApache License (2.0)
Websitehomenc.github.io/HElib
Repositorygithub.com/homenc/HElib

Homomorphic Encryption library or HElib is a free and open-source cross platform software developed by IBM that implements various forms of homomorphic encryption.[1][2]

History

[edit]

HElib was primarily developed by Shai Halevi and Victor Shoup, shortly after Craig Gentry was a researcher at IBM, with the initial release being on May 5, 2013.[3]

Features

[edit]

The library implements the Brakerski-Gentry-Vaikuntanathan (BGV) fully homomorphic encryption scheme, as well as optimizations such as Smart-Vercauteren ciphertext packing techniques.[4]

HElib is written in C++ and uses the NTL mathematical library.

References

[edit]
  1. An Implementation of homomorphic encryption., homenc, 2019-11-20, archived from the original on 2019-05-01, retrieved 2019-11-20
  2. Lanet, Jean-Louis; Toma, Cristian (2019). Innovative Security Solutions for Information Technology and Communications: 11th International Conference, SecITC 2018, Bucharest, Romania, November 8-9, 2018, Revised Selected Papers. Springer. p. 427. ISBN 9783030129422.
  3. "IBM takes a big new step in cryptography: practical homomorphic encryption". Naked Security. 2013-05-05. Archived from the original on 2018-10-06. Retrieved 2019-11-20.
  4. Halevi, Shai; Shoup, Victor (2014). "Algorithms in HElib". In Garay, Juan A.; Gennaro, Rosario (eds.). Advances in Cryptology – CRYPTO 2014. Lecture Notes in Computer Science. Vol. 8616. Springer Berlin Heidelberg. pp. 554–571. doi:10.1007/978-3-662-44371-2_31. ISBN 9783662443712.