Efficient Parallel Binary Operations on Homomorphic Encrypted Real Numbers

Jim Basilakis

doi:10.1109/TETC.2019.2906047

Efficient Parallel Binary Operations on Homomorphic Encrypted Real Numbers

2021-01-01

1

PRE

AI

DOI：10.1109/TETC.2019.2906047

原文链接

原文求助

摘要

En 中文

A number of homomorphic encryption application areas could be better enabled if there existed a general solution for combining sufficiently expressive logical and numerical circuit primitives. This paper examines accelerating binary operations on real numbers suitable for somewhat homomorphic encryption. A parallel solution based on Single Instruction Multiple Data (SIMD) can be used to efficiently perform combined addition, subtraction and comparison-based operations on packed binary operands in a single step. The result maximises computational efficiency, memory space usage and minimises multiplicative circuit depth. General application and performance of these accelerated binary primitives are demonstrated in a number of case studies, including min-max and sorting operations.

Keyword:

Encoding

Encryption

Acceleration

Adders

Circuit synthesis

Sorting

Homomorphic encryption

somewhat homomorphic encryption (SWHE)

fully homomorphic encryption (FHE)

comparison

sorting

min-max

Efficient Parallel Binary Operations on Homomorphic Encrypted Real Numbers

摘要

AI总结

期刊

机构