Eh? With secret sharing one can do computation on a shared secret where it is provable that no individual party can recover any information about the data with their share alone.

I don’t see why you conclude that FHE couldn’t be close to as secure as that. (Like, not information theoretically, but with computationally bounded adversaries.)

▲

filup 33 minutes ago | parent [-]

I'm not saying that you can't design a system for secure cloud computing.

	▲	drdeca 26 minutes ago \| parent [-]
		You said that FHE is an oxymoron, seemingly on the basis that in proper encryption the ciphertext is indistinguishable from noise, and you think this can’t be true of FHE. I am arguing to the contrary. In the secret sharing multi-party computation schemes, the individual shares of the secret are random and have no information about the plaintext. I see no reason that FHE can’t have ciphertexts indistinguishable from noise.