Construct · 1 fields · 1 citations

BGV scheme: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
BGV scheme1 CONSTRUCTBGV schemeBRAKERSKI · PRIVACY-ENHANCING

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Privacy-enhancing computation

a leveled fully homomorphic encryption scheme based on ring learning with errors that manages noise by modulus switching instead of bootstrapping.

In privacy-enhancing computation, BGV scheme refers to a leveled fully homomorphic encryption scheme based on ring learning with errors that manages noise by modulus switching instead of bootstrapping. This meaning comes from Brakerski (2012) in Proceedings of the 3rd Innovations in Theoretical Computer Science Conference.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how BGV scheme sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

encryption1 fields · 1 citationsanchor · a standalone constructhomomorphic encryption1 fields · 1 citationsanchor · a standalone constructlearning with errors1 fields · 1 citationsanchor · a standalone construct

References

  1. Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2012). (Leveled) fully homomorphic encryption without bootstrapping. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. https://doi.org/10.1145/2090236.2090262

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct