News for hackers. Stuff that matters.
Re:Show HN: Read Wikipedia privately using homomorphic encry... by feanaro on Wednesday June 08, 2022 @04:58PM (#31674043)
> can compute an arbitrarily large function on the encrypted data

What is the meaning of the word "large" here? How are we defining the size of a function?

Re:Show HN: Read Wikipedia privately using homomorphic encry... by Confiks on Wednesday June 08, 2022 @05:30PM (#31674515)
Either the amount of Boolean logic operations or the amount of integer additions and multiplications, as these are the operations FHE schemes support.
Re:Show HN: Read Wikipedia privately using homomorphic encry... by blintz on Thursday June 09, 2022 @01:09AM (#31677755)
It's generally multiplicative depth; that is, the number of ciphertext-ciphertext multiplications that feed into each other. The primary way we define and evaluate functions in FHE is as Boolean (or sometimes arithmetic) circuits, so "depth" is in that context.