Multiparty Homomorphic Encryption for IoV Based on Span Program and Conjugate Search Problem

With the rapid development of the automotive industry, research on the internet of vehicles (IoV) has become a hot topic in the field of automobiles. Considering the privacy of data collected from vehicles, this paper proposes a novel multiparty homomorphic encryption scheme (MHE) for secure multiparty computation without the need for a trusted third party. The scheme ensures efficient computation of data while preserving the privacy of each party’s data. It consists of four phases: construction, computation, recombination, and refreshing. In the recombination phase, the key is reconstructed using a span program, enabling secure computation among participating parties under a semi-honest model. Finally, we compare the proposed scheme with mainstream approaches and conduct experiments within the framework of federated learning. Through both experimental and theoretical analyses, the performance of the proposed scheme is comprehensively evaluated, demonstrating its efficiency and correctness.

Authors

Institutions

Publication Details

Journal
Cryptography
Published
2025-06-06
DOI
https://doi.org/10.3390/cryptography9020041
Citations
1
Primary Topic
Cooperative Communication and Network Coding
Type
article
Field-Weighted Citation Impact
1.49

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multiparty Homomorphic Encryption for IoV Based on Span Program and Conjugate Search Problem

Bo Mi, Ran Zeng, Siyuan Zeng, Fuyuan Wang et al.
1 citations
Cryptography
Cooperative Communication and Network Coding
1.49
article

Multiparty Homomorphic Encryption for IoV Based on Span Program and Conjugate Search Problem

Bo Mi, Ran Zeng, Siyuan Zeng, Fuyuan Wang, Qi Zhou
article en
1 citations

Abstract

With the rapid development of the automotive industry, research on the internet of vehicles (IoV) has become a hot topic in the field of automobiles. Considering the privacy of data collected from vehicles, this paper proposes a novel multiparty homomorphic encryption scheme (MHE) for secure multiparty computation without the need for a trusted third party. The scheme ensures efficient computation of data while preserving the privacy of each party’s data. It consists of four phases: construction, computation, recombination, and refreshing. In the recombination phase, the key is reconstructed using a span program, enabling secure computation among participating parties under a semi-honest model. Finally, we compare the proposed scheme with mainstream approaches and conduct experiments within the framework of federated learning. Through both experimental and theoretical analyses, the performance of the proposed scheme is comprehensively evaluated, demonstrating its efficiency and correctness.

CryptographyVol. 9(2)
Chongqing Jiaotong University (CN)
Natural Science Foundation of Chongqing, Chongqing Municipal Education Commission, Centre Scientifique et Technique du Bâtiment
Openalex Percentile: Top 16%
Cooperative Communication and Network Coding
1.49
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.

Multiparty Homomorphic Encryption for IoV Based on Span Program and Conjugate Search Problem — Bo Mi, Ran Zeng, et al. · Cryptography (2025) | TGRS Research Map | TGRS