9 citations · 12 across the 3 of their papers we have counts for
3 papers
cs.DS2017★ 3 cited
Optimizing relinearization in circuits for homomorphic encryption
Hao Chen
Fully homomorphic encryption (FHE) allows an untrusted party to evaluate arithmetic cir- cuits, i.e., perform additions and multiplications on encrypted data, without having the de…
cs.CR2017
Attacks on the Search-RLWE problem with small errors
Hao Chen, Kristin Lauter, Katherine E. Stange
The Ring Learning-With-Errors (RLWE) problem shows great promise for post-quantum cryptography and homomorphic encryption. We describe a new attack on the non-dual search RLWE prob…
cs.CR2017★ 9 cited
Security considerations for Galois non-dual RLWE families
Hao Chen, Kristin Lauter, Katherine E. Stange
We explore further the hardness of the non-dual discrete variant of the Ring-LWE problem for various number rings, give improved attacks for certain rings satisfying some additiona…