Mining information from model build without information disclosure

M. Sumana, K. S. Hareesh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper confers an approach of categorizing multiple datasets that are distributed at various sites. The variation in this method of classification is that all the parties jointly build a decision tree model revealing only sufficient information and hiding superfluous data. We have used secure protocols such as secure sum and secure union using commutative encryption technique while model construction. The process discussed in our paper builds efficient, binary classification trees which can in turn predict a test data given by any of the parties involved in the classification.

Original languageEnglish
Title of host publicationEmerging Research in Electronics, Computer Science and Technology - Proceedings of International Conference, ICERECT 2012
PublisherSpringer Verlag
Pages819-827
Number of pages9
ISBN (Print)9788132211563
DOIs
Publication statusPublished - 01-01-2014
Event1st International Conference on Emerging Research in Electronics, Computer Science and Technology, ICERECT 2012 - Karnataka, India
Duration: 21-12-201222-12-2012

Publication series

NameLecture Notes in Electrical Engineering
Volume248 LNEE
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Conference

Conference1st International Conference on Emerging Research in Electronics, Computer Science and Technology, ICERECT 2012
CountryIndia
CityKarnataka
Period21-12-1222-12-12

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Cite this

Sumana, M., & Hareesh, K. S. (2014). Mining information from model build without information disclosure. In Emerging Research in Electronics, Computer Science and Technology - Proceedings of International Conference, ICERECT 2012 (pp. 819-827). (Lecture Notes in Electrical Engineering; Vol. 248 LNEE). Springer Verlag. https://doi.org/10.1007/978-81-322-1157-0_83