Efficient scalar product protocol and its privacy-preserving application Online publication date: Wed, 11-Mar-2015
by Youwen Zhu; Tsuyoshi Takagi
International Journal of Electronic Security and Digital Forensics (IJESDF), Vol. 7, No. 1, 2015
Abstract: Scalar product protocol aims at securely computing the dot product of two private vectors. As a basic tool, the protocol has been widely used in privacy preserving distributed collaborative computations. In this paper, at the expense of disclosing partial sum of some private data, we propose a linearly efficient even-dimension scalar product protocol (EDSPP) without employing expensive homomorphic crypto-system and any third party. The correctness and security of EDSPP are confirmed by theoretical analysis. In comparison with six most frequently-used schemes of scalar product protocol (to the best of our knowledge), the new scheme is the most efficient one, and it has good fairness. Simulated experiment results intuitively indicate the good performance of our scheme. Consequently, in the situations where divulging very limited information about private data is acceptable, EDSPP is an extremely competitive candidate secure primitive to achieve practical schemes of privacy preserving distributed cooperative computations. We also discuss the application of EDSPP, and present a secure distance comparison protocol based on EDSPP, which can be used in many privacy-preserving computations, such as privacy-preserving k-nearest neighbours computation. Additionally, a hybrid scheme is put forward to securely compute the scalar product of arbitrary-length private vectors.
Online publication date: Wed, 11-Mar-2015
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Electronic Security and Digital Forensics (IJESDF):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org