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

Journal of Computer Science and Technology

A Secure Scalar Product Protocol Against Malicious Adversaries

Bo Yang, Yong Hong Yu, Chung-Huang Yang

Published Jan 1, 2013• 5 citations
Publisher
DOI
10.1007/s11390-013-1319-3

Related papers

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

Yehuda Lindell, Benny Pinkas B

Journal of Cryptology•Apr 9, 2014•51 citations

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

Yehuda Lindell, Benny Pinkas B

Lecture notes in computer science•Jan 1, 2007•431 citations

Secure and Efficient Two-Party Quantum Scalar Product Protocol With Application to Privacy-Preserving Matrix Multiplication

Wenjie Liu, Zixian Li

Secure two-party scalar product (S2SP) is a promising research area within secure multiparty computation (SMC), which can solve a range of SMC problems, such as intrusion detection, data analysis, and geometric computations. However, existing quantum S2SP protocols are not efficient enough, and the complexity is usually close to exponential level. In this paper, a novel secure two-party quantum scalar product (S2QSP) protocol based on Fourier entangled states is proposed to achieve higher efficiency. Firstly, the definition of unconditional security under malicious models is given. And then, an honesty verification method called Entanglement Bondage is proposed, which is used in conjunction with the modular summation gate to resist malicious attacks. The property of Fourierentangled states is used to calculate the scalar product with polynomial complexity. The unconditional security of our protocol is proved, which guarantees the privacy of all parties. In addition, we design a privacy-preserving quantum matrix multiplication protocol based on S2QSP protocol. By transforming matrix multiplication into a series of scalar product processes, the product of two private matrices is calculated without revealing any privacy. Finally, we show our protocol’s feasibility in IBM Qiskit simulator.

arXiv:2309.15856•IEEE Transactions on Circuits and Systems I Regular Papers•Jul 21, 2023•18 citations

A protocol for the secure two-party quantum scalar product

Li-Bao He, Liusheng Huang, Wei Yang +1 more

Physics Letters A•Feb 28, 2012•13 citations

Scalar Product-Based Distributed Oblivious Transfer

Christian L. F. Corniaux, Hossein Ghodosi

Lecture notes in computer science•Jan 1, 2011•1 citation

Scalar-product based secure two-party computation

Chih-Hao Shen, Justin Z. Zhan, Tsan‐sheng Hsu +2 more

Secure multiparty computation is a very important research topic in cryptography. The sub-problem of secure multiparty computation that has received special attention by researchers because of its close relation to many cryptographic tasks is secure two-party computation. This area of research is concerned with the question: ldquoCan two party computation be achieved more efficiently and under weaker security assumptions than general multiparty computation?rdquo Yaopsilas protocol provided security against passive adversaries, while Lindell and Pinkas proposed secure two party protocols that are secure against active adversaries. In this paper, we would like to propose a set of information theoretically secure protocols based on scalar product protocol. The detailed complexity analysis is also provided.

IEEE International Conference on Granular Computing (GrC)•Aug 1, 2008•10 citations
Secure two-party scalar product (S2SP) is a promising research area within secure multiparty computation (SMC), which can solve a range of SMC problems, such as intrusion detection, data analysis, and geometric computations. However, existing quantum S2SP protocols are not efficient enough, and the complexity is usually close to exponential level. In this paper, a novel secure two-party quantum scalar product (S2QSP) protocol based on Fourier entangled states is proposed to achieve higher efficiency. Firstly, the definition of unconditional security under malicious models is given. And then, an honesty verification method called Entanglement Bondage is proposed, which is used in conjunction with the modular summation gate to resist malicious attacks. The property of Fourierentangled states is used to calculate the scalar product with polynomial complexity. The unconditional security of our protocol is proved, which guarantees the privacy of all parties. In addition, we design a privacy-preserving quantum matrix multiplication protocol based on S2QSP protocol. By transforming matrix multiplication into a series of scalar product processes, the product of two private matrices is calculated without revealing any privacy. Finally, we show our protocol’s feasibility in IBM Qiskit simulator.
Secure multiparty computation is a very important research topic in cryptography. The sub-problem of secure multiparty computation that has received special attention by researchers because of its close relation to many cryptographic tasks is secure two-party computation. This area of research is concerned with the question: ldquoCan two party computation be achieved more efficiently and under weaker security assumptions than general multiparty computation?rdquo Yaopsilas protocol provided security against passive adversaries, while Lindell and Pinkas proposed secure two party protocols that are secure against active adversaries. In this paper, we would like to propose a set of information theoretically secure protocols based on scalar product protocol. The detailed complexity analysis is also provided.