City Research Online

Scalar Product Lattice Computation for Efficient Privacy-Preserving Systems

Rahulamathavan, Y., Dogan, S., Shi, X. , Lu, R., Rajarajan, M. ORCID: 0000-0001-5814-9922 & Kondoz, A. (2021). Scalar Product Lattice Computation for Efficient Privacy-Preserving Systems. IEEE Internet of Things Journal, 8(3), pp. 1417-1427. doi: 10.1109/jiot.2020.3014686


Privacy-preserving (PP) applications allow users to perform online daily actions without leaking sensitive information. The PP scalar product (PPSP) is one of the critical algorithms in many private applications. The state-of-the-art PPSP schemes use either computationally intensive homomorphic (public-key) encryption techniques, such as the Paillier encryption to achieve strong security (i.e., 128 b) or random masking technique to achieve high efficiency for low security. In this article, lattice structures have been exploited to develop an efficient PP system. The proposed scheme is not only efficient in computation as compared to the state-of-the-art but also provides a high degree of security against quantum attacks. Rigorous security and privacy analyses of the proposed scheme have been provided along with a concrete set of parameters to achieve 128-b and 256-b security. Performance analysis shows that the scheme is at least five orders faster than the Paillier schemes and at least twice as faster than the existing randomization technique at 128-b security. Also the proposed scheme requires six-time fewer data compared to the Paillier and randomization-based schemes for communications.

Publication Type: Article
Additional Information: © 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. This article has been published in IEEE Internet of Things Journal, doi: 10.1109/JIOT.2020.3014686
Publisher Keywords: Encryption, Privacy, Lattices, Complexity theory, Quantum computing
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments: School of Science & Technology > Engineering
SWORD Depositor:
[thumbnail of CRO Lattice_based__Privacy_preserving_Scalar_Product_Computation(1).pdf]
Text - Accepted Version
Download (1MB) | Preview


Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email


Downloads per month over past year

View more statistics

Actions (login required)

Admin Login Admin Login