Abstract
The problem of privacy preserving inner product of vectors has been widely studied. Much work has been done on the scenario of two parties involved in the computation. In this paper, we consider the scenario where three parties are involved in the computing process of cloud computing. We propose a new privacy preserving scheme for inner product of two vectors in the cloud and give the correctness analysis and performance analysis for the scheme. The proposed scheme is based on homomorphic encryption, and the security can be guaranteed. Experiments show the efficiency of the scheme.
Highlights
The computation of inner product of vectors is a fundamental mathematical operation
A secure privacy preserving scheme was presented for inner product of vectors in cloud computing in [9]
We propose a new scheme on the basis of homomorphic encryption, which aims at the problem of privacy preserving inner product of vectors in cloud computing
Summary
The computation of inner product of vectors is a fundamental mathematical operation. The inner product of vectors has found wide application in the research field of computer science, such as cooperative statistical analysis [1], data mining [2], and similarity computation [3]. The problem of privacy preserving inner product of vectors has gained thorough research, and much work has been done on it, such as [1,2,3,4,5,6,7]. A secure privacy preserving scheme was presented for inner product of vectors in cloud computing in [9]. The array may be large when the vector has big size of dimensionality It is inconvenient for the data owner to update the secret key when there are many clients. We propose a new scheme on the basis of homomorphic encryption, which aims at the problem of privacy preserving inner product of vectors in cloud computing.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
