An adaptive privacy preserving data mining model under distributed environment

Proceedings - International Conference on Signal Image Technologies and Internet Based Systems, SITIS 2007

Volumn , Issue , 2007, Pages 60-68

  Li, Feng ^a   Ma, Jin ^a   Li, Jian Hua ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; EFFICIENCY; PERTURBATION TECHNIQUES;

DATA PERTURBATION METHOD; DISTRIBUTED DATA MINING; DISTRIBUTED ENVIRONMENTS; EIGENVALUE DECOMPOSITION; LARGE-SCALE DISTRIBUTION; LIGHTWEIGHT PROTOCOLS; PRIVACY PRESERVING DATA MINING; SECURE MULTI-PARTY COMPUTATION;

DATA PRIVACY;

EID: 57849083948     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SITIS.2007.139     Document Type: Conference Paper

References (20)

1. W3 (2002) P3P 1.0 recommended version.
2. HIPAA Health Insurance Portability and Accountability Act, 1996., http://www.hhs.gov/ocr/hipaa/.
3. Canadian Standards Association. Privacy Code. http://www.csa.ca/ standards/privacvy
4. EPAL 1.1, 2003.6 http://www.zurich.ibm.com/security/enterprise-privacy/ epal/.
5. Agrawal, R. and R. Srikant, Privacy-preserving data mining. 2000, ACM Press New York, NY, USA. p. 439-450.
6. Rizvi, S.J. and J.R. Haritsa, Maintaining data privacy in association rule mining. Proceedings of 28th International Conference on Very Large Data Bases, 2002: p. 682-693.
7. Evfimievski, A., et al., Privacy preserving mining of association rules. Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, 2002: p. 217-228.
8. Chaum, D., C. Crépeau, and I. Damgard, Multiparty unconditionally secure protocols. Proceedings of the twentieth annual ACM symposium on Theory of computing, 1988: p. 11-19.
9. Beaver, D., Foundations of Secure Interactive Computing. CRYPTO, 1991. 1991: p. 377-391.
10. Cramer, R., I. Damgard, and J.B. Nielsen, Multiparty computation from threshold homomorphic encryption: Springer.
11. Kargupta, H., S. Datta, and Q. Wang, On the privacy preserving properties of random data perturbation techniques. Data Mining, 2003. ICDM 2003. Third IEEE International Conference on, 2003: p. 99-106.
12. Agrawal, D. and C.C. Aggarwal, On the design and quantification of privacy preserving data mining algorithms. Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2001: p. 247-255.
13. Chawla, S., et al., Toward privacy in public databases. Theory of Cryptography Conference, 2005: p. 363-385.
14. Fienberg, S.E. and J. McIntyre, Data Swapping: Variations on a Theme by Dalenius and Reiss. Privacy in Statistical Databases, 2004. 3050: p. 14-29.
15. Sweeney, L., Achieving k-anonymity privacy protection using generalization and suppression. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 2002. 10(5): p. 571-588.
16. Yao, A.C., How to generate and exchange secrets. Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986: p. 162-167.
17. Goldreich, O., S. Micali, and A. Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority. 19th ACM Symposium on the Theory of Computing, 1987: p. 218-229.
18. Jensen, S.H., et al., Reduction of broad-band noise in speech by truncated QSVD. Speech and Audio Processing, IEEE Transactions on, 1995. 3(6): p. 439-448.
19. Thorpe, A.J. and L.L. Scharf, Data adaptive rank-shaping methods for solving least squares problems. Signal Processing, IEEE Transactions on Acoustics, Speech, and Signal Processing, 1995. 43(7): p. 1591-1601.
20. Paillier, P., Public-key cryptosystems based on composite degree residuosity classes. Advances in Cryptology-EUROCRYPT, 1999. 99:p. 223-238.