R. Agrawal, A. Evfimievski, and R. Srikant, Information sharing across private databases, Proceedings of the 2003 ACM SIGMOD international conference on on Management of data , SIGMOD '03, pp.86-97
DOI : 10.1145/872757.872771
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.3600

R. Agrawal, T. Imielinski, and A. Swami, Mining association rules between sets of items in large databases, Proceedings of the 1993 ACM SIGMOD international conference on Management of data, SIGMOD'93, pp.207-216, 1993.

R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. Verkamo, Fast discovery of association rules, Advances in Knowledge Discovery and Data Mining, pp.307-328, 1996.

R. Agrawal and R. Srikant, Privacy-preserving data mining, Proc. of the ACM SIGMOD Conference on Management of Data, pp.439-450, 2000.

M. Atallah, A. Elmagarmid, M. Ibrahim, E. Bertino, and V. Verykios, Disclosure limitation of sensitive rules, Proceedings 1999 Workshop on Knowledge and Data Engineering Exchange (KDEX'99) (Cat. No.PR00453), p.45, 1999.
DOI : 10.1109/KDEX.1999.836532

S. B. Yahia, T. Hamrouni, and E. M. Nguifo, Frequent closed itemset based algorithms, ACM SIGKDD Explorations Newsletter, vol.8, issue.1, pp.93-104, 2006.
DOI : 10.1145/1147234.1147248
URL : https://hal.archives-ouvertes.fr/hal-00109569

C. Clifton, M. Kantarcioglu, and J. Vaidya, Tools for privacy preserving distributed data mining, ACM SIGKDD Explorations Newsletter, vol.4, issue.2, pp.28-34, 2003.
DOI : 10.1145/772862.772867
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.417

W. Du and Z. Zhan, Building decision tree classifier on private data, Proceedings of the IEEE International conference on privacy, security and data mining, pp.1-8, 2002.

M. Kantarcioglu, A Survey of Privacy-Preserving Methods Across Horizontally Partitioned Data, Privacy-Preserving Data Mining: Models and Algorithms, pp.313-335, 2008.
DOI : 10.1007/978-0-387-70992-5_13

M. Kantarcioglu and C. Clifton, Privacy-preserving distributed mining of association rules on horizontally partitioned data, IEEE Transactions on Knowledge and Data Engineering, vol.16, issue.9, pp.1026-1037, 2004.
DOI : 10.1109/TKDE.2004.45

M. Kantarcioglu, J. Jin, and C. Clifton, When do data mining results violate privacy?, Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '04, pp.599-604, 2004.
DOI : 10.1145/1014052.1014126

S. Khayat, Using commutative encryption to share a secret, Cryptology ePrint Archive Report, vol.356, 2008.

X. Lin, C. Clifton, and M. Zhu, Privacy-preserving clustering with distributed EM mixture modeling, Knowledge and Information Systems, vol.86, issue.1, pp.68-81, 2005.
DOI : 10.1080/01621459.1991.10475130

Y. Lindell and B. Pinkas, Privacy preserving data mining, Journal of Cryptology, pp.36-54

A. Menezes, S. Vanstone, and V. Oorschot, Handbook of Applied Cryptography, 1996.
DOI : 10.1201/9781439821916

N. Pasquier, Datamining: Algorithmes d'extraction et de réduction des r` egles d'association dans les bases de données, 2000.

N. Pasquier, Mining association rules using formal concept analysis Working with Conceptual Structures. Contributions to ICCS, Verlag Shaker Aachen, pp.259-264, 2000.

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Efficient mining of association rules using closed itemset lattices, Information Systems, vol.24, issue.1, pp.25-46, 1999.
DOI : 10.1016/S0306-4379(99)00003-4

B. Pinkas, Cryptographic techniques for privacy-preserving data mining, ACM SIGKDD Explorations Newsletter, vol.4, issue.2, pp.12-19, 2002.
DOI : 10.1145/772862.772865

A. Shamir, On the power of commutativity in cryptography, Proceedings of the 7th Colloquium on Automata, Languages and Programming, pp.582-595, 1980.
DOI : 10.1007/3-540-10003-2_100

S. Weis, New foundations for efficient authentification, commutative cryptography, and private disjointness testing, 2006.

R. Wille, Restructuring lattice theory: An approach based on hierarchies of concepts, Ordered Sets, pp.445-470, 1982.

S. B. Yahia, G. Gasmi, and E. M. Nguifo, A new generic basis of factual and implicative association rules. Intelligent Data Analysis, An International Journal (IDA), vol.13, issue.4, 2009.

A. Yao, Protocols for secure computations, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), pp.160-164, 1982.
DOI : 10.1109/SFCS.1982.38

A. Yao, How to generate and exchange secrets, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pp.162-167, 1986.
DOI : 10.1109/SFCS.1986.25