Fetching the paper…
Reading the bibliography…
The massive collection of personal data by personalization systems has rendered the preservation of privacy of individuals more and more difficult.
D. Zwick and N. Dholakia, “Models of Privacy in the Digital Age: Implications for Marketing and E-Commerce,” September, 1999
1999
Earlier work this paper cites.
L. Sweeney, “k-Anonymity: A Model for Protecting Privacy,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems , vol. 10, no. 5, pp. 557–570, 2002
2002
Earlier work this paper cites.
Harris Interactive, “The Harris Poll ® ♯ 17 \sharp{}17 : Most People are ‘Privacy Pragmatists’ who, while Concerned about Privacy, will Sometimes Trade it off for Other Benefits,” 2003. [Online]. Available: http://www.harrisinteractive.com/harris_poll/index.asp?PID=365
2003
Earlier work this paper cites.
F. Liu, C. Yu, and W. Meng, “Personalized Web Search for Improving Retrieval Effectiveness,” IEEE Transactions on Knowledge and Data Engineering , vol. 16, no. 1, pp. 28 – 40, January, 2004
2004
Earlier work this paper cites.
C. Jensen, C. Potts, and C. Jensen, “Privacy Practices of Internet Users: Self-Reports versus Observed Behavior,” International Journal of Human-Computer Studies , vol. 63, no. 1-2, pp. 203–227, July, 2005
2005
Earlier work this paper cites.
C. Dwork, F. McSherry, K. Nissim, and A. Smith, “Calibrating Noise to Sensitivity in Private Data Analysis,” in Proceedings of the 3rd Theory of Cryptography Conference (TCC’06) , New York, USA, March, 2006, pp. 265–284
2006
Earlier work this paper cites.
N. Zhang and W. Zhao, “Privacy-Preserving Data Mining Systems,” Computer , vol. 40, no. 4, pp. 52–58, April, 2007
2007
Earlier work this paper cites.
K. Nissim, S. Raskhodnikova, and A. Smith, “Smooth Sensitivity and Sampling in Private Data Analysis,” in Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC’07) , San Diego, California, USA, June, 2007, pp. 75–84
2007
Earlier work this paper cites.
H. Dym, Linear Algebra in Action . Weizmann Institute of Science - AMS, 2007
2007
Earlier work this paper cites.
S. Venkatasubramanian, Privacy-Preserving Data Mining , ser. Advances in Database Systems. Springer US, 2008, vol. 34, ch. Measures of Anonymity, pp. 81–103
2008
Earlier work this paper cites.
C. Dwork, “Differential Privacy: a Survey of Results,” in Proceedings of the 5th International Conference on Theory and Applications of Models of Computation (TAMC’08) , M. Agrawal, D.-Z. Du, Z. Duan, and A. Li, Eds., Xi’an, China, April, 2008, pp. 1–19
2008
Earlier work this paper cites.
S. P. Kasiviswanathan, H. K. Lee, K. Nissim, S. Raskhodnikova, and A. Smith, “What Can We Learn Privately?” in Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS’08) . IEEE Computer Society Washington, DC, USA, 2008, pp. 531–540
2008
Cited alongside, same era.
F. McSherry and I. Mironov, “Differentially Private Recommender Systems: Building Privacy into the Net,” in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’09) . New York, NY, USA: ACM, 2009, pp. 627–636
2009
Cited alongside, same era.
I. Mironov, O. Pandey, O. Reingold, and S. P. Vadhan, “Computational Differential Privacy,” in Proceedings of the 29th Annual International Cryptography Conference – Advances in Cryptology (CRYPTO’09) , ser. Lecture Notes in Computer Science, S. Halevi, Ed., vol. 5677. Santa Barbara, CA, USA: Springer, August, 2009, pp. 126–142
2009
Cited alongside, same era.
2011
Later among the works it cites.
Y. Liu, K. P. Gummadi, B. Krishnamurthy, and A. Mislove, “Analyzing Facebook Privacy Settings: User Expectations vs. Reality,” in Proceedings of the Internet Measurement Conference , Berlin, Germany, November, 2011, pp. 61–70
2011
Later among the works it cites.
J. Lee and C. Clifton, “How Much is Enough? Choosing ϵ \epsilon for Differential Privacy,” in Proceedings of the 14th International Information Security Conference (ISC’11) , ser. Lecture Notes in Computer Science, X. Lai, J. Zhou, and H. Li, Eds., vol. 7001. Xi’an, China: Springer, October, 2011, pp. 325–340
2011
Later among the works it cites.
2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2009
Cited alongside, same era.
M. Bertier, D. Frey, R. Guerraoui, A.-M. Kermarrec, and V. Leroy, “The Gossple Anonymous Social Network,” in Proceedings of the 11th International Middleware Conference (Middleware’10), ACM/IFIP/USENIX , Bangalore, India, November, 2010, pp. 191–211
2010
Cited alongside, same era.
Z. Wen and C.-Y. Lin, “How Accurately Can One’s Interests Be Inferred from Friends?” in Proceedings of the 19th International Conference on World Wide Web , ser. WWW’10. New York, NY, USA: ACM, 2010, pp. 1203–1204
2010
Cited alongside, same era.
C. Dwork and M. Naor, “On the Difficulties of Disclosure Prevention in Statistical Databases or the Case for Differential Privacy,” Journal of Privacy and Confidentiality , vol. 2, no. 1, pp. 93–107, 2010
2010
Cited alongside, same era.
A. Jeffrey, Matrix Operations for Engineers and Scientists: An Essential Guide in Linear Algebra . Springer Netherlands, 2010, ch. Linear Transformations and the Geometry of the Plane, pp. 239–272
2010
Cited alongside, same era.
R. Kumar, R. D. Gopal, and R. S. Garfinkel, “Freedom of Privacy: Anonymous Data Collection with Respondent-Defined Privacy Protection,” INFORMS Journal on Computing , vol. 22, no. 3, pp. 471–481, 2010
2010
Cited alongside, same era.
M. Alaggan, S. Gambs, and A.-M. Kermarrec, “Private Similarity Computation in Distributed Systems: From Cryptography to Differential Privacy,” in Proceedings of the 15th International Conference on the Principles of Distributed Systems (OPODIS’11) , ser. Lecture Notes in Computer Science, A. F. Anta, G. Lipari, and M. Roy, Eds., vol. 7109. Toulouse, France: Springer, December, 2011, pp. 357–377
2011
Cited alongside, same era.
A. McGregor, I. Mironov, T. Pitassi, O. Reingold, K. Talwar, and S. Vadhan, “The Limits of Two-Party Differential Privacy,” Electronic Colloquium on Computational Complexity, Tech. Rep. 106, August, 2011
2011
Cited alongside, same era.
Later among the works it cites.
A. Ghosh and A. Roth, “Selling Privacy at Auction,” in Proceedings of the 12th ACM Conference on Electronic Commerce (EC-2011) , Y. Shoham, Y. Chen, and T. Roughgarden, Eds. San Jose, CA, USA: ACM, June, 2011, pp. 199–208
2011
Later among the works it cites.
K. Das, K. Bhaduri, and H. Kargupta, “Multi-Objective Optimization Based Privacy Preserving Distributed Data Mining in Peer-to-Peer Networks,” Peer-to-Peer Networking and Applications , vol. 4, no. 2, pp. 192–209, 2011
2011
Later among the works it cites.
Y. Zeng, N. Zhong, X. Ren, and Y. Wang, “User Interests Driven Web Personalization Based on Multiple Social Networks,” in Proceedings of the 4th International Workshop on Web Intelligence & Communities , ser. WI&C’12. New York, NY, USA: ACM, 2012, pp. 9:1–9:4
2012
Later among the works it cites.
X. Zhou, Y. Xu, Y. Li, A. Josang, and C. Cox, “The State-of-the-Art in Personalized Recommender Systems for Social Networking,” Artificial Intelligence Review , vol. 37, no. 2, pp. 119–132, 2012
2012
Later among the works it cites.
E. Toch, Y. Wang, and L. Cranor, “Personalization and Privacy: a Survey of Privacy Risks and Remedies in Personalization-Based Systems,” User Modeling and User-Adapted Interaction , vol. 22, no. 1-2, pp. 203–220, 2012, 10.1007/s11257-011-9110-z
2012
Later among the works it cites.
——, “BLIP: Non-Interactive Differentially-Private Similarity Computation on Bloom Filters,” in Proceedings of the 14th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS’12) , Toronto, Canada, October, 2012, to appear
2012
Later among the works it cites.