TFHE: Fast Fully-Homomorphic Encryption Over the Torus
tfhe.github.io
TFHE: Fast Fully-Homomorphic Encryption Over the Torus
1–10 of 98 posts
Re: TFHE: Fast Fully-Homomorphic Encryption Over the Torus
#2For a layman like myself, downloading and skimming the reference papers at the bottom of the page, starting with Craig Gentry 2013's paper[1], really helped.
Re: TFHE: Fast Fully-Homomorphic Encryption Over the Torus
#3Is this available now? Can we do fast homomorphic encryption baby??
Re: TFHE: Fast Fully-Homomorphic Encryption Over the Torus
#4I feel like there are so many use cases for this library.
Re: TFHE: Fast Fully-Homomorphic Encryption Over the Torus
#5What operations can I do homomorphically with this library? The page says
"With the cloud-keyset, the library can evaluate a net-list of binary gates homomorphically at a rate of about 50 gates per second per core, without decrypting its input. It suffices to provide the sequence of gates, as well as ciphertexts of the input bits. And the library computes ciphertexts of the output bits."
but what does "evaluating a net list of binary gates" come to in practice? What operations could I expect to be able to perform?
Re: TFHE: Fast Fully-Homomorphic Encryption Over the Torus
#6This looks very interesting!
However, not being an expert on FHE, is there a way to leverage this on current RDBMS systems for example?
It says the library can evaluate binary gates. If we would like to run a SQL query for example, how do we translate it to a series of gates? Is it possible?
Or is this so low level that we basically would need to build our own "processor" with binary gates and then build the rest of the stack on top of it so we can, in the end, run a query?
Can anyone shed some light on how exactly can we take advantage of this library?
Re: TFHE: Fast Fully-Homomorphic Encryption Over the Torus
#7What operations can I do homomorphically with this library? The page says "With the cloud-keyset, the library can evaluate a net-list of binary gates homomorphically at a rate of about 50 gates per second per core, without decrypting its input. It suffices to provide the sequence of gates, as well as ciphertexts of the input bits. And the library computes ciphertexts of the output bits." but what does "evaluating a n…
> What operations can I do homomorphically with this library?
Basically anything. If you can generate a netlist of gates of your HE CPU, you can write a program to compute it (perhaps slowly, though).
Re: TFHE: Fast Fully-Homomorphic Encryption Over the Torus
#8This looks very interesting! However, not being an expert on FHE, is there a way to leverage this on current RDBMS systems for example? It says the library can evaluate binary gates. If we would like to run a SQL query for example, how do we translate it to a series of gates? Is it possible? Or is this so low level that we basically would need to build our own "processor" with binary gates and then build the rest of…
We could implement an idealized RISC processor in gates and "flash" it with a program..... That would be fun.
Re: TFHE: Fast Fully-Homomorphic Encryption Over the Torus
#9This looks very interesting! However, not being an expert on FHE, is there a way to leverage this on current RDBMS systems for example? It says the library can evaluate binary gates. If we would like to run a SQL query for example, how do we translate it to a series of gates? Is it possible? Or is this so low level that we basically would need to build our own "processor" with binary gates and then build the rest of…
Fully homomorphic encryption isn't tremendously useful for database queries - you end up having to put the entire database in a massive FHE ciphertext, then expressing the query as a circuit which requires time linear in the size of the database to return a result.
Re: TFHE: Fast Fully-Homomorphic Encryption Over the Torus
#10Will this be useful for machine learning in the same way as this ?
https://medium.com/numerai/encrypted-data-for-efficient-mark...