Collusion-resistant privacy-preserving data mining

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2010, Pages 483-492

  Yang, Bin ^a   Nakagawa, Hiroshi ^a   Sato, Issei ^a   Sakuma, Jun ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

Collusion; Data mining; Distributed; Privacy; Secure multiparty computation

Indexed keywords

COLLUSION; DISTRIBUTED; GENERAL METHOD; MULTIPARTY SECURE COMPUTATION; PERSONAL INFORMATION; PRIVACY; PRIVACY PRESERVING DATA MINING; PRIVATE INFORMATION; RUNNING TIME; SECURE MULTI-PARTY COMPUTATION; SENSITIVE INFORMATIONS;

CRYPTOGRAPHY; DATA PRIVACY;

DATA MINING;

EID: 77956200067     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835804.1835867     Document Type: Conference Paper

References (30)

1. Charu C. Aggarwal, and Philip S. Yu, Privacy-Preserving Data Mining: Models and Algorithms, Springer-Verlag, 2008.
2. J. Benaloh, Dense Probabilistic Encryption. In Proceedings of the Workshop on Selected Areas of Cryptography. Kingston, ON. May 1994. pp. 120-128.
3. A. Ben-David, N. Nisan and B. Pinkas FairplayMP - A System for Secure Multi-Party Computation. In Proceedings of the ACM Computer and Communications Security Conference (ACM CCS), October 2008.
4. Raymond T. Boute, (April 1992). "The Euclidean definition of the functions div and mod". ACM Transactions on Programming Languages and Systems (TOPLAS) (ACM Press (New York, NY, USA)) 14 (2): 127-144. doi:10.1145/128861.128862
5. Christopher M. Bishop, Pattern Recognition and Machine Learning, Springer, 2006.
6. B. Chor, M. Gereb-Graus, and E. Kushilevitz, On the Structure of the Privacy Hierarchy, Journal of Cryptology, 1994, pp. 7: 53-60.
7. B. Chor, Y. Ishai, On Privacy and Partition Arguments, Information and Computation, 2001, pp. 167: 2-9.
8. I. Damgård, M. Jurik: A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System. Public Key Cryptography 2001: 119-136.
9. Y. Desmedt, J. Pieprzyk, R. Steinfeld, H. Wang: On secure multi-party computation in black-box groups. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 591-612. Springer, Heidelberg (2007)
10. T. ElGamal, A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Transactions on Information Theory, v. IT-31, n. 4, 1985, pp469-472 or CRYPTO 84, pp10-18, Springer-Verlag.
11. O. Goldreich, Foundations of Cryptography: Volume 1, Basic Tools, Cambridge University Press, 2001.
12. O. Goldreich, Foundations of Cryptography: Volume 2, Basic Applications, Cambridge University Press, 2004.
13. O. Goldreich, S. Micali, A. Wigderson: How to play any mental game - a completeness theorem for protocols with honest majority. In: 19th ACM Symposium on the Theory of Computing, pp. 218-229 (1987).
14. S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and System Sciences (JCSS), 28(2):270-299, April 1984.
15. Preliminary version in: 14th Annual ACM Symposium on Theory of Computing (STOC).
16. M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. In The ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD'02), pages 24-31, Madison, Wisconsin, June 2 2002.
17. S. Jha, L. Kruger, and P. McDamiel, Privacy Preserving Clustering, 10th European Symposium On Research In Computer Security, Milan Italy, 2005.
18. Y. Lindell, B. Pinkas: Privacy preserving data mining. In Advances in Cryptology - CRYPTO 2000, pages 36-54. Springer-Verlag, Aug. 20-24 2000.
19. D. Malkhi, N. Nisan, B. Pinkas and Y. Sella, Fairplay - A Secure Two-Party Computation System. Proceedings of Usenix Security '2004, August 9-13, 2004.
20. E. Mendelsohn and A. Rosa, One-factorizations of the complete graph - a survey, J. Graph Theory 9 (1985), pp. 43-65.
21. D. Naccache and J. Stern. A New Public Key Cryptosystem Based on Higher Residues. In Proc. of the 5th CCCS. ACM press, 199.
22. T. Okamoto and S. Uchiyama. A New Public Key Cryptosystem as Secure as Factoring. In Eurocrypt '98, LNCS 1403, pages 308-318. Springer-Verlag, 1998.
23. M. Ozarar and A. Ozgit, Secure Multiparty Overall Mean Computation via Oblivious Polynomial Evaluation, International Conference on Security of Information and Networks, 2007.
24. P. Paillier, Public-Key Cryptosystems based on Composite Degree Residue Classes, Proceedings of EuroCrypt 99, Springer Verlag LNCS series, 1998, pp. 223-238.
25. R. Rivest, A. Shamir; L. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21 (2): 120-126. doi:10.1145/359340.359342 (1978).
26. S. Urabe, J. Wang, E. Kodama and T. Takata, A High Collusion-Resistant Approach to Distributed Privacy-Preserving Data Mining. Information Processing Society of Japan, 2007.
27. J. Vaidya, C. Clifton (2003) Privacy-preserving k-means clustering over vertically partitioned data. In: The 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, pp. 206-215 (2003).
28. J. Vaidya, C. Clifton, Secure set intersection cardinality with application to association rule mining, Journal of Computer Security, v. 13 n. 4, p. 593-622, July 2005.
29. J. Vaidya, M. Kantarcioglu, C. Clifton: Privacy-preserving Naïve Bayes classification, The VLDB Journal (2008), pp. 17:879-898.
30. A. C. Yao. How to generate and exchange secrets. In Proc. of the 27th IEEE Symposium on Foundations of Computer Science, pages 162-167. IEEE, 1986.