This is the homepage for the implementation of homomorphic secret sharing.

A (2-party) HSS scheme splits an input $x$ into shares $(x_0, x_1)$ such that each share computationally hides $x$, and there exists an efficient homomorphic evaluation algorithm $\mathsf{Eval}$ such that for any function (or “program”) $P$ from a given class it holds that $\mathsf{Eval}(x_0,P)+\mathsf{Eval}(x_1,P)=P(x)$.

HSS schemes were introduced by Boyle et al. (Crypto 2016, Eurocrypt 2017, CCS 2017). Here we implement both the naïve algorithms as well as the optimized version proposed in CCS’17. Extended benchmarks as well as performance graphs are available.

Looking for the implementation of a particular component?

The latest release is available for download (.sig). The package is not copyrighted, and released into the public domain.

For bug reports and comments concerning the specific implementation, please use my email address; for any other question or comment please refer to the paper authors as a whole.

##### Acknowledgments
Elette Boyle was supported by ISF grant 1861/16, AFOSR Award FA9550-17-1-0069, and ERC grant 307952. Geoffroy Couteau was supported by ERC grant 339563 (project CryptoCloud). Yuval Ishai was supported by ISF grant 1638/15, a grant by the BGU Cyber Center, and by the European Union's Horizon 2020 ICT program (Mikelangelo project). Niv Gilboa was supported by a DARPA/ARL SAFEWARE award, DARPA Brandeis program under Contract N66001-15-C-4065, NSF Frontier Award 1413955, NSF grants 1619348, 1228984, 1136174, and 1065276, ERC grant 742754, NSF-BSF grant 2015782, ISF grant 1709/14, BSF grant 2012378, a Xerox Faculty Research Award, a Google Faculty Research Award, an equipment grant from Intel, and an Okawa Foundation Research Grant. This material is based upon work supported by the Defense Advanced Research Projects Agency through the ARL under Contract W911NF-15-C-0205. Michele Orrù was supported by ERC grant 639554 (project aSCEND).