Privacy-Preserving Decision Tree Solution in the 2-Part Fully Distributed Setting
DOI:
https://doi.org/10.54654/isj.v1i15.848Keywords:
Privacy-Preserving Data Mining, ID3, Decision tree, Elliptic curveTóm tắt
Abstract— Data mining has emerged as an important technology for obtaining knowledge from big data. However, there are growing concerns that the use of this technology is infringing on privacy. This work proposes a decision tree mining solution according to the ID3 algorithm that ensures privacy in the 2-Part Fully Distributed setting.
Downloads
References
Agrawal R., Srikant R, "Privacy-Preserving Data Mining," in The ACM SIGMOD Conference, 2000.
Vassilios S. Verykios, Elisa Bertino, Igor Nai Fovino, Loredana Parasiliti Provenza, Yucel Saygin, Yannis Theodoridis, "State-of-the-art in Privacy Preserving Data Mining," SIGMOD Rec., vol. 33, no. 1, 2004.
S. Mehnaz, and G. Bellala and E. Bertino, "A secure sum protocol and its application to privacypreserving multi-party analytics," in Proc. of the 22nd ACM on Symposium on Access Control Models and Technologies, 2017.
Supriya, "A Survey on Privacy Preserving Data Mining Techniques," International Journal of Emerging Technology and Advanced Engineering, pp. 119-122, 2015.
R. Mendes and J. P. Vilela, "Privacy-preserving data mining: methods," in IEEE Access, 2017.
The Dung Luong, Tu Bao Ho, "Privacy Preserving Frequency Mining in 2-Part Fully Distributed," IEICE Transactions on Information and Systems, pp. 2702-2708, 2010.
Y. Lindell and B. Pinkas, "Privacy preserving data mining," in Annual International Cryptology Conference, 2000.
"Privacy preserving ID3 algorithm over horizontally partitioned data," in Parallel and Distributed Computing, Applications and Technologies, 2005. PDCAT 2005. Sixth International Conference on, 2005.
Saeed Samet and Ali Miri, "Privacy preserving ID3 using Gini index over horizontally partitioned data," in Computer Systems and Applications, 2008. AICCSA 2008. IEEE/ACS International Conference on, 2008.
de Hoogh S., Schoenmakers B., Chen P., op den Akker H., " Practical Secure Decision Tree Learning in a Teletreatment Application," in Financial Cryptography and Data Security. FC 2014. Lecture Notes in Computer Science, vol 8437, Springer, Berlin, Heidelberg, 2014.
Ye Li, Xuan Wang, Zoe L. Jiang, S.M. Yiu, "Outsourcing privacy-preserving ID3 decision tree over horizontally partitioned data for multiple parties," International Journal of High Performance Computing and Networking (IJHPCN), vol. 12, no. 1, pp. 207-215, 2018.
Ye Li, Zoe L. Jiang , Xuan Wang , Junbin Fang, En Zhang , and Xianmin Wang, "Securely Outsourcing ID3 Decision Tree in Cloud Computing," Wireless Communications and Mobile Computing, vol. 2018, pp. Article ID 2385150, 10 pages, 2018.
Stacey Truex, Nathalie Baracaldo, Ali Anwar, Thomas Steinke. Heiko Ludwig and Rui Zhang, "A Hybrid Approach to Privacy-Preserving Federated Learning," CoRR, vol. abs/1812.03224, p. 11 pages, 2018.
Bart Kuijpers, Vanessa Lemmens, Bart Moelans and Karl Tuyls, "Privacy Preserving ID3 over Horizontally, Vertically and Grid Partitioned Data," CoRR, vol. abs/0803.1555, 2008.
Kamini D. Tandel and Jignasa N. Patel, "Privacy Preserving Decision Tree Classification on Horizontal Partition Data," in International Journal of Engineering Research & Technology (IJERT), 2016.
Justin Zhan, Stan Matwin, and LiWu Chang, "Privacy-Preserving Decision Tree Classification," in Proceedings of the Fifth International Conference on Electronic Business, 2005, pp. 470 - 476.
Vaidya, Jaideep and Clifton, Chris and Kantarcioglu, Murat and Patterson, A. Scott, "Privacy-Preserving Decision Trees over Vertically Partitioned Data," ACM Trans. Knowl. Discov. Data, vol. 2, no. 3, p. 1–27, 2008.
Fang, Weiwei and Yang, Bingru, "Privacy Preserving Decision Tree Learning over Vertically Partitioned Data," in 2008 International Conference on Computer Science and Software Engineering, 2008, pp. 1049-1052.
Shuguo HAN, and Wee Keong NG, "Multi-Party Privacy-Preserving Decision Trees for Arbitrarily Partitioned Data," INTERNATIONAL JOURNAL OF INTELLIGENT CONTROL AND SYSTEMS, vol. 2, no. 4, pp. 351-358, 2007.
Thi Van Vu, The Dung Luong, Van Quan Hoang, "An Elliptic Curve-based Protocol for Privacy Preserving Frequency Computation in 2-Part Fully Distributed Setting," in 12th International Conference on Knowledge and Systems Engineering (KSE), Can Tho, 2020.
Christof Paar and Jan Pelzl, Understanding Cryptography, Springer, Berlin, Heidelberg, 2010.
Canetti, Ran, "Decisional Diffie-Hellman Assumption," in Encyclopedia of Cryptography and Security, Boston, MA, Springer US, 2005, pp. 140-142.
Steven D. Galbraith, Ping Wang and Fangguo Zhang, "Computing Elliptic Curve Discrete Logarithms with Improved," Cryptology ePrint Archive, 2015.
Siraj, Maheyzah Md and Rahmat, Nurul Adibah and Din, Mazura Mat, "A Survey on Privacy Preserving Data Mining Approaches and Techniques," in Proceedings of the 2019 8th International Conference on Software and Computer Applications, New York, NY, USA, Association for Computing Machinery, 2019, p. 65–69.
Chris Clifton, Murat Kantarcioglu,Jaideep Vaidya, Xiaodong Lin, Michael Y. Zhu, "Tools for Privacy Preserving Distributed Data Mining," SIGKDD Explorations, vol. 4, no. 2, pp. 1-5, 2002.
Babak Siabi, Mehdi Berenjkoub, Willy Susilo, "Optimally Efficient Secure Scalar Product With Applications in Cloud Computing," IEEE Access, vol. 7, no. 1, pp. 42798 - 42815, 29 3 2019.
C. Dong, L. Chen, "A Fast Secure Dot Product Protocol with Application to Privacy Preserving Association Rule Mining," in Proc. of Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2014.
Y. Zhu,T. Takagi, "Efficient scalar product protocol and its privacypreserving application," in International J. of Electronic Security and Digital Forensics, Vol. 7, No. 1, 2015.
Goethals, Bart and Laur, Sven and Lipmaa, Helger and Mielikainen, Taneli, "On private scalar product computation for privacy-preserving data mining," in Proc. of International Conference on Information Security and Cryptology, 2004.
V.Duy-Hien, L.The-Dung, H.Tu-Bao, "An Efficient Approach for Secure Multiparty Computation without Authenticated Channel," in Information Science, 2019.
Downloads
Published
How to Cite
Issue
Section
License
Proposed Policy for Journals That Offer Open Access
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
Proposed Policy for Journals That Offer Delayed Open Access
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication, with the work [SPECIFY PERIOD OF TIME] after publication simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
