Computing Blindfolded on Data Homomorphically Encrypted under Multiple Keys: A Survey

doi:10.1145/3477139

Computing Blindfolded on Data Homomorphically Encrypted under Multiple Keys: A Survey

2021-10-08

7

PRE

AI

DOI：10.1145/3477139

Original request for help

Save

Abstract

En 中文

With capability of performing computations on encrypted data without needing the secret key, homomorphic encryption (HE) is a promising cryptographic technique that makes outsourced computations secure and privacy-preserving. A decade after Gentry's breakthrough discovery of how we might support arbitrary computations on encrypted data, many studies followed and improved various aspects of HE, such as faster bootstrapping and ciphertext packing. However, the topic of how to support secure computations on ciphertexts encrypted under multiple keys does not receive enough attention. This capability is crucial in many application scenarios where data owners want to engage in joint computations and are preferred to protect their sensitive data under their own secret keys. Enabling this capability is a non-trivial task. In this article, we present a comprehensive survey of the state-of-the-artmulti-key techniques and schemes that target different systems and threat models. In particular, we review recent constructions based on Threshold Homomorphic Encryption (ThHE) and Multi-Key Homomorphic Encryption (MKHE). We analyze these cryptographic techniques and schemes based on a new secure outsourced computation model and examine their complexities. We share lessons learned and draw observations for designing better schemes with reduced overheads.

Keywords:

Homomorphic encryption

privacy

security

cloud computing

Computing Blindfolded on Data Homomorphically Encrypted under Multiple Keys: A Survey

Abstract

Journal

Organization