Comment by feanaro
3 years ago
> 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?
3 years ago
> 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?
Either the amount of Boolean logic operations or the amount of integer additions and multiplications, as these are the operations FHE schemes support.
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.