Collaborative filtering with privacy

@article{Canny2002CollaborativeFW,
  title={Collaborative filtering with privacy},
  author={John F. Canny},
  journal={Proceedings 2002 IEEE Symposium on Security and Privacy},
  year={2002},
  pages={45-57}
}
  • J. Canny
  • Published 12 May 2002
  • Computer Science
  • Proceedings 2002 IEEE Symposium on Security and Privacy
Server-based collaborative filtering systems have been very successful in e-commerce and in direct recommendation applications. In future, they have many potential applications in ubiquitous computing settings. But today's schemes have problems such as loss of privacy, favoring retail monopolies, and with hampering diffusion of innovations. We propose an alternative model in which users control all of their log data. We describe an algorithm whereby a community of users can compute a public… Expand
Privacy-enhanced collaborative filtering
TLDR
This work investigates how a decentralized approach to users’ profiles storage could mitigate some of the privacy concerns of CF and proposes that the users hide or obfuscate parts of their profile. Expand
Collaborative filtering with privacy
TLDR
This work investigates ways to protect the users’ privacy, by using encryption systems, and shows that a straightforward implementation of the encryption and decryption modules in Java gives quite a run-time overhead. Expand
Homomorphic Recommendations for Data Packing- A Survey
TLDR
This paper proposes encrypting private data and processing them under encryption to generate recommendations by introducing a semitrusted third party and using data packing, which opens a door to generate private recommendations in a privacy-preserving manner. Expand
Generating private recommendations in a social trust network
TLDR
A privacy-enhanced recommender system in a social trust network, which is designed to be highly efficient and based on homomorphic encryption and secure multi-party computation techniques and the additional overhead with regard to computation and communication is minimized by packing data. Expand
An Architecture for Privacy Preserving Collaborative Filtering on Web Portals
  • Waseem Ahmad, A. Khokhar
  • Computer Science
  • Third International Symposium on Information Assurance and Security
  • 2007
TLDR
The proposed architecture attempts to restore user trust in these services by introducing the notion of 'distributed trust', which essentially mean that instead of trusting a single server, a coalition of servers is trusted. Expand
An Architecture for Privacy Preserving Collaborative Filtering on Web Portals
TLDR
The proposed architecture attempts to restore user trust in these services by introducing the notion of 'distributed trust', which essentially mean that instead of trusting a single server, a coalition of servers is trusted. Expand
Generating Private Recommendations Efficiently Using Homomorphic Encryption and Data Packing
TLDR
This work proposes encrypting private data and processing them under encryption to generate recommendations by introducing a semitrusted third party and using data packing, and presents a comparison protocol, which is the first one to the best of the knowledge, that compares multiple values that are packed in one encryption. Expand
Privacy-preserving Collaborative Filtering based on Randomized Perturbation Techniques and Secure Multiparty Computation
TLDR
Theoretical analysis shows that the algorithm based on randomized perturbation techniques and secure multiparty computation not only protect the users’ privacy, but also can keep the accuracy. Expand
Generating Private Recommendations Using ElGamal Homomorphic Encryption
In E-commerce, Recommender systems have become an important tool since it is used to personalize the online services and products. Users are concerned about the privacy as personal information can beExpand
A Practical System for Privacy-Preserving Collaborative Filtering
TLDR
This work proposes a collaborative filtering system where the system does not observe the users' data and is still able to provide useful recommendations, and uses artificial ratings, as part of the process of privately predicting the rating for an item within a particular cluster. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 24 REFERENCES
Efficient Multiparty Computations Secure Against an Adaptive Adversary
TLDR
This paper observes that a subprotocol of Rabin and Ben-Or's, known as weak secret sharing (WSS), is not secure against an adaptive adversary, and proposes new and adaptively secure protocols for WSS, VSS and MPC that are substantially more efficient than the original ones. Expand
A Threshold Cryptosystem without a Trusted Party (Extended Abstract)
In a threshold cryptosystem n members share the necret key of an organization such that k members (1 5 k 5 n) must cooperate in order to decipher a given uphertext. In this note it is shown how toExpand
Verifiable secret sharing and multiparty protocols with honest majority
TLDR
A verifiable secret sharing protocol is presented, and it is shown that any multiparty protocol, or game with incomplete information, can be achieved if a majority of the players are honest. Expand
Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?
We present a general method for constructing commitment schemes based on existence of q-one way group homomorphisms, in which elements in a finite prime field GF(q) can be committed to. A receiver ofExpand
An algorithmic framework for performing collaborative filtering
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercialExpand
Empirical Analysis of Predictive Algorithms for Collaborative Filtering
TLDR
Several algorithms designed for collaborative filtering or recommender systems are described, including techniques based on correlation coefficients, vector-based similarity calculations, and statistical Bayesian methods, to compare the predictive accuracy of the various methods in a set of representative problem domains. Expand
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Every function of <italic>n</italic> inputs can be efficiently computed by a complete network of <italic>n</italic> processors in such a way that:<list><item>If no faults occur, no set of sizeExpand
Application of Dimensionality Reduction in Recommender System - A Case Study
TLDR
This paper presents two different experiments where one technology called Singular Value Decomposition (SVD) is explored to reduce the dimensionality of recommender system databases and suggests that SVD has the potential to meet many of the challenges ofRecommender systems, under certain conditions. Expand
Collaborative Filtering by Personality Diagnosis: A Hybrid Memory and Model-Based Approach
TLDR
This work describes and evaluates a new method called personality diagnosis (PD), which compute the probability that a user is of the same "personality type" as other users, and, in turn, the likelihood that he or she will like new items. Expand
OceanStore: an architecture for global-scale persistent storage
TLDR
OceanStore monitoring of usage patterns allows adaptation to regional outages and denial of service attacks; monitoring also enhances performance through pro-active movement of data. Expand
...
1
2
3
...