Secure distributed computation of anonymized views of shared databases

ACM Transactions on Database Systems

Volumn 37, Issue 2, 2012, Pages

  Tassa, Tamir ^a   Gudes, Ehud ^b  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Distributed data mining; K anonymization; Privacy preserving data mining; Secure multiparty computation

Indexed keywords

ANONYMIZATION; CRYPTOGRAPHIC ASSUMPTIONS; CRYPTOGRAPHIC PRIMITIVES; DISTRIBUTED COMPUTATIONS; DISTRIBUTED DATA MINING; K-ANONYMIZATION; PRIVACY PRESERVING DATA MINING; SECURE MULTI-PARTY COMPUTATION; SENSITIVE INFORMATIONS; SEQUENTIAL ALGORITHM; UTILITY MEASURE;

ALGORITHMS; CRYPTOGRAPHY; DATA MINING; DATA PRIVACY;

DATABASE SYSTEMS;

EID: 84863607195     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/2188349.2188353     Document Type: Article

References (50)

1. AGGARWAL, C. and YU, P. 2004. A condensation approach to privacy preserving data mining. In Proceedings of the International Conference on Extending Database Technology (EDBT'04). 183-199.
2. AGGARWAL, G., FEDER, T., KENTHAPADI, K., KHULLER, S., PANIGRAHY, R., THOMAS, D., and ZHU, A. 2006. Achieving anonymity via clustering. In Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS'06). 153-162. (Pubitemid 46946477)
3. AGGARWAL, G., FEDER, T., KENTHAPADI, K., MOTWANI, R., PANIGRAHY, R., THOMAS, D., and ZHU, A. 2005. Anonymizing tables. In Proceedings of the International Conference on Database Technology (ICDT'05). Lecture Notes in Computer Science, vol. 3363, Springer, 246-258.
4. AGGARWAL, G., MISHRA, N., and PINKAS, B. 2004. Secure computation of the kth-ranked element. In Proceedings of the EUROCRYPT Conference.
5. AGRAWAL, R. and SRIKANT, R. 2000. Privacy-Preserving data mining. In Proceedings of the ACM SIGMOD Conference on Management of Data. 439-450.
6. BAYARDO, R. and AGRAWAL, R. 2005. Data privacy through optimal k-anonymization. In Proceedings of the International Conference on Data Engineering (ICDE'05).
7. BEAVER, D., MICALI, S., and ROGAWAY, P. 1990. The round complexity of secure protocols. In Proceedings of the ACM Symposium on Theory of Computing (STOC'90). 503-513.
8. BEN-DAVID, A., NISAN, N., and PINKAS, B. 2008. FairplayMP-A system for secure multi-party computation. In Proceedings of the Conference on Computer and Communications Security (CCS'08). 257-266.
9. BYUN, J., KAMRA, A., BERTINO, E., and LI, N. 2007. Efficient k-anonymization using clustering techniques. In Proceedings of the International Conference on Database Systems for Advanced Applications (DAS-FAA'07).
10. CORMODE, G. 2011. Personal privacy vs population privacy: Learning to attack anonymization. In Proceedings of the Annual ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'11). 1253-1261.
11. DOMINGO-FERRER, J., MARTÍNEZ-BALLESTÉ, A., MATEO-SANZ, J., and SEBÉ, F. 2006. Efficient multi-variate dataoriented microaggregation. VLDB J. 15, 355-369.
12. DWORK, C. 2006. Differential privacy. In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP'06). Vol. 2. 1-12. (Pubitemid 44113232)
13. DWORK, C., MCSHERRY, F., NISSIM, K., and SMITH, A. 2006. Calibrating noise to sensitivity in private data analysis. In Proceedings of the Technology, Colleges and Community Worldwide Online Conference (TCC'06). 265-284. (Pubitemid 43979853)
14. EMAM, K. E. and DANKAR, F. 2008. Protecting privacy using k-anonymity. J. Amer. Med. Inf. Assoc. 15, 627-637.
15. EMAM, K. E., DANKAR, F., ISSA, R., JONKER, E., AMYOT, D., COGO, E., CORRIVEAU, J.-P., WALKER, M., CHOWDHURY, S., VAILLANCOURT, R., ROFFEY, T., and BOTTOMLEY, J. 2009. A globally optimal k-anonymity method for the de-identification of health information. J. Amer. Med. Inf. Assoc. 16, 670-682.
16. FAGIN, R., NAOR, M., and WINKLER, P. 1996. Comparing information without leaking it. Comm. ACM 39, 77-85. (Pubitemid 126428128)
17. GHINITA, G., KARRAS, P., KALNIS, P., and MAMOULIS, N. 2009. A framework for efficient data anonymization under privacy and accuracy constraints. ACM Trans. Datab. Syst. 34.
18. GIONIS, A., MAZZA, A., and TASSA, T. 2008. K-Anonymization revisited. In Proceedings of the International Conference on Data Engineering (ICDE'08). 744-753.
19. GIONIS, A. and TASSA, T. 2009. K-Anonymization with minimal loss of information. IEEE Trans. Knowl. Data Engin. 21, 206-219.
20. GOLDBERGER, J. and TASSA, T. 2010. Efficient anonymizations with enhanced utility. Trans. Data Privacy 3, 149-175.
21. GOLDREICH, O., MICALI, S., and WIGDERSON, A. 1987. How to play any mental game or A completeness theorem for protocols with honest majority. In Proceedings of the ACM Symposium on Theory of Computing (STOC'87). 218-229. (Pubitemid 18643409)
22. IYENGAR, V. 2002. Transforming data to satisfy privacy constraints. In Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 279-288.
23. JIANG, W. and CLIFTON, C. 2006. A secure distributed framework for achieving k-anonymity. VLDB J. 15, 316-333.
24. JURCZYK, P. and XIONG, L. 2009. Distributed anonymizations: Achieving privacy for both data subjects and data providers. In Proceedings of the Conference on Data and Applications Security. 191-207.
25. KANTARCIOGLU, M. and CLIFTON, C. 2004. Privacy-Preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowl. Data Engin. 16, 1026-1037.
26. KENIG, B. and TASSA, T. 2012. A practical approximation algorithm for optimal k-anonymity. In Proceedings of the Conference on Data Mining and Knowledge Discovery.
27. KIFER, D. 2009. Attacks on privacy and definetti's theorem. In Proceedings of the ACM SIGMOD Conference on Management of Data. 127-138.
28. KIRKPATRICK, S., JR., D. G. and VECCHI, M. 1983. Optimization by simulated annealing. Sci. 220, 4598, 671-680.
29. LEFEVRE, K., DEWITT, D., and RAMAKRISHNAN, R. 2005. Incognito: Efficient full-domain k-anonymity. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 49-60. (Pubitemid 43038916)
30. LEFEVRE, K., DEWITT, D. J., and RAMAKRISHNAN, R. 2006. Mondrian multidimensional k-anonymity. In Proceedings of the International Conference on Data Engineering (ICDE'06).
31. LI, N., LI, T., and VENKATASUBRAMANIAN, S. 2007. T-Closeness: Privacy beyond k-anonymity and l-diversity. In Proceedings of the International Conference on Data Engineering (ICDE'07). 106-115. (Pubitemid 47422014)
32. MACHANAVAJJHALA, A., GEHRKE, J., KIFER, D., and VENKITASUBRAMANIAM, M. 2006. L-Diversity: Privacy beyond k-anonymity. In Proceedings of the International Conference on Data Engineering (ICDE'06). 24.
33. MEYERSON, A. and WILLIAMS, R. 2004. On the complexity of optimal k-anonymity. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS'04). 223-228.
34. MOHAMMED, N., FUNG, B., WANG, K., and HUNG, P. 2009. Privacy-Preserving data mashup. In Proceedings of the International Conference on Extending Database Technology (EDBT'09).
35. NERGIZ, M., ÇIÇEK, E., and SAYGM, Y. 2011. A look ahead approach to secure multi-party protocols. IEEE Trans. Knowl. Data Engin.
36. NERGIZ, M. and CLIFTON, C. 2006. Thoughts on k-anonymization. In Proceedings of the ICDE Workshops. 96.
37. NISSIM, K., RASKHODNIKOVA, S., and SMITH, A. 2007. Smooth sensitivity and sampling in private data analysis. In Proceedings of the ACM Symposium on Theory of Computing (STOC'07). 75-84. (Pubitemid 47630723)
38. PARK, H. and SHIM, K. 2007. Approximate algorithms for k-anonymity. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 67-78. (Pubitemid 47630797)
39. SAMARATI, P. 2001. Protecting respondent's privacy in microdata release. IEEE Trans. Knowl. Data Engin. 13, 1010-1027. (Pubitemid 34035590)
40. SAMARATI, P. and SWEENEY, L. 1998. Generalizing data to provide anonymity when disclosing information. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS'98). 188.
41. SWEENEY, L. 2002. Achieving k-anonymity privacy protection using generalization and suppression. Int. J. Uncert. Fuzz. Knowl. Based Syst. 10, 571-588. (Pubitemid 35384858)
42. TASSA, T., MAZZA, A., and GIONIS, A. 2012. K-Concealment: An alternative model of k-type anonymity. Trans. Datab. Privacy.
43. TRUTA, T., CAMPAN, A., and MEYER, P. 2007. Generating microdata with p-sensitive k-anonymity property. In Proceedings of the SIAM International Conference on Data Mining (SDM'07). 124-141.
44. WONG, R., LI, J., FU, A., and WANG, K. 2006. (a, k)-Anonymity: An enhanced k-anonymity model for privacy preserving data publishing. In Proceedings of the Annual ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'06). 754-759. (Pubitemid 44535586)
45. XIAO, X. and TAO, Y. 2006. Anatomy: Simple and effective privacy preservation. In Proceedings of the International Conference on Very Large Databases (VLDB'06).
46. XU, J., WANG, W., PEI, J., WANG, X., SHI, B., and FU, A.-C. 2006. Utility-Based anonymization using local recoding. In Proceedings of the Annual ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'06). 785-790. (Pubitemid 44535591)
47. YAO, A. 1982. Protocols for secure computation. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS'82). 160-164.
48. YUAN, J., YE, Q., WANG, H., and PIEPRZYK, J. 2008. Secure computation of the vector dominance problem. In Proceedings of the IPSEC'08 Conference. 319-333. (Pubitemid 351465335)
49. ZHONG, S., YANG, Z., and WRIGHT, R. 2005. Privacy-Enhancing k-anonymization of customer data. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS'05). 139-147. (Pubitemid 43275477)
50. ZIVAN, R. and MEISELS, A. 2006. Message delay and discsp search algorithms. Ann. Math. Artif. Intell. 46, 415-439. (Pubitemid 44661807)