Feng Zhang
ABSTRACT
Privacy-preserving data mining aims at discovering beneficial information from a large amount of data without violating the privacy policy. Privacy-preserving association rules mining research has already generated many interesting results. Based on commutative encryptions and the Secure Multi-party Computation (SMC) theory, Kantarcioglu and Clifton [1] propose two protocols to implement privacy-preserving mining of association rules over horizontally partitioned data. The paper addresses its incorrect security proof and introduces a more well-founded proof. This paper also identifies several other errors in [1]. This kind of protocols and their proof are a concrete application of Secure Multi-party Computation, which is be of great significances to the privacy-preserving data mining studies based on SMC. Thus establishment of the correct proof methodology is important. This paper demonstrates the correct proof methodology by correcting the fault proof in [1]
- M. Kantarcioglu, C. Clifton. Privacy-preserving Distributed Mining of Association Rules on Horizontally Partitioned Data. IEEE Trans. Knowledge and Data Engineering. (16)9,1026--1037(2004) Google Scholar
Digital Library
- J. Vaidya, C. Clifton and M. Zhu: Privacy Preserving Data Mining (Advances in Information Security. Springer-Verlag New York Inc(2005) Google ScholarDigital Library
- V. S. Verykios, E. Bertino, I. N. Fovino, L.P. Provenza, Y. Saygin and Y. Theodoridis. State-of-the-art in privacy preserving data mining. SIGMOD Record, (33)1, 50--57(2004) Google ScholarDigital Library
- O. Goldreich. Foundations of Cryptography: Volume 2,Basic Applications. Cambridge University Press, (2004) Google ScholarDigital Library
- M. Bellare, P. Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In: ACM Conf. Computer and Communications Security, pp 62--73,(1993) Google ScholarDigital Library
- R. Agrawal, A. Evfimievski, and R. Srikant. Information sharing across private databases. In: Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 86--97, (2003) Google ScholarDigital Library
- D. Boneh. The Decision Diffie-Hellman Problem. In: Proc. Third Algorithmic Number Theory Symp., LNCS 1423, pp 48--63, (1998) Google ScholarDigital Library
- J. Vaidya, Chris Clifton. Secure set intersection cardinality with application to association rule mining. Journal of Computer Security, (13)4, 593--622(2005) Google ScholarDigital Library
Index Terms
- A more well-founded security proof of the privacy-preserving distributed mining of association rules protocols
Recommendations
Privacy-preserving collaborative association rule mining
This paper introduces a new approach to a problem of data sharing among multiple parties, without disclosing the data between the parties. Our focus is data sharing among parties involved in a data mining task. We study how to share private or ...
Privacy-Preserving Two-Party Distributed Association Rules Mining on Horizontally Partitioned Data
CLOUDCOM-ASIA '13: Proceedings of the 2013 International Conference on Cloud Computing and Big DataIn many applications, data mining has to be done in distributed data scenarios. In such situations, data owners may be concerned with the misuse of data, hence, they do not want their data to be mined, especially when these contain sensitive ...
TCOM, an innovative data structure for mining association rules among infrequent items
Association rule mining is one of the most important areas in data mining, which has received a great deal of attention. The purpose of association rule mining is the discovery of association relationships or correlations among a set of items. In this ...
Comments