Skip to content

Algorithms in HElib

Authors: S. Halevi; V. Shoup
Year: 2014
Venue: IBM

type: library collection: catalogue, sok-references status: auto

Links: ePrint 2014/106

Summary

Auto-extracted summary (unreviewed)

This IBM report by Halevi and Shoup documents the algorithms and optimisations inside HElib, the open-source C++ library implementing the BGV scheme with Smart-Vercauteren SIMD packing and Gentry-Halevi-Smart optimisations. Treating the cryptosystem as a SIMD 'hardware platform' with its own cost model, it describes how data movement and simple linear algebra are realised over packed ciphertexts: permutations via shift networks, Benes networks and hypercube networks, running and total sums, replication, matrix-vector multiplication, norms and traces, and rotations/shifts on the hypercube structure.

Abstract

HElib is a software library that implements homomorphic encryption (HE), specifically the Brakerski-Gentry-Vaikuntanathan (BGV) scheme, focusing on effective use of the Smart- Vercauteren ciphertext packing techniques and the Gentry-Halevi-Smart optimizations. The underlying cryptosystem serves as the equivalent of a “hardware platform” for HElib, in that it defines a set of operations that can be applied homomorphically, and specifies their cost. This “platform” is a SIMD environment (somewhat similar Intel SSE and the like), but with a unique cost metrics and parameters. In this report we describe some of the algorithms and optimization techniques that are used in HElib for data movement and simple linear algebra over this “platform.”
Source: pdf

Extracted details

Field Value Source Confidence
contribution description of HElib's algorithms for data movement over packed BGV ciphertexts llm 0.80
contribution permutation networks (shift, Benes, general Benes, hypercube) with depth/cost balancing llm 0.80
contribution replication, running/total sums and matrix-vector multiplication over the SIMD platform llm 0.80
contribution computing norms and traces homomorphically llm 0.80
contribution implementation of linear rotations and shifts on the hypercube llm 0.80
schemes BGV llm 0.80
libraries HElib llm 0.80
tasks data movement over packed ciphertexts llm 0.80
tasks homomorphic linear algebra llm 0.80
interaction non-interactive FHE llm 0.80
code url https://github.com/shaih/HElib/ llm 0.80
llm relevance low llm 0.80

System card: HElib

Group 7. FHE libraries, GPU back-ends and compilers
Family BGV, CKKS
Arithmetic C++
Interaction Library
Model scale -
Status Niche
Relation to the SoK First major HE library; BGV focus.
Note Apache-2.0. Maintenance mode.
Code https://github.com/homenc/HElib
Systems page HElib

SoK reference [72]

S. Halevi and V. Shoup, “Algorithms in HElib,” in Advances in Cryptology – CRYPTO 2014, Part I, ser. Lecture Notes in Computer Science, J. A. Garay and R. Gennaro, Eds., vol. 8616. Santa Barbara, CA, USA: Springer Berlin Heidelberg, Germany, Aug. 17– 21, 2014, pp. 554–571.

Listed on the reference page of the site.

Keyword mentions

Counts of vocabulary terms in the full text (first page of occurrence in brackets).

  • scheme: BGV 5 [p.1], Leveled / somewhat HE 4 [p.3], NTRU 2 [p.3], MPC 2 [p.19]
  • library: HElib 12 [p.1]
  • technique: Rotations 60 [p.2], SIMD packing 16 [p.1]
  • assumption: LWE 3 [p.4], RLWE 2 [p.3], Lattice-based 2 [p.19]
  • topic: Homomorphic encryption 22 [p.1], Open source 2 [p.3]

Files

Path (under papers/) Collection Pages Size SHA-256 Note
references/catalogue/7-095_algorithms-in-helib.pdf catalogue 20 560.9 KB 113c7eb2d8c8
references/sok-references/072_algorithms-in-helib.pdf sok-references 20 560.9 KB 113c7eb2d8c8 byte-identical to references/catalogue/7-095_algorithms-in-helib.pdf

Database key: algorithms-in-helib · created 2026-11-05 · updated 2026-11-05 · edit with python3 tools/paperdb.py set algorithms-in-helib COLUMN VALUE