Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols / secure computation, homomorphic encryption, comparison operations

Original Publication (with minor differences): PoPETS 2021

Date: received 9 Mar 2021, last revised 8 Apr 2021

Contact author: ilia at esat kuleuven be,vincent zucca@univ-perp fr

Available format(s): PDF | BibTeX Citation

Version: 20210408:153647 (All versions of this report)

Short URL: ia.cr/2021/315


[ Cryptology ePrint archive ]