Papers
Topics
Authors
Recent
Search
2000 character limit reached

FHEBench: Benchmarking Fully Homomorphic Encryption Schemes

Published 1 Mar 2022 in cs.CR | (2203.00728v1)

Abstract: 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

Citations (8)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.