Abstract
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.
Highlights
R EGULATORS around the world are enforcing privacyby-design and privacy-by-default approaches to protect the users’ data in rest, transit and processing
In order to evaluate the proposed Learning with errors (LWE) based privacy-preserving scalar product (PPSP) scheme, we implemented the algorithm in Java and tested on a 64bit Windows PC with 16GB RAM and Intel(R) Core(TM) i5-4210U CPU at 1.70GHz
Our test results show that the proposed LWE based scheme is significantly faster than the Paillier homomorphic PPSP scheme and at least twice as fast as [20] for the 128−bit security
Summary
R EGULATORS around the world are enforcing privacyby-design and privacy-by-default approaches to protect the users’ data in rest, transit and processing. Regardless of algorithms, privacy-preserving scalar product (PPSP) has been used as one of the privacy enabling tools between the two parties. Several solutions have been proposed to address this problem in literature (see Section 2) These solutions rely on either public-key encryption techniques to achieve strong security or randomisation techniques for high efficiency. The security of these schemes rely on mathematically hard problems and these solutions will be obsolete in few years time due to the rise of quantum computers as there are existing quantum algorithms which can solve the mathematically intractable problems [9]–[13]. The proposed solution will be secure against quantum computers and can be used in PP algorithms for various applications to achieve privacy.
Sign-in/Register to view highlights & summary 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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
