A Practical TFHE-Based Multi-Key Homomorphic Encryption with Linear Complexity and Low Noise Growth
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F24%3A00371461" target="_blank" >RIV/68407700:21230/24:00371461 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/978-3-031-50594-2_1" target="_blank" >https://doi.org/10.1007/978-3-031-50594-2_1</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-031-50594-2_1" target="_blank" >10.1007/978-3-031-50594-2_1</a>
Alternative languages
Result language
angličtina
Original language name
A Practical TFHE-Based Multi-Key Homomorphic Encryption with Linear Complexity and Low Noise Growth
Original language description
Fully Homomorphic Encryption enables arbitrary computations over encrypted data and it has a multitude of applications, e.g., secure cloud computing in healthcare or finance. Multi-Key Homomorphic Encryption (MKHE) further allows to process encrypted data from multiple sources: the data can be encrypted with keys owned by different parties. In this paper, we propose a new variant of MKHE instantiated with the TFHE scheme. Compared to previous attempts by Chen et al. and by Kwak et al., our scheme achieves computation runtime that is linear in the number of involved parties and it outperforms the faster scheme by a factor of 4.5–6.9x, at the cost of a slightly extended pre-computation. In addition, for our scheme, we propose and practically evaluate parameters for up to 128 parties, which enjoy the same estimated security as parameters suggested for the previous schemes (100 bits). It is also worth noting that our scheme—unlike the previous schemes—did not experience any error in any of our seven setups, each running 1000 trials.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
28th European Symposium on Research in Computer Security, The Hague, The Netherlands, September 25–29, 2023, Proceedings, Part I
ISBN
978-3-031-50593-5
ISSN
0302-9743
e-ISSN
—
Number of pages
21
Pages from-to
3-23
Publisher name
Springer Nature Switzerland AG
Place of publication
Basel
Event location
The Hague
Event date
Sep 25, 2023
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
001208355200001