China
Africa
Explore chapters and articles related to this topic
Profile Matching and Recommendation Systems in Proximity Service
Published in Yufeng Wang, Athanasios V. Vasilakos, Qun Jin, Hongbo Zhu, Device-to-Device based Proximity Service, 2017
Yufeng Wang, Athanasios V. Vasilakos, Qun Jin, Hongbo Zhu
This chapter mainly introduces profile-matching mechanisms in D2D-based proximity services and RS in OTT-based proximity service. Those functionalities are becoming more and more important for proximity services. For profile matching in D2D paradigm, we present some methods mainly using Bloom filter to conduct efficient matching between one–one and many–many users. Moreover, we also summarize several typical fine-grained privacy-preserving profile-matching schemes including heavy-weighted homomorphic encryption, that is, Paillier cryptosystem, and light-weighted Confusion Matrix Transformation-based scheme.
Privacy in Wireless Sensor Networks: Issues, Challenges, and Solutions
Published in Shafiullah Khan, Al-Sakib Khan Pathan, Nabil Ali Alrajeh, Wireless Sensor Networks, 2016
Paillier cryptosystem is a case for additive homomorphic encryption [35]. This scheme applies composite residuosity class problem in public key cryptography and consist of three encryption algorithms: one trap-door permutation and two homomorphic probabilistic encryption algorithms. The decisional composite residuosity assumption is the intractability hypothesis upon which this cryptosystem is based. We are interested in the homomorphic property of this scheme. The scheme is an additive homomorphic cryptosystem; this means that, given only the public key and the encryption of x1 and x2, one can compute the encryption of x1 + x2. Let us consider public key is the modulus N and the base e, then the encryption of a message ϕ is ε(ϕ)=(eϕrN)modNε(ϕ1)⋅ε(ϕ2)=(e(ϕ1+ϕ2)(r1r2)N)=ε(ϕ1+ϕ2modN)
A robust, distributed, and privacy-preserving aggregation scheme for smart grid communications
Published in Journal of the Chinese Institute of Engineers, 2019
Gang Shen, Yixin Su, Danhong Zhang, Cheng Zhang, Mingwu Zhang
The Paillier cryptosystem is classic homomorphic encryption proposed by Paillier in 1999. This cryptosystem consists of three algorithms as follows: Key generation: Calculate and , where , are two large prime numbers, and , where is a security parameter. Define a function , choosing generator , and compute . The public key is , and the corresponding private key is .Encryption: Given plaintext , choose a random number , and calculate ciphertext .Decryption: Given ciphertext , the corresponding plaintext can be recovered by computing .
Confidentiality attacks against encrypted control systems
Published in Cyber-Physical Systems, 2023
Amir Mohammad Naseri, Walter Lucia, Amr Youssef
Although Paillier cryptosystem is only additively homomorphic, it is also possible, exploiting the malleability of the cryptosystem, to compute multiplications between an encrypted message and a plaintext message i.e.