Secure Scalar Product Protocols
Open Access
- 1 November 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 30 (6) , 1059-1068
Abstract
Secure scalar product computation is a special secure multi-party computation problem. A secure scalar product protocol can be used by two parties to jointly compute the scalar product of their private vectors without revealing any information about the private vector of either party. Secure scalar product protocol is of great significance in privacy-preserving scientific computing, privacy preserving data mining, privacy-preserving cooperative statistical analysis and privacy-preserving geometry computation, etc. Many privacy preserving computing problems can be transformed to secure scalar product computation. At present, existing scalar product protocols cannot be used to privately compute scalar product of private vectors with both positive and negative components. Based on homomorphic encryption scheme, we design three protocols to compute scalar product of three different kinds of private vectors. The components of the first kind vector are arbitrary integers; those of the second kind are positive rational numbers and those of the third kind are arbitrary rational numbers. We use simulation paradigm proving that the protocols are secure in the semi-honest model. Theoretical analysis and experimental results show that the protocols designed in this paper are efficient.Keywords
This publication has 28 references indexed in Scilit:
- Efficient scalar product protocol and its privacy-preserving applicationInternational Journal of Electronic Security and Digital Forensics, 2015
- A Fast Secure Dot Product Protocol with Application to Privacy Preserving Association Rule Mining2014
- A Secure Scalar Product Protocol Against Malicious AdversariesJournal of Computer Science and Technology, 2013
- An Efficient Cacheable Secure Scalar Product Protocol for Privacy-Preserving Data MiningLecture Notes in Computer Science, 2011
- Non-interactive two-channel message authentication based on hybrid-collision resistant hash functionsIET Information Security, 2007
- Evaluating 2-DNF Formulas on Ciphertexts2005
- General Cryptographic Protocols2004
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes1999
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- Probabilistic encryptionJournal of Computer and System Sciences, 1984