Google’s fully homomorphic encryption compiler – a primer
1–10 of 168 posts
Re: Google’s fully homomorphic encryption compiler – a primer
#2[flagged]
Re: Google’s fully homomorphic encryption compiler – a primer
#3How many orders of magnitude slower is this?
Re: Google’s fully homomorphic encryption compiler – a primer
#4[flagged]
[deleted]
Re: Google’s fully homomorphic encryption compiler – a primer
#5How many orders of magnitude slower is this?
author shows a program that adds two integers and takes 7 seconds to run, and the way the system processes data results in 20000x the RAM usage
Re: Google’s fully homomorphic encryption compiler – a primer
#6Re: Google’s fully homomorphic encryption compiler – a primer
#7Re: Google’s fully homomorphic encryption compiler – a primer
#8How many orders of magnitude slower is this?
Adding two numbers takes 7 seconds, so many many many
But - it’s a lot better than it has been for FHE. This is progress even if it seems absurd.
Re: Google’s fully homomorphic encryption compiler – a primer
#9Curious if there's tooling to de/serialize the encryption context?
The examples aren't very useful to demonstrate "real" homomorphic encryption in the sense that it takes in plaintext directly; encrypt and transforms; then decrypts - I'd love to see a snub that takes encrypted input (only) and returns ciphertext of the result - that can then be decrypted on a client node provided the correct key?
Or is this supposed to be only proof of concept?
Cool stuff, either way.
Re: Google’s fully homomorphic encryption compiler – a primer
#10Someone needs to make a crypto network that runs submitted FHE programs as proof of work.