.png){kind=icon}
.png){kind=icon}
Return
Multikey Verifiable Homomorphic Encryption
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2022.3197634.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A homomorphic encryption (HE) scheme is an advanced encryption technology which allows any user receiving ciphertexts;
perform computations over them in a public manner. An important application of an HE scheme is a private delegating computation where clients encrypt their secret data, send the ciphertexts;
a (computationally powerful) server who perform computations over encrypted data. In this application, one of the crucial problems is that the delegated server might be not trusted one and in this case, we cannot believe that a server always returns correct computation results. To solve this problem, Lai et al. (ESORICS 2014) proposed a verifiable homomorphic encryption (VHE) as a core primitive realizing private and verifiable secure delegating computation. However, their VHE scheme only supports homomorphic evaluation over ciphertexts generated by a single user. In this paper, we propose a formalization and its construction of multi-key verifiable homomorphic encryption (MVHE), which is a new cryp;
graphic primitive for realizing private and verifiable delegated computation in the multi-client setting. Our construction can be obtained by combining a multi-key homomorphic encryption scheme and a multi-key homomorphic encrypted authentication scheme, which is also a new primitive provided in this work.
Keywords:
Servers
Homomorphic encryption
Cryp
graphy
Authentication
Predictive models
Computational modeling
Computational efficiency
Homomorphic encryption
secure delegating computation
verifiability
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W