Relation of PPAtMP and scalar product protocol and their applications

Abstract

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.

Privacy preserving computation of trust-value in wireless sensor networks

“…The private distributed scalar product protocol is a signifi cant basic tool in security multi-part computation (SMC) [6], [7], [S], [9]and it has a great many of applications in privacy preserving problems [10], [11], [12], [13], [14], [15], [16].…”

Privacy Preserving Aggregate Query of OLAP for Accurate Answers

“…Many SMC protocols [2][3][4][5][6][7][8][9][10][11][12][13][14] are under the semi-honest model. In the paper, we assume that all participants are semi-honest [3], which is also called honest-but-curious, who exactly follow the steps of the protocols and keep a record of all the intermediate results he receives to infer some potentially confidential information contained in them.…”

“…Yao [2] introduces the notion of SMC in 1982. Since then, it has been a hot research topic and attracts numerous researchers [2][3][4][5][6][7][8][9][10][11][12][13]. Basic SMC protocols can be used to construct far more complicated privacy preserving protocols to solve special practical questions, including privacy preserving data mining [14][15], privacy preserving social networks [16], privacy-preserving computation geometry [7][8], etc.…”