OpenMined: What is Homomorphic Encryption?

[@amoghkamattarcar9676]

Fantastic explanation. Thanks a ton !

[@riccardomencucci9040]

Great explanation and cool concept!

[@anshumansingh9184]

Great explanation ❤️ more videos like these please.

[@madduxclayton9047]

I guess I am kind of off topic but does anybody know of a good site to stream newly released series online?

[@erickluca6249]

@Maddux Clayton Flixportal :D

[@madduxclayton9047]

@Erick Luca thank you, signed up and it seems like a nice service :) I appreciate it !

[@erickluca6249]

@Maddux Clayton You are welcome :D

[@abogaziah]

this is awesome! ❤

[@VincentKun]

If all the video on topics i didn't knew were like this... great content

[@macknightxu2199]

3:45, clear description for Arbitrary function. impressive. A small question is whether the opposite of A is an opperation? BR

[@riccardomencucci9040]

A potential issue I see with the proposed polly cracker framework is memory usage. After encryption, an n-bit message can grow up to n*p bits. This can become a problem if either p or n is large, and they both have good reason to be: larger p means harder brute-force decryption, large n is typical of large messages. Is there an obvious solution I'm missing? If not, is there a way to work around this issue? Is this issue typical of other SWHE or HE schemas?

[@antoniolopardo4259]

Yep, you are right, this scheme is useful to learn about HE but it isn't nearly the most practical one. A lot of work goes into "packing" as much as possible in a single encrypted message, eprint.iacr.org/2012/565.pdf

[@saikongz]

Great video! Just one issue IMO, the bootstrapping part is not intuitive for me. Can anyone recommend other materials to help me understand bootstrapping? An example would be ideal. Thanks in advance!

[@Koyaanisqatsi2000]

Thank you!