You are looking at a specific version 20210408:153647 of this paper. See the latest version.

Paper 2021/315

Faster homomorphic comparison operations for BGV and BFV

Ilia Iliashenko and Vincent Zucca

Abstract

Fully homomorphic encryption (FHE) allows to compute any function on encrypted values. However, in practice, there is no universal FHE scheme that is efficient 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 performance as FHE schemes for non-arithmetic circuits (TFHE) in basic comparison tasks such as less-than, maximum and minimum operations. Our implementation of the less-than function in the HElib library is up to 3 times faster than the prior work based on BGV/BFV. It allows to compare a pair of 64-bit integers in 11 milliseconds, sort 64 32-bit integers in 19 seconds and find the minimum of 64 32-bit integers in 9.5 seconds on an average laptop without multi-threading.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Minor revision. PoPETS 2021
Keywords
secure computationhomomorphic encryptioncomparison operations
Contact author(s)
ilia @ esat kuleuven be,vincent zucca @ univ-perp fr
History
2021-04-08: revised
2021-03-11: received
See all versions
Short URL
https://ia.cr/2021/315
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.