Faster homomorphic comparison operations for BGV and BFV

Faster homomorphic comparison operations for BGV and BFV

Fully homomorphic encryption (FHE) allows to compute any function on encrypted values. However, in practice, there is no universal FHE scheme that is effi-cient in all possible use cases. In this work, we show that FHE schemes suitable for arithmetic circuits (e.g. BGV or BFV) have a similar perform...

Full description

Bibliographic Details
Main Authors: Iliashenko Ilia, Zucca Vincent
Format: Article
Language:English
Published: Sciendo 2021-07-01
Series:Proceedings on Privacy Enhancing Technologies
Subjects:
secure computation
fully homomorphic encryption
comparison operations
sorting
array minimum
Online Access:https://doi.org/10.2478/popets-2021-0046

Internet

https://doi.org/10.2478/popets-2021-0046

Similar Items