  Fully Homomorphic Encryption (FHE) emerges one of the most promising
solutions to privacy-preserving computing in an untrusted cloud. FHE can be
implemented by various schemes, each of which has distinctive advantages, i.e.,
some are good at arithmetic operations, while others are efficient when
implementing Boolean logic operations. Therefore, it is difficult for even
cryptography experts let alone average users to choose the "right" FHE scheme
to efficiently implement a specific application. Prior work only qualitatively
compares few FHE schemes. In this paper, we present an empirical study,
FHEBench, to quantitatively compare major FHE schemes
