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

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

Kartick Sutradhar, Hari Om

Published Nov 1, 2021• 18 citations
Publisher
DOI
10.1007/s11128-021-03334-3

Related papers

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

Fulin Li, Rongpei Li, Yixin Sun +1 more

Quantum Information Processing•Sep 17, 2026•0 citations

An Efficient Protocol for the Secure Multi-party Quantum Summation

Xiu‐Bo Chen, Gang Xu, Yixian Yang +1 more

International Journal of Theoretical Physics•Sep 6, 2010•97 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

Quantum protocols for secure multi-party summation

Zhaoxu Ji, Huanguo Zhang, Houzhen Wang +3 more

Quantum Information Processing•Apr 20, 2019•66 citations

Quantum secure multi-party computational geometry based on multi-party summation and multiplication

Zhao Dou, Yifei Wang, Zhaoqian Liu +3 more

Abstract Secure multi-party computational geometry is a branch of secure multi-party computation, which is applied in many important fields. But up to now, the research on how to solve this problem with quantum methods has just started. Therefore, we study the design of quantum secure multi-party computational geometry (QSMCG) protocols in this paper. As the foundation, we extend the two-party summation and multiplication protocols proposed by Sutradhar and Om to multi-party protocols. Then we propose three new QSMCG protocols. Our proposed quantum secure two-party distance computation protocol has improvement in efficiency and accuracy. And the proposed quantum secure multi-party polytope volume computation protocol as well as the quantum secure circle–circle intersection area computation protocol are designed for the first time. Moreover, these protocols are designed to use multi-third parties, which solves the problem of intermediate value leakage in computation. The correctness, security and performance of all these protocols are analyzed.

Quantum Science and Technology•Mar 18, 2024•8 citations

MASCOT

Marcel Keller, Emmanuela Orsini, Peter Schöll

We consider the task of secure multi-party computation of arithmetic circuits over a finite field. Unlike Boolean circuits, arithmetic circuits allow natural computations on integers to be expressed easily and efficiently. In the strongest setting of malicious security with a dishonest majority --- where any number of parties may deviate arbitrarily from the protocol --- most existing protocols require expensive public-key cryptography for each multiplication in the preprocessing stage of the protocol, which leads to a high total cost. We present a new protocol that overcomes this limitation by using oblivious transfer to perform secure multiplications in general finite fields with reduced communication and computation. Our protocol is based on an arithmetic view of oblivious transfer, with careful consistency checks and other techniques to obtain malicious security at a cost of less than 6 times that of semi-honest security. We describe a highly optimized implementation together with experimental results for up to five parties. By making extensive use of parallelism and SSE instructions, we improve upon previous runtimes for MPC over arithmetic circuits by more than 200 times.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Oct 24, 2016•413 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.
Abstract Secure multi-party computational geometry is a branch of secure multi-party computation, which is applied in many important fields. But up to now, the research on how to solve this problem with quantum methods has just started. Therefore, we study the design of quantum secure multi-party computational geometry (QSMCG) protocols in this paper. As the foundation, we extend the two-party summation and multiplication protocols proposed by Sutradhar and Om to multi-party protocols. Then we propose three new QSMCG protocols. Our proposed quantum secure two-party distance computation protocol has improvement in efficiency and accuracy. And the proposed quantum secure multi-party polytope volume computation protocol as well as the quantum secure circle–circle intersection area computation protocol are designed for the first time. Moreover, these protocols are designed to use multi-third parties, which solves the problem of intermediate value leakage in computation. The correctness, security and performance of all these protocols are analyzed.
We consider the task of secure multi-party computation of arithmetic circuits over a finite field. Unlike Boolean circuits, arithmetic circuits allow natural computations on integers to be expressed easily and efficiently. In the strongest setting of malicious security with a dishonest majority --- where any number of parties may deviate arbitrarily from the protocol --- most existing protocols require expensive public-key cryptography for each multiplication in the preprocessing stage of the protocol, which leads to a high total cost. We present a new protocol that overcomes this limitation by using oblivious transfer to perform secure multiplications in general finite fields with reduced communication and computation. Our protocol is based on an arithmetic view of oblivious transfer, with careful consistency checks and other techniques to obtain malicious security at a cost of less than 6 times that of semi-honest security. We describe a highly optimized implementation together with experimental results for up to five parties. By making extensive use of parallelism and SSE instructions, we improve upon previous runtimes for MPC over arithmetic circuits by more than 200 times.