Efficient parallel binary operations on homomorphic encrypted real numbers

Jim Basilakis; Bahman Javadi

doi:10.1109/TETC.2019.2906047

Efficient parallel binary operations on homomorphic encrypted real numbers

Jim Basilakis, Bahman Javadi

Western Sydney University

Research output: Contribution to journal › Article › peer-review

6 Citations (Scopus)

Abstract

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 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.

Original language	English
Pages (from-to)	507-519
Number of pages	13
Journal	IEEE Transactions on Emerging Topics in Computing
Volume	9
Issue number	1
DOIs	https://doi.org/10.1109/TETC.2019.2906047
Publication status	Published - 2021

Keywords

data encryption (computer science)
homomorphisms (mathematics)

Access to Document

10.1109/TETC.2019.2906047

Cite this

@article{95ab84cfe9954450aec2354b5fe789e1,

title = "Efficient parallel binary operations on homomorphic encrypted real numbers",

abstract = "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 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.",

keywords = "data encryption (computer science), homomorphisms (mathematics)",

author = "Jim Basilakis and Bahman Javadi",

year = "2021",

doi = "10.1109/TETC.2019.2906047",

language = "English",

volume = "9",

pages = "507--519",

journal = "IEEE Transactions on Emerging Topics in Computing",

issn = "2168-6750",

publisher = "Institute of Electrical and Electronics Engineers",

number = "1",

}

TY - JOUR

T1 - Efficient parallel binary operations on homomorphic encrypted real numbers

AU - Basilakis, Jim

AU - Javadi, Bahman

PY - 2021

Y1 - 2021

N2 - 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 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.

AB - 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 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.

KW - data encryption (computer science)

KW - homomorphisms (mathematics)

UR - http://hdl.handle.net/1959.7/uws:51652

U2 - 10.1109/TETC.2019.2906047

DO - 10.1109/TETC.2019.2906047

M3 - Article

SN - 2168-6750

VL - 9

SP - 507

EP - 519

JO - IEEE Transactions on Emerging Topics in Computing

JF - IEEE Transactions on Emerging Topics in Computing

IS - 1

ER -

Efficient parallel binary operations on homomorphic encrypted real numbers

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this