loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Shabnam Khanna and Ciara Rafferty

Affiliation: Centre for Secure Information Technologies (CSIT), Queen’s University Belfast, U.K.

Keyword(s): Homomorphic Encryption, Approximate Computing, Task Skipping, Depth Reduction, Loop Perforation.

Abstract: This research proposes approximate computing techniques to accelerate homomorphic encryption (HE). In particular, the CKKS encryption scheme for approximate numbers is targeted. There is a requirement for HE in services dealing with confidential data, however current constructions are not efficient enough for real-time applications. A homomorphic encryption scheme which uses approximate arithmetic (showing faster results than previous HE schemes) already exists, the CKKS scheme, and this research applies a variation of the approximate computing techniques of task skipping and depth reduction (derived from loop perforation) to determine whether further approximating the functions evaluated using CKKS scheme can have a positive impact on performance of homomorphic evaluation. This is demonstrated via the evaluation of the logistic and exponential functions that this is possible, showing positive results. The speed up in running time for HE with task skipping is between 12.1% and 45.5%, depth reduction gives 35-45.5% speed-up with a small error difference than task skipping alone. The combination of both techniques corresponds to a halving of the running time, at the cost of increased error. This novel approach to further approximate homomorphic encryption shows that it is possible for certain functions, where running time is of paramount importance, that further approximations can be made with a lower-impacting greater error. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.82.58.213

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Khanna, S. and Rafferty, C. (2020). Accelerating Homomorphic Encryption using Approximate Computing Techniques. In Proceedings of the 17th International Joint Conference on e-Business and Telecommunications - SECRYPT; ISBN 978-989-758-446-6; ISSN 2184-7711, SciTePress, pages 380-387. DOI: 10.5220/0009828803800387

@conference{secrypt20,
author={Shabnam Khanna. and Ciara Rafferty.},
title={Accelerating Homomorphic Encryption using Approximate Computing Techniques},
booktitle={Proceedings of the 17th International Joint Conference on e-Business and Telecommunications - SECRYPT},
year={2020},
pages={380-387},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0009828803800387},
isbn={978-989-758-446-6},
issn={2184-7711},
}

TY - CONF

JO - Proceedings of the 17th International Joint Conference on e-Business and Telecommunications - SECRYPT
TI - Accelerating Homomorphic Encryption using Approximate Computing Techniques
SN - 978-989-758-446-6
IS - 2184-7711
AU - Khanna, S.
AU - Rafferty, C.
PY - 2020
SP - 380
EP - 387
DO - 10.5220/0009828803800387
PB - SciTePress