Skip to content

Comment on Homomorphic encryption implementationparent

Comments

I somehow can't reply to your other post - but this isn't proposing a model of computation that allows you to perform those operations (if x1 == 5) - that would defeat the purpose. The goal is to allow you to perform some commonly used operations (matrix multiplications etc) in a zero knowledge way. Checking for equality would just destroy the encryption.

No, FHE supports arbitrary computation. That's the point of FHE.

You may be thinking of HE. HE only allows add and mult operations. FHE extends HE to perform arbitrary computation.

(EDIT: To reply, click on "link". That will let you type out a reply while bypassing the flamewar prevention system. "Link" is next to my username, next to the "parent" link.)

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.