On Homomorphic Secret Sharing from Polynomial-Modulus LWE

ePrint Report: On Homomorphic Secret Sharing from Polynomial-Modulus LWE

Thomas Attema, Pedro Capitão, Lisa Kohl

Homomorphic secret sharing (HSS) is a form of secret sharing that supports the local evaluation of functions on the shares, with applications to multi-server private information retrieval, secure computation, and more.
Insisting on additive reconstruction, all known instantiations of HSS from "Learning with Error (LWE)"-type assumptions either have to rely on LWE with superpolynomial modulus, come with non-negligible error probability, and/or have to perform expensive …

applications computation eprint report error evaluation functions information local non private report secret secure computation server sharing thomas