In this paper we introduce a new approach to multiparty association rules mining based on a polynomial representation of sets encrypted with a homomorphic threshold cryptosystem. We describe a homogeneous collaborative multiparty association rules mining protocol that is secure in a malicious model. Presented algorithm is designed to enhance security and privacy in distributed environments where a malicious adversary may deviate arbitrarily from the prescribed protocol as it attempts to compromise the privacy of the other parties’ inputs or the correctness of the obtained result. To the best of our knowledge, the protocol presented in this paper is the first multiparty association rules mining protocol that is secure against malicious adversaries in distributed systems.
CITATION STYLE
Gorawski, M., Siedlecki, Z., & Gorawska, A. (2015). Collaborative multiparty association rules mining with threshold homomorphic encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9532, pp. 251–263). Springer Verlag. https://doi.org/10.1007/978-3-319-27161-3_22
Mendeley helps you to discover research relevant for your work.