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

Lecture notes in computer science

Oblivious Scalar-Product Protocols

Huafei Zhu, Feng Bao

Published Jan 1, 2006• 3 citations
Publisher
DOI
10.1007/11780656_26

Related papers

Scalar Product-Based Distributed Oblivious Transfer

Christian L. F. Corniaux, Hossein Ghodosi

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

On Fast Private Scalar Product Protocols

Ju-Sung Kang, Dowon Hong

Communications in computer and information science•Jan 1, 2011•3 citations

Privacy-preserving Scalar Product Comparison Protocol

Jun Sakuma, Kobayashi Shigenobu

IEICE Technical Report; IEICE Tech. Rep.•Jul 14, 2006•0 citations

A Secure Scalar Product Protocol Against Malicious Adversaries

Bo Yang, Yong Hong Yu, Chung-Huang Yang

Journal of Computer Science and Technology•Jan 1, 2013•5 citations

Optimally Efficient Secure Scalar Product With Applications in Cloud Computing

Babak Siabi, Mehdi Berenjkoub, Willy Susilo

Secure computation of scalar product is of considerable importance due to its central role in many practical computation scenarios with privacy and security requirements. This paper includes new results about the secure two-party scalar product. Specifically, a perfectly secure and universally composable two-party split scalar product (SSP) protocol is proposed in the preprocessing model. In addition to full security, the proposed SSP protocol enjoys the advantage of optimal efficiency. To show the optimality of this SSP protocol, information theoretic lower bounds on the amount of communicated data in a secure two-party computation in the preprocessing model are derived. These bounds are not limited to SSP functionality but apply to a large class of two-party functionalities. A part of this paper is devoted to applications of the proposed SSP protocol in secure cloud computing. Specifically, based on this protocol, a cloud-assisted privacy-preserving profile-matching scheme and a secure remote health monitoring scheme are proposed. Both of the solutions are highly efficient and significantly improve the previous work.

IEEE Access•Jan 1, 2019•5 citations

Relation of PPAtMP and scalar product protocol and their applications

Youwen Zhu, Liusheng Huang, Wei Yang

Scalar product protocol and privacy preserving add to multiply protocol (PPAtMP) are two significant basic secure multiparty computation protocols. In this paper, we claim that the two protocols are equivalent to each other and we can achieve one based on the other with the same communication and computation complexity. Then, we propose Secure Two-party Mean Protocol, Secure Shared x ln x Protocol and Secure Shared Generic Polynomial Protocol based on scalar product protocol and PPAtMP. Additionally, we analyze the correctness, security, communication overheads and computation complexity of each protocol proposed in this paper.

IEEE Symposium on Computers and Communications (ISCC)•Jun 1, 2010•8 citations
Secure computation of scalar product is of considerable importance due to its central role in many practical computation scenarios with privacy and security requirements. This paper includes new results about the secure two-party scalar product. Specifically, a perfectly secure and universally composable two-party split scalar product (SSP) protocol is proposed in the preprocessing model. In addition to full security, the proposed SSP protocol enjoys the advantage of optimal efficiency. To show the optimality of this SSP protocol, information theoretic lower bounds on the amount of communicated data in a secure two-party computation in the preprocessing model are derived. These bounds are not limited to SSP functionality but apply to a large class of two-party functionalities. A part of this paper is devoted to applications of the proposed SSP protocol in secure cloud computing. Specifically, based on this protocol, a cloud-assisted privacy-preserving profile-matching scheme and a secure remote health monitoring scheme are proposed. Both of the solutions are highly efficient and significantly improve the previous work.
Scalar product protocol and privacy preserving add to multiply protocol (PPAtMP) are two significant basic secure multiparty computation protocols. In this paper, we claim that the two protocols are equivalent to each other and we can achieve one based on the other with the same communication and computation complexity. Then, we propose Secure Two-party Mean Protocol, Secure Shared x ln x Protocol and Secure Shared Generic Polynomial Protocol based on scalar product protocol and PPAtMP. Additionally, we analyze the correctness, security, communication overheads and computation complexity of each protocol proposed in this paper.