Results 141 to 150 of about 5,085 (174)
Some of the next articles are maybe not open access.

Circuit-Private Multi-key FHE

2017
Multi-key fully homomorphic encryption MFHE schemes allow polynomially many users without trusted setup assumptions to send their data encrypted under different FHE keys chosen by users independently of each other to an honest-but-curious server that can compute the output of an arbitrary polynomial-time computable function on this joint data and issue
Wutichai Chongchitmate, Rafail Ostrovsky
openaire   +2 more sources

Leveled FHE with Matrix Message Space

2018
Up to now, almost all fully homomorphic encryption (FHE) schemes can only encrypt bit or vector. In PKC 2015, Hiromasa et al. [12] constructed the only leveled FHE scheme that encrypts matrices and supports homomorphic matrix addition and multiplication.
Biao Wang, Xueqing Wang, Rui Xue 0001
openaire   +1 more source

LWE-Based FHE with Better Parameters

2015
Fully homomorphic encryption allows a remote server to perform computable functions over the encrypted data without decrypting them first. We propose a public-key fully homomorphic encryption with better parameters from the learning with errors problem.
Fuqun Wang   +2 more
openaire   +1 more source

Multi-key FHE from LWE, Revisited

2016
Traditional fully homomorphic encryption FHE schemes only allow computation on data encrypted under a single key. Lopez-Alt, Tromer, and Vaikuntanathan STOC 2012 proposed the notion of multi-key FHE, which allows homomorphic computation on ciphertexts encrypted under different keys, and also gave a construction based on a somewhat nonstandard ...
Chris Peikert, Sina Shiehian
openaire   +2 more sources

Fast Blind Rotation for Bootstrapping FHEs

2023
Binwu Xiang   +4 more
openaire   +2 more sources

The CKKS FHE Scheme

2023
Rashmi Agrawal, Ajay Joshi
openaire   +1 more source

Fully Dynamic Multi-Key FHE Without Gaussian Noise

IEEE Access, 2021
Yu Huang, Kaigui Wu
exaly  

FINAL: Faster FHE Instantiated with NTRU and LWE

Lecture Notes in Computer Science, 2023
Charlotte Bonte   +2 more
exaly  

On the Efficiency of FHE-Based Private Queries

IEEE Transactions on Dependable and Secure Computing, 2018
Myungsun Kim, Hyung Tae Lee, San Ling
exaly  

Home - About - Disclaimer - Privacy