We present a generalization of a strategy, called SCIKD, proposed in [7] that allows to reduce a disclosure risk of confidential data in an information system S[10] using methods based on knowledge discovery. The method proposed in [7] protects confidential data against Rule-based Chase, the null value imputation algorithm driven by certain rules [2], [4]. This method identifies a minimal subset of additional data in Swhich needs to be hidden to guarantee that the confidential data are not revealed by Chase. In this paper we propose a bottom-up strategy which identifies, for each object xin S, a maximal set of values of attributes which do not have to be hidden and still the information associated with secure attribute values of xis protected. It is achieved without examining all possible combinations of values of attributes. Our method is driven by classification rules extracted from Sand takes into consideration their confidence and support.
[1]
Wenliang Du,et al.
Secure multi-party computation problems and their applications: a review and open problems
,
2001,
NSPW '01.
[2]
Z..
INFORMATION SYSTEMS THEORETICAL FOUNDATIONS
,
2022
.
[3]
Chris Clifton,et al.
Privacy-preserving distributed mining of association rules on horizontally partitioned data
,
2004,
IEEE Transactions on Knowledge and Data Engineering.
[4]
Wenliang Du,et al.
Building decision tree classifier on private data
,
2002
.
[5]
Stanley Robson de Medeiros Oliveira,et al.
Privacy preserving frequent itemset mining
,
2002
.
[6]
Zbigniew W. Ras,et al.
Solving Failing Queries through Cooperation and Collaboration
,
2006,
World Wide Web.
[7]
A. Yao,et al.
Fair exchange with a semi-trusted third party (extended abstract)
,
1997,
CCS '97.