Collaborative filtering with privacy

@inproceedings{citeulike:975395, abstract = {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 "aggregate" of their data that does not expose individual users' data. The aggregate allows personalized recommendations to be computed by members of the community, or by outsiders. The numerical algorithm is fast, robust and accurate. Our method reduces the collaborative filtering task to an iterative calculation of the aggregate requiring only addition of vectors of user data. Then we use homomorphic encryption to allow sums of encrypted vectors to be computed and decrypted without exposing individual data. We give verification schemes for all parties in the computation. Our system can be implemented with untrusted servers, or with additional infrastructure, as a fully peer-to-peer (P2P) system.}, author = {Canny, J. }, citeulike-article-id = {975395}, doi = {http://dx.doi.org/10.1109/SECPRI.2002.1004361}, journal = {Security and Privacy, 2002. Proceedings. 2002 IEEE Symposium on}, keywords = {privacy, recommender}, pages = {45--57}, posted-at = {2008-07-14 20:25:55}, priority = {4}, title = {Collaborative filtering with privacy}, url = {http://dx.doi.org/10.1109/SECPRI.2002.1004361}, year = {2002} }

TY - CONF ID - citeulike:975395 L3 - citeulike-article-id:975395 TI - Collaborative filtering with privacy JF - Security and Privacy, 2002. Proceedings. 2002 IEEE Symposium on SP - 45 EP - 57 N2 - 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 "aggregate" of their data that does not expose individual users' data. The aggregate allows personalized recommendations to be computed by members of the community, or by outsiders. The numerical algorithm is fast, robust and accurate. Our method reduces the collaborative filtering task to an iterative calculation of the aggregate requiring only addition of vectors of user data. Then we use homomorphic encryption to allow sums of encrypted vectors to be computed and decrypted without exposing individual data. We give verification schemes for all parties in the computation. Our system can be implemented with untrusted servers, or with additional infrastructure, as a fully peer-to-peer (P2P) system. KW - privacy KW - recommender AU - Canny, J PY - 2002/// UR - http://dx.doi.org/10.1109/SECPRI.2002.1004361 ER -