International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

SoK: Learning With Errors, Circular Security, and Fully Homomorphic Encryption

Authors:
Daniele Micciancio , UCSD, USA
Vinod Vaikuntanathan , MIT, USA
Download:
Search ePrint
Search Google
Presentation: Slides
Conference: PKC 2024
Abstract: All known constructions of fully homomorphic encryption (FHE) schemes from the learning with errors (LWE) assumption require the encryption schemes to be circular secure. A long-standing open problem in the study of FHE schemes is to demonstrate evidence for their circular security. In this work, we systematize the flavors of circular security required for a number of FHE constructions, formulate circular security conjectures, show search-to-decision reductions for them, and pose several open problems.
BibTeX
@inproceedings{pkc-2024-33788,
  title={SoK: Learning With Errors, Circular Security, and Fully Homomorphic Encryption},
  publisher={Springer-Verlag},
  author={Daniele Micciancio and Vinod Vaikuntanathan},
  year=2024
}