A Study on the User Privacy-Preserving Personalized Recommendation Based on Random Perturbation for online Services in the Background of Big Data

2021 ◽  
Author(s):  
Qinglie Wu ◽  
Xiaolu Gong
Keyword(s):  
Big Data ◽  
Random Perturbation ◽  
Privacy Preserving ◽  
Personalized Recommendation ◽  
User Privacy ◽  
Online Services

scholarly journals Privacy-Preserving Multiple Tensor Factorization for Synthesizing Large-Scale Location Traces with Cluster-Specific Features

2021 ◽  
Vol 2021 (2) ◽  
pp. 5-26
Author(s):  
Takao Murakami ◽  
Koki Hamada ◽  
Yusuke Kawamoto ◽  
Takuma Hatano
Keyword(s):  
Big Data ◽  
Data Analysis ◽  
Large Scale ◽  
Privacy Preserving ◽  
Location Based Services ◽  
Tensor Factorization ◽  
Statistical Features ◽  
User Privacy ◽  
Posterior Sampling ◽  
Spatial Big Data

Abstract With the widespread use of LBSs (Location-based Services), synthesizing location traces plays an increasingly important role in analyzing spatial big data while protecting user privacy. In particular, a synthetic trace that preserves a feature specific to a cluster of users (e.g., those who commute by train, those who go shopping) is important for various geo-data analysis tasks and for providing a synthetic location dataset. Although location synthesizers have been widely studied, existing synthesizers do not provide su˚cient utility, privacy, or scalability, hence are not practical for large-scale location traces. To overcome this issue, we propose a novel location synthesizer called PPMTF (Privacy-Preserving Multiple Tensor Factorization). We model various statistical features of the original traces by a transition-count tensor and a visit-count tensor. We factorize these two tensors simultaneously via multiple tensor factorization, and train factor matrices via posterior sampling. Then we synthesize traces from reconstructed tensors, and perform a plausible deniability test for a synthetic trace. We comprehensively evaluate PPMTF using two datasets. Our experimental results show that PPMTF preserves various statistical features including cluster-specific features, protects user privacy, and synthesizes large-scale location traces in practical time. PPMTF also significantly outperforms the state-of-theart methods in terms of utility and scalability at the same level of privacy.

scholarly journals Privacy-preserving energy storage sharing with blockchain and secure multi-party computation

2021 ◽  
Vol 1 (1) ◽  
pp. 32-50
Author(s):  
Nan Wang ◽  
Sid Chi-Kin Chau ◽  
Yue Zhou
Keyword(s):  
Energy Storage ◽  
Energy Demand ◽  
Empirical Evaluation ◽  
Privacy Preserving ◽  
Third Party ◽  
User Privacy ◽  
External Energy ◽  
Novel Approach ◽  
Significant Cost Reduction ◽  
The Cost

Energy storage provides an effective way of shifting temporal energy demands and supplies, which enables significant cost reduction under time-of-use energy pricing plans. Despite its promising benefits, the cost of present energy storage remains expensive, presenting a major obstacle to practical deployment. A more viable solution to improve the cost-effectiveness is by sharing energy storage, such as community sharing, cloud energy storage and peer-to-peer sharing. However, revealing private energy demand data to an external energy storage operator may compromise user privacy, and is susceptible to data misuses and breaches. In this paper, we explore a novel approach to support energy storage sharing with privacy protection, based on privacy-preserving blockchain and secure multi-party computation. We present an integrated solution to enable privacy-preserving energy storage sharing, such that energy storage service scheduling and cost-sharing can be attained without the knowledge of individual users' demands. It also supports auditing and verification by the grid operator via blockchain. Furthermore, our privacy-preserving solution can safeguard against a majority of dishonest users, who may collude in cheating, without requiring a trusted third-party. We implemented our solution as a smart contract on real-world Ethereum blockchain platform, and provided empirical evaluation in this paper 1 .

scholarly journals Efficient and Privacy-Preserving Multi-User Outsourced K-Means Clustering

2021 ◽  
Vol 14 (2) ◽  
pp. 26
Author(s):  
Na Li ◽  
Lianguan Huang ◽  
Yanling Li ◽  
Meng Sun
Keyword(s):  
Data Mining ◽  
Big Data ◽  
Clustering Algorithm ◽  
Privacy Preserving ◽  
Locality Sensitive Hashing ◽  
Sensitive Information ◽  
The Public ◽  
Big Data Mining ◽  
Euclidean Distances ◽  
Computational Resources

In recent years, with the development of the Internet, the data on the network presents an outbreak trend. Big data mining aims at obtaining useful information through data processing, such as clustering, clarifying and so on. Clustering is an important branch of big data mining and it is popular because of its simplicity. A new trend for clients who lack of storage and computational resources is to outsource the data and clustering task to the public cloud platforms. However, as datasets used for clustering may contain some sensitive information (e.g., identity information, health information), simply outsourcing them to the cloud platforms can't protect the privacy. So clients tend to encrypt their databases before uploading to the cloud for clustering. In this paper, we focus on privacy protection and efficiency promotion with respect to k-means clustering, and we propose a new privacy-preserving multi-user outsourced k-means clustering algorithm which is based on locality sensitive hashing (LSH). In this algorithm, we use a Paillier cryptosystem encrypting databases, and combine LSH to prune off some unnecessary computations during the clustering. That is, we don't need to compute the Euclidean distances between each data record and each clustering center. Finally, the theoretical and experimental results show that our algorithm is more efficient than most existing privacy-preserving k-means clustering.

scholarly journals Clustering based Privacy Preserving of Big Data using Fuzzification and Anonymization Operation

2019 ◽  
Vol 10 (12) ◽  
Author(s):  
Saira Khan ◽  
Khalid Iqbal ◽  
Safi Faizullah ◽  
Muhammad Fahad ◽  
Jawad Ali ◽  
...  
Keyword(s):  
Big Data ◽  
Privacy Preserving
Sign in / Sign up

Export Citation Format

Share Document