Hacker News new | ask | show | jobs
by cipherboy 2010 days ago
I'm a little rusty but I swear I saw a partial homomorphic encryption scheme for aggregates and analytics. I want to say Enigma conference, '16 or '17? Maybe by Boston University.

The benefit being that while you can run any computatio with a FHE, PHEs are generally faster.

IIRC Microsoft was also doing research on PHEs.

1 comments

Interesting, did Microsoft bring the research any further?
https://dl.acm.org/doi/abs/10.1145/2463676.2467797

Might be what I was thinking of. I'm sure you can find other publications as well. I'm no longer at University and I've lost touch with that professor so I'm not sure their current research.