Lattice-Based Multi-Key Homomorphic Encryption Scheme Without Common Random Strings

Multi-key homomorphic encryption is widely applied into outsourced computing and privacy-preserving applications in multi-user scenarios. However, the existence of Common Random Strings (CRSs) weakens the ability of users to independently generate public keys, and it is difficult to implement in decentralized systems or scenarios with low trust requirements. In order to reduce excessive reliance on public parameters, a multi-key homomorphic encryption scheme without pre-setting CRSs is proposed based on a distributed key generation protocol. The proposed scheme does not require the pre-generation and distribution of CRSs, which enhances the security and decentralization of the scheme. Furthermore, in order to further protect the plaintext privacy from each user, by embedding the specified target user into the ciphertext, this paper proposes an enhanced multi-key homomorphic encryption scheme that allows the target user to decrypt. Finally, this paper applies the proposed lattice-based multi-key homomorphic encryption scheme into the data submission stage of the perceived users, and thereby proposes a crowd-sensing scheme with privacy preservation.

Authors

Institutions

Publication Details

Journal
Symmetry
Published
2025-05-09
DOI
https://doi.org/10.3390/sym17050722
Citations
1
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Lattice-Based Multi-Key Homomorphic Encryption Scheme Without Common Random Strings

H.W. Liu, Mengxue Shang, Dandan Zhang, Hongyi Zhang
1 citations
Symmetry
Cryptography and Data Security
2.48
article

Lattice-Based Multi-Key Homomorphic Encryption Scheme Without Common Random Strings

H.W. Liu, Mengxue Shang, Dandan Zhang, Hongyi Zhang
article en
1 citations

Abstract

Multi-key homomorphic encryption is widely applied into outsourced computing and privacy-preserving applications in multi-user scenarios. However, the existence of Common Random Strings (CRSs) weakens the ability of users to independently generate public keys, and it is difficult to implement in decentralized systems or scenarios with low trust requirements. In order to reduce excessive reliance on public parameters, a multi-key homomorphic encryption scheme without pre-setting CRSs is proposed based on a distributed key generation protocol. The proposed scheme does not require the pre-generation and distribution of CRSs, which enhances the security and decentralization of the scheme. Furthermore, in order to further protect the plaintext privacy from each user, by embedding the specified target user into the ciphertext, this paper proposes an enhanced multi-key homomorphic encryption scheme that allows the target user to decrypt. Finally, this paper applies the proposed lattice-based multi-key homomorphic encryption scheme into the data submission stage of the perceived users, and thereby proposes a crowd-sensing scheme with privacy preservation.

SymmetryVol. 17(5)
Qufu Normal University (CN), China Metallurgical Geology Bureau (CN)
Openalex Percentile: Top 11%
Cryptography and Data Security
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Lattice-Based Multi-Key Homomorphic Encryption Scheme Without Common Random Strings — H.W. Liu, Mengxue Shang, et al. · Symmetry (2025) | TGRS Research Map | TGRS