Time-Memory Trade-off Algorithms for Homomorphically Evaluating Look-up Table in TFHE
Abstract
References
Index Terms
- Time-Memory Trade-off Algorithms for Homomorphically Evaluating Look-up Table in TFHE
Recommendations
Revisiting Stream-Cipher-Based Homomorphic Transciphering in the TFHE Era
Foundations and Practice of SecurityAbstractTransciphering allows to workaround the large expansion of the size of FHE encrypted data, thanks to the use of symmetric cryptography. Transciphering is a recryption technique that delegates the effective homomorphic encryption to the cloud. As a ...
Efficient fully homomorphic encryption with circularly secure key switching process
Fully homomorphic encryption (FHE) has important applications in cloud computing. However, almost all fully homomorphic encryption schemes share two common flaws that they all use large-scale secret keys and some operations are inefficient. In this paper,...
A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE
We study the hardness of learning with errors (LWE) problem with some equation constraints ($$\hbox {LWE}_{n,l,q,\chi }$$LWEn,l,q,?, some-are-errorless LWE). Previously, it was proved that LWE with one equation (first-is-errorless LWE) can be made as ...
Comments
Information & Contributors
Information
Published In
- Program Chairs:
- Flavio Bergamaschi,
- Anamaria Costache,
- Kurt Rohloff
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
Acceptance Rates
Upcoming Conference
- Sponsor:
- sigsac
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 16Total Downloads
- Downloads (Last 12 months)16
- Downloads (Last 6 weeks)12
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in