Scalar Product Lattice Computation for Efficient Privacy-Preserving Systems

Abstract

Privacy-preserving applications allow users to perform on-line daily actions without leaking sensitive information. The privacy-preserving scalar product is one of the critical algorithms in many private applications. The state-of-the-art privacy-preserving scalar product schemes use either computationally intensive homomorphic (public-key) encryption techniques such as Paillier encryption to achieve strong security (i.e., 128−bit) or random masking technique to achieve high efficiency for low security. In this paper, lattice structures have been exploited to develop an efficient privacy-preserving system. The proposed scheme is not only efficient in computation as compared to the state-of-the-art but also provides 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−bit and 256 − bit 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 randomisation technique at 128−bit security. Also the proposed scheme requires six-time fewer data compared to Paillier and randomisation based schemes for communications.

Post‐quantum identity‐based authenticated multiple key agreement protocol

“…To compare the computational costs, we calculated the number of time-consuming operations during session key agreement in the pairing-based protocols [28,29,39] and the proposed LIAMKA scheme. Based on the results in Rahulamathavan and others [42], we chose the parameters of these schemes for 80-bit security. Because the pairingbased protocol [28,29,39] generates only four session keys in one run, the time required is the total time of two runs for the generation of eight session keys.…”

Privacy-preserving Similarity Calculation of Speaker Features Using Fully Homomorphic Encryption

“…An encryption scheme with the above FHE properties was invented by Craig Gentry in 2009 [13]. The scheme is based on Lattice-based cryptography hence secure against attacks arising from quantum computers [14]- [16]. Since Gentry's ground breaking work, there are numerous improvements were made by several researchers to improve efficiency and scalability.…”

Security and privacy for 6G: A survey on prospective technologies and challenges

“…Semi-trusted • Laplace mechanism Enhanced differential privacy (AI-empowered) Challenge to detect the changes of particular values [249] Homomorphic encryption…”

“…Finally, another name of data obfuscation, data masking protects personal data by hiding identifiable information with modified content. Some state-the-art studies [249] found that the combination of homomorphic encryption and data masking can be a perfect way to provide a high degree of security against quantum attacks, which are taken to appear in 6G, while still maintain privacy at best.…”