Hello, I just made a post in which I argue that using Secure Multi-Party Computation is both safer (it doesn’t rely on computational assumptions and is information-theoretically secure) and faster than Fully Homomorphic Encryption by orders of magnitude (each XOR and AND gate is transformed into a constant number of operations, meaning that the resulting circuit is slower only up to a constant). There is no problem of noise adding up, and therefore there is no need for bootstrapping phases or security parameters!
Hello, I just made a post in which I argue that using Secure Multi-Party Computation is both safer (it doesn’t rely on computational assumptions and is information-theoretically secure) and faster than Fully Homomorphic Encryption by orders of magnitude (each XOR and AND gate is transformed into a constant number of operations, meaning that the resulting circuit is slower only up to a constant). There is no problem of noise adding up, and therefore there is no need for bootstrapping phases or security parameters!