{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T07:07:40Z","timestamp":1780470460362,"version":"3.54.1"},"reference-count":14,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/secpri.2002.1004361","type":"proceedings-article","created":{"date-parts":[[2005,8,25]],"date-time":"2005-08-25T03:23:34Z","timestamp":1124940214000},"page":"45-57","source":"Crossref","is-referenced-by-count":185,"title":["Collaborative filtering with privacy"],"prefix":"10.1109","author":[{"given":"J.","family":"Canny","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Collaborative filtering by personality diagnosis: A hybrid memory-and model-based approach","author":"pennock","year":"1999","journal-title":"IJCAI Workshop on Machine Learning for Information Filtering International Joint Conference on Artificial Intelligence (IJCAI-99)"},{"key":"ref11","author":"polak","year":"1971","journal-title":"Computational Methods in Optimization"},{"key":"ref12","first-page":"73","article-title":"Verifiable secret-sharing and multiparty protocols with honest majority","author":"rabin","year":"1989","journal-title":"21st ACM STOC"},{"key":"ref13","author":"rogers","year":"1995","journal-title":"Diffusion of Innovations"},{"key":"ref14","article-title":"Application of dimensionality reduction in recommender system - a case study","author":"sarwar","year":"2000","journal-title":"ACM WebKDD 2000 Web Mining for E-Commerce Workshop"},{"key":"ref4","first-page":"311","article-title":"Efficient multiparty computations secure against an adaptive adversary","volume":"1592","author":"cramer","year":"1999","journal-title":"Proc EUROCRYPT '99"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055745"},{"key":"ref6","article-title":"Jester 2.0: Evaluation of a new linear time collaborative filtering algorithm","author":"goldberg","year":"1999","journal-title":"International ACM SIGIR Conference on Research and Development in Information Retrieval"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460080506"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/378993.379239"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312682"},{"key":"ref2","article-title":"Empirical analysis of predictive algorithms for collaborative filtering","author":"breese","year":"1998","journal-title":"Technical Report Microsoft Research"},{"key":"ref1","first-page":"1","article-title":"Completeness theorems for noncryptographic fault-tolerant distributed computations","author":"ben-or","year":"1988","journal-title":"The 20th ACM STOC"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_47"}],"event":{"name":"2002 IEEE Symposium on Security and Privacy","location":"Berkeley, CA, USA","acronym":"SECPRI-02"},"container-title":["Proceedings 2002 IEEE Symposium on Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7873\/21681\/01004361.pdf?arnumber=1004361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T01:05:56Z","timestamp":1489453556000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1004361\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/secpri.2002.1004361","relation":{},"subject":[]}}