Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

Verifiable dynamic quantum secure multi-party multiplication protocol based on homomorphic encryption

Fulin Li, Rongpei Li, Yixin Sun, Shixin Zhu

Published Sep 17, 2026• 0 citations
Publisher
DOI
10.1007/s11128-026-05347-2

Related papers

Secure multi-party convex hull protocol based on quantum homomorphic encryption

Cheng Wang, Ri‐Gui Zhou

Quantum Information Processing•Dec 15, 2022•15 citations

Secure multi-party multiplication protocol based on homomorphic encryption technology

Xia Cha

Secure multi-party multiplication is a special secure multi-party computation problem, which can be used by multi-party to share the multiplication result. Present protocols frequently using the secure two-party multiplication protocol which has high communication cost and large amount of data. Based on the homomorphic encryption technology, a serial secure multi-party multiplication protocol in the complex communication environment and a parallel secure multi-party multiplication protocol in the ideal communication environment are presented for this problem in the semi-honest model.At last, correctness and security of those protocols are analyzed. Compared with the present protocols, the analysis shows that the proposed protocols have better advantages in the communication cost and the execution efficiency.

Computer Engineering and Applications Journal•Jan 1, 2015•0 citations

Practical multi-party quantum homomorphic encryption

Chen Lv, Lingli Chen, Qin Li

Theoretical Computer Science•Jul 16, 2023•16 citations

Efficient and robust two-party RSA key generation

Yang Muxiang, Hong Mei Fan, Minghui Zheng +1 more

An efficient two party RSA secret key sharing generation scheme based on a homomorphic encryption, which is semantically secure under the prime residuosity assumption, is proposed in this paper. At the stage of computing RSA modulo N , an initial distributed primality test protocol is used to reduce the computation complexity and increase the probability of N being a two-prime product. On the other aspect, the homomorphic encryption based sharing conversion protocols is devised and adopted in multi-party computing modulus N and secret key d . Comparing to any sharing conversion protocols based on oblivious transfer protocol, the homomorphic encryption based sharing conversion protocols are of high performance. Our scheme resists the passive attack and since a method of verifying the sharing was introduced in, the scheme can resists any cheating behaviors too. Security proof, computation complexity and communication complexity analysis are given at last.

Wuhan University Journal of Natural Sciences•Nov 1, 2006•1 citation

A cost-effective quantum protocol for secure multi-party multiplication

Kartick Sutradhar, Hari Om

Quantum Information Processing•Nov 1, 2021•18 citations

Secure Multiparty Logical AND Based on Quantum Homomorphic Encryption and Its Applications

Xinglan Zhang, Yunxin Xi

International Journal of Theoretical Physics•Sep 12, 2024•2 citations
Secure multi-party multiplication is a special secure multi-party computation problem, which can be used by multi-party to share the multiplication result. Present protocols frequently using the secure two-party multiplication protocol which has high communication cost and large amount of data. Based on the homomorphic encryption technology, a serial secure multi-party multiplication protocol in the complex communication environment and a parallel secure multi-party multiplication protocol in the ideal communication environment are presented for this problem in the semi-honest model.At last, correctness and security of those protocols are analyzed. Compared with the present protocols, the analysis shows that the proposed protocols have better advantages in the communication cost and the execution efficiency.
An efficient two party RSA secret key sharing generation scheme based on a homomorphic encryption, which is semantically secure under the prime residuosity assumption, is proposed in this paper. At the stage of computing RSA modulo N , an initial distributed primality test protocol is used to reduce the computation complexity and increase the probability of N being a two-prime product. On the other aspect, the homomorphic encryption based sharing conversion protocols is devised and adopted in multi-party computing modulus N and secret key d . Comparing to any sharing conversion protocols based on oblivious transfer protocol, the homomorphic encryption based sharing conversion protocols are of high performance. Our scheme resists the passive attack and since a method of verifying the sharing was introduced in, the scheme can resists any cheating behaviors too. Security proof, computation complexity and communication complexity analysis are given at last.