Amplified Locality-Sensitive Hashing for Privacy-Preserving Distributed Service Recommendation

2017 ◽  
pp. 280-297 ◽  
Author(s):  
Lianyong Qi ◽  
Wanchun Dou ◽  
Xuyun Zhang ◽  
Shui Yu
Keyword(s):  
Privacy Preserving ◽  
Locality Sensitive Hashing ◽  
Service Recommendation ◽  
Distributed Service

scholarly journals Privacy-Aware Multidimensional Mobile Service Quality Prediction and Recommendation in Distributed Fog Environment

2018 ◽  
Vol 2018 ◽  
pp. 1-8 ◽  
Author(s):  
Wenwen Gong ◽  
Lianyong Qi ◽  
Yanwei Xu
Keyword(s):  
Service Selection ◽  
Locality Sensitive Hashing ◽  
Mobile Service ◽  
Service Recommendation ◽  
User Privacy ◽  
Service Usage ◽  
Selection Decisions ◽  
Wide Range ◽  
Cross Platform ◽  
Computational Resources

With the ever-increasing popularity of mobile computing technology, a wide range of computational resources or services (e.g., movies, food, and places of interest) are migrating to the mobile infrastructure or devices (e.g., mobile phones, PDA, and smart watches), imposing heavy burdens on the service selection decisions of users. In this situation, service recommendation has become one of the promising ways to alleviate such burdens. In general, the service usage data used to make service recommendation are produced by various mobile devices and collected by distributed edge platforms, which leads to potential leakage of user privacy during the subsequent cross-platform data collaboration and service recommendation process. Locality-Sensitive Hashing (LSH) technique has recently been introduced to realize the privacy-preserving distributed service recommendation. However, existing LSH-based recommendation approaches often consider only one quality dimension of services, without considering the multidimensional recommendation scenarios that are more complex but more common. In view of this drawback, we improve the traditional LSH and put forward a novel LSH-based service recommendation approach named SerRecmulti-qos, to protect users’ privacy over multiple quality dimensions during the distributed mobile service recommendation process.

scholarly journals Privacy-Preserving Sorting Algorithms Based on Logistic Map for Clouds

2018 ◽  
Vol 2018 ◽  
pp. 1-10
Author(s):  
Hua Dai ◽  
Hui Ren ◽  
Zhiye Chen ◽  
Geng Yang ◽  
Xun Yi
Keyword(s):  
Data Privacy ◽  
Logistic Map ◽  
Security Analysis ◽  
Privacy Preserving ◽  
Service Recommendation ◽  
Sensitive Data ◽  
Encrypted Data ◽  
Sorting Algorithms ◽  
Common Operation ◽  
Cloud Servers

Outsourcing data in clouds is adopted by more and more companies and individuals due to the profits from data sharing and parallel, elastic, and on-demand computing. However, it forces data owners to lose control of their own data, which causes privacy-preserving problems on sensitive data. Sorting is a common operation in many areas, such as machine learning, service recommendation, and data query. It is a challenge to implement privacy-preserving sorting over encrypted data without leaking privacy of sensitive data. In this paper, we propose privacy-preserving sorting algorithms which are on the basis of the logistic map. Secure comparable codes are constructed by logistic map functions, which can be utilized to compare the corresponding encrypted data items even without knowing their plaintext values. Data owners firstly encrypt their data and generate the corresponding comparable codes and then outsource them to clouds. Cloud servers are capable of sorting the outsourced encrypted data in accordance with their corresponding comparable codes by the proposed privacy-preserving sorting algorithms. Security analysis and experimental results show that the proposed algorithms can protect data privacy, while providing efficient sorting on encrypted data.

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 Privacy-Preserving and Scalable Service Recommendation Based on SimHash in a Distributed Cloud Environment

Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Yanwei Xu ◽  
Lianyong Qi ◽  
Wanchun Dou ◽  
Jiguo Yu
Keyword(s):  
Privacy Preservation ◽  
Service Selection ◽  
Cloud Service ◽  
Privacy Preserving ◽  
Cloud Environment ◽  
Cloud Platform ◽  
Service Recommendation ◽  
Service Usage ◽  
Target User ◽  
Usage Data

With the increasing volume of web services in the cloud environment, Collaborative Filtering- (CF-) based service recommendation has become one of the most effective techniques to alleviate the heavy burden on the service selection decisions of a target user. However, the service recommendation bases, that is, historical service usage data, are often distributed in different cloud platforms. Two challenges are present in such a cross-cloud service recommendation scenario. First, a cloud platform is often not willing to share its data to other cloud platforms due to privacy concerns, which decreases the feasibility of cross-cloud service recommendation severely. Second, the historical service usage data recorded in each cloud platform may update over time, which reduces the recommendation scalability significantly. In view of these two challenges, a novel privacy-preserving and scalable service recommendation approach based on SimHash, named SerRecSimHash, is proposed in this paper. Finally, through a set of experiments deployed on a real distributed service quality dataset WS-DREAM, we validate the feasibility of our proposal in terms of recommendation accuracy and efficiency while guaranteeing privacy-preservation.

scholarly journals Splitting chemical structure data sets for federated privacy-preserving machine learning

2021 ◽  
Vol 13 (1) ◽  
Author(s):  
Jaak Simm ◽  
Lina Humbeck ◽  
Adam Zalewski ◽  
Noe Sturm ◽  
Wouter Heyndrickx ◽  
...  
Keyword(s):  
Machine Learning ◽  
Quality Criteria ◽  
Privacy Preserving ◽  
Locality Sensitive Hashing ◽  
Data Sets ◽  
Data Set ◽  
Test Set ◽  
Chemical Structures ◽  
Multiple Partners ◽  
Applications Of Machine Learning

AbstractWith the increase in applications of machine learning methods in drug design and related fields, the challenge of designing sound test sets becomes more and more prominent. The goal of this challenge is to have a realistic split of chemical structures (compounds) between training, validation and test set such that the performance on the test set is meaningful to infer the performance in a prospective application. This challenge is by its own very interesting and relevant, but is even more complex in a federated machine learning approach where multiple partners jointly train a model under privacy-preserving conditions where chemical structures must not be shared between the different participating parties. In this work we discuss three methods which provide a splitting of a data set and are applicable in a federated privacy-preserving setting, namely: a. locality-sensitive hashing (LSH), b. sphere exclusion clustering, c. scaffold-based binning (scaffold network). For evaluation of these splitting methods we consider the following quality criteria (compared to random splitting): bias in prediction performance, classification label and data imbalance, similarity distance between the test and training set compounds. The main findings of the paper are a. both sphere exclusion clustering and scaffold-based binning result in high quality splitting of the data sets, b. in terms of compute costs sphere exclusion clustering is very expensive in the case of federated privacy-preserving setting.

Sign in / Sign up

Export Citation Format

Share Document