Efficient Circuits for Permuting and Mapping Packed Values Across Leveled Homomorphic Ciphertexts

Efficient Circuits for Permuting and Mapping Packed Values Across Leveled Homomorphic Ciphertexts

Vos, J.V. (TU Delft Cyber Security)
Vos, D.A. (TU Delft Cyber Security)
Erkin, Z. (TU Delft Cyber Security)

Atluri, Vijayalakshmi (editor)
Di Pietro, Roberto (editor)
Jensen, Christian D. (editor)
Meng, Weizhi (editor)

2022

Cloud services are an essential part of our digital infrastructure as organizations outsource large amounts of data storage and computations. While organizations typically keep sensitive data in encrypted form at rest, they decrypt it when performing computations, leaving the cloud provider free to observe the data. Unfortunately, access to raw data creates privacy risks. To alleviate these risks, researchers have developed secure outsourced data processing techniques. Such techniques enable cloud services that keep sensitive data encrypted, even during computations. For this purpose, fully homomorphic encryption is particularly promising, but operations on ciphertexts are computationally demanding. Therefore, modern fully homomorphic cryptosystems use packing techniques to store and process multiple values within a single ciphertext. However, a problem arises when packed data in one ciphertext does not align with another. For this reason, we propose a method to construct circuits that perform arbitrary permutations and mappings of such packed values. Unlike existing work, our method supports moving values across multiple ciphertexts, considering that the values in real-world scenarios cannot all be packed within a single ciphertext. We compare our open-source implementation against the state-of-the-art method implemented in HElib, which we adjusted to work with multiple ciphertexts. When data is spread among five or more ciphertexts, our method outperforms the existing method by more than an order of magnitude. Even when we only consider a permutation within a single ciphertext, our method still outperforms the state-of-the-art works implemented by HElib for circuits of similar depth.

Applied cryptography
Data packing
Fully homomorphic encryption
Secure outsourced data processing

http://resolver.tudelft.nl/uuid:b61bcab1-d64d-4138-9c01-faefcc729b1c

https://doi.org/10.1007/978-3-031-17140-6_20

Springer

2023-04-01

9783031171390

Computer Security – ESORICS 2022 - 27th European Symposium on Research in Computer Security, Proceedings

27th European Symposium on Research in Computer Security, ESORICS 2022, 2022-09-26 → 2022-09-30, Virtual, Online

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 0302-9743, 13554 LNCS

Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.

Institutional Repository

conference paper

© 2022 J.V. Vos, D.A. Vos, Z. Erkin