Score:3

fully homomorphic encryption without bootstrapping

us flag

In this paper by Alperin-Sheriff and Peikert from 2014, the authors state

To date, bootstrapping remains the only known way of obtaining fully homomorphic encryption for arbitrary unbounded computations.

Is this still correct today or are there new schemes that don't require bootstrapping for the same effect?

Are there any newer FHE schemes that don't have noise accumulation and therefore don't need bootstrapping?

Celdor avatar
us flag
I found this [paper](https://arxiv.org/abs/2109.02731) from 2021 where the authors state the same thing but don't back it up with sources. They might refer to the same paper from 2014.
I sit in a Tesla and translated this thread with Ai:

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.