Theory of privacy and anonymity

Algorithms and Theory of Computation Handbook, Second Edition, Volume 2: Special Topics and Techniques

Volumn , Issue , 2009, Pages 18.1-18.35

  Ciriani, Valentina ^a   De Capitani di Vimercati, Sabrina ^a   Foresti, Sara ^a   Samarati, Pierangela ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85131612415     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (41)

1. N. Adam and J. Wormian. Security-control methods for statistical databases: A comparative study. ACM Computing Surveys, 21(4):515-556, 1989.
2. G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu. Anonymizing tables. In Proceedings of the 10th International Conference on Database Theory (ICDT'05), Edinburgh, Scotland, January 2005.
3. G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu. Approximation algorithms for k -anonymity. Journal of Privacy Technology, November 2005.
4. R. Agrawal and R. Srikant. Privacy-preserving data mining. In Proceedings of the ACM SIGMOD Conference on Management of Data, Dallas, TX, May 2000.
5. A. Ambainis. Upper bound on communication complexity of private information retrieval. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming, Bologna, Italy, July 1997.
6. R. J. Bayardo and R. Agrawal. Data privacy through optimal c -anonymization. In Proceedings of the 21st International Conference on Data Engineering (ICDE'05), Tokyo, Japan, April 2005.
7. C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In Proceedings of EUROCRYPT'99, Prague, Czech Republic, May 1999.
8. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, February 1981.
9. B. Chor and N. Gilboa. Computationally private information retrieval (extended abstract). In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, May 1997.
10. B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan. Private information retrieval. Journal of ACM, 45(6):965-981, April 1998.
11. V. Ciriani, S. De Capitani di Vimercati, S. Foresti, and P. Samarati. k-anonymity. In T. Yu and S. Jajodia, editors, Security in Decentralized Data Management. Springer, Berlin, Heidelberg, 2007.
12. V. Ciriani, S. De Capitani di Vimercati, S. Foresti, and P. Samarati. c -anonymous data mining: Asurvey.InC.C.AggarwalandP.S.Yu,editors, Privacy-Preserving Data Mining: Models and Algorithms. Springer-Verlag, New York, 2007.
13. V. Ciriani, S. De Capitani di Vimercati, S. Foresti, and P. Samarati. Microdata protection. In T. Yu and S. Jajodia, editors, Security in Decentralized Data Management. Springer, Berlin, Heidelberg, 2007.
14. L. Cox. A constructive procedure for unbiased controlled rounding. Journal of the American Statistical Association, 82(398):520-524, 1987.
15. S. Dawson, S. De Capitani di Vimercati, P. Lincoln, and P. Samarati. Maximizing sharing of protected information. Journal of Computer and System Sciences, 64(3):496-541, May 2002.
16. D. Denning. Inference controls. In Cryptography and Data Security. Addison-Wesley Publishing Company, Reading, MA, 1982.
17. R. Dingledine, N. Mathewson, and P. Syverson. Tor: The second-generation onion router. In Proceedings of the 12th USENIX Security Symposium, San Diego, CA, August 2004.
18. W. Du and M. Atallah. Privacy-preserving cooperative statistical analysis. In Proceedings of the 17th Annual Computer Security Applications Conference, New Orleans, LA, December 2001.
19. W. Du and M. Atallah. Secure multi-party computation problems and their applications: A review and open problems. In Proceedings of the 2001 Workshop on New Security Paradigms, Cloudcroft, New Mexico, September 2001.
20. G. Duncan, S. Keller-McNulty, and S. Stokes. Disclosure risk vs. data utility: The R-U confidentiality map. Technical report, Los Alamos National Laboratory, Los Alamos, NM, 2001. LA-UR-01-6428.
21. Federal Committee on Statistical Methodology. Statistical policy working paper 22, Washington, DC, May 1994. Report on Statistical Disclosure Limitation Methodology.
22. P. Golle. Revisiting the uniqueness of simple demographics in the us population. In Proceedings of the Workshop on Privacy in the Electronic Society, Alexandria, VA, October 2006.
23. Y. Ishai and E. Kushilevitz. Improved upper bounds on information-theoretic private information retrieval (extended abstract). In Proceedings of the 31st annual ACM Symposium on Theory of Computing, Atlanta, GA, May1999.
24. V. S. Iyengar. Transforming data to satisfy privacy constraints. In Proceedings of the 8th ACMSIGKDD Internationale Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, 2002.
25. V. Kann. Maximum bounded h-matching is max snp-complete. Information Processing Letters, 49:309-318, 1994.
26. E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Miami Beach, FL, October 1997.
27. K. LeFevre, D. DeWitt., and R. Ramakrishnan. Mondrian multidimensional k-anonymity. In Proceedings of the International Conference on Data Engineering (ICDE06), Atlanta, GA, April 2006.
28. K. LeFevre, D. J. DeWitt, and R. Ramakrishnan. Incognito: Efficient full-domain k-anonymity. In Proceedings of ACM SIGMOD Conference on Management of Data, Baltimore, MD, June 2005.
29. N. Li, T. Li, and S. Venkatasubramanian. t-closeness: Privacy beyond k-anonymity and l-diversity. In Proceedings of the 23nd International Conference on Data Engineering, Istanbul, Turkey, April 2007.
30. Y. Lindell and B. Pinkas. Privacy preserving data mining. Journal of Cryptology, 15(3):177-206, June 2002.
31. A. Machanavajjhala, J. Gehrke, and D. Kifer. l-density: Privacy beyond k-anonymity. In Proceedings of the International Conference on Data Engineering (ICDE06), Atlanta, GA, April 2006.
32. A. Meyerson and R. Williams. On the complexity of optimal k-anonymity. In Proceedings of the 23rd ACM-SIGMOD-SIGACT-SIGART Symposium on the Principles of Database Systems,Paris,France, June 2004.
33. H. Park and K. Shim. Approximate algorithms for k-anonymity. In Proceedings of the ACM SIGMOD International Conference on Management of Data, Beijing, China, June 2007.
34. M. Reiter and A. Rubin. Anonymous Web transactions with crowds. Communications of the ACM, 42(2):32-48, February1999.
35. P. Samarati. Protecting respondents' identities in microdata release. IEEE Transactions on Knowledge and Data Engineering, 13(6):1010-1027, November 2001.
36. K. Sampigethaya and R. Poovendran. A survey on mix networks and their secure applications. Proceedings of the IEEE, 94(12):2142-2181, December 2006.
37. L. Sweeney. Achieving / -anonynity privacy protection using generalization and suppression. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 10(5):571-588, 2002.
38. P. Syverson, D. Goldschlag, and M. Reed. Anonymous connections and onion routing. In Proceedings of the 18th Annual Symposium on Security and Privacy, Oakland, CA, May 1997.
39. T. M. Truta and B. Vinay. Privacy protection: p-sensitive k-anonymity property. In Proceedings of the 22nd International Conference on Data Engineering Workshop (ICDEW06), Atlanta, GA, April 2006.
40. R. C.-W. Wong, J. Li, A. W.-C. Fu, and K. Wang. (a,k)-anonymity: An enhanced k-anonymity model for privacy preserving data publishing. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, August 2006.
41. A. Yao. Protocols for secure computations. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, Chicago, IL, November 1982.