F-Classify: Fuzzy Rule Based Classification Method for Privacy Preservation of Multiple Sensitive Attributes

Attaullah, Hasina; Anjum, Adeel; Kanwal, Tehsin; Malik, Saif Ur Rehman; Asheralieva, Alia; Malik, Hassan; Zoha, Ahmed; Arshad, Kamran; Imran, Muhammad Ali

doi:10.3390/s21144933

Open AccessArticle

F-Classify: Fuzzy Rule Based Classification Method for Privacy Preservation of Multiple Sensitive Attributes

by

Hasina Attaullah

¹,

Adeel Anjum

^1,2

,

Tehsin Kanwal

¹,

Saif Ur Rehman Malik

^1,3,*,

Alia Asheralieva

²

,

Hassan Malik

⁴,

Ahmed Zoha

⁵

,

Kamran Arshad

⁶

and

Muhammad Ali Imran

^5,7

¹

Department of Computer Sciences, COMSATS University, Islamabad 45550, Pakistan

²

Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen 518055, China

³

Cybernetica AS, 12618 Tallinn, Estonia

⁴

Department of Computer Science, Edge Hill University, Lancashire L39 4QP, UK

⁵

James Watt School of Engineering, University of Glasgow, Glasgow G12 8QQ, UK

⁶

College of Engineering and IT, Ajman University, Ajman 20550, United Arab Emirates

⁷

Artificial Intelligence Research Centre (AIRC), Ajman University, Ajman 20550, United Arab Emirates

^*

Author to whom correspondence should be addressed.

Sensors 2021, 21(14), 4933; https://doi.org/10.3390/s21144933

Submission received: 6 April 2021 / Revised: 5 July 2021 / Accepted: 6 July 2021 / Published: 20 July 2021

(This article belongs to the Special Issue Sensing and Data Analysis Techniques for Intelligent Healthcare)

Download

Browse Figures

Versions Notes

Abstract

:

With the advent of smart health, smart cities, and smart grids, the amount of data has grown swiftly. When the collected data is published for valuable information mining, privacy turns out to be a key matter due to the presence of sensitive information. Such sensitive information comprises either a single sensitive attribute (an individual has only one sensitive attribute) or multiple sensitive attributes (an individual can have multiple sensitive attributes). Anonymization of data sets with multiple sensitive attributes presents some unique problems due to the correlation among these attributes. Artificial intelligence techniques can help the data publishers in anonymizing such data. To the best of our knowledge, no fuzzy logic-based privacy model has been proposed until now for privacy preservation of multiple sensitive attributes. In this paper, we propose a novel privacy preserving model F-Classify that uses fuzzy logic for the classification of quasi-identifier and multiple sensitive attributes. Classes are defined based on defined rules, and every tuple is assigned to its class according to attribute value. The working of the F-Classify Algorithm is also verified using HLPN. A wide range of experiments on healthcare data sets acknowledged that F-Classify surpasses its counterparts in terms of privacy and utility. Being based on artificial intelligence, it has a lower execution time than other approaches.

Keywords:

DCP; F-Classify; membership function; MSA; MST; (p, k) angelization; QT

1. Introduction

In the digital era, data collection and storage for ultimate analysis are constantly expanding. The ownership of collected data allows data holders to utilize it for useful data mining. Given that data proprietors are not usually data professionals, collected data must be made accessible so that data analysts may use it. When data is shared for mutual benefit, individual privacy becomes a major concern. Individual privacy is compromised by the information set obtained, which comprises explicit identifiers, quasi-identifiers (QIs), sensitive attributes (SAs), and insensitive attributes. Personal identifiers, such as a name or a national identification number, are examples of explicit identifiers that are almost always re-identified. The privacy-preserving strategies presented in the literature [1,2,3] usually eliminated them from data sets. QIs are such attributes that, when combined, can assist to link a person to an externally available source, such as age, gender, and zip code. SAs contain sensitive information about a person, and their disclosure could significantly contribute to individual privacy. Insensitive attributes remain unchanged, as they are commonly not linked with privacy threats.

Today’s health care and other micro-data publishing entities are concerned about maintaining privacy without losing information. According to the research, there is an inverse relationship between privacy and information loss (data utility). K-anonymity [1] and its derivatives l-diversity [2], t-closeness [3] and many other [4,5] are examples of early work on privacy preservation based on generalization. The majority of the methods proposed in the literature [1,2,3,4,5,6] focus on single sensitive attribute data sets and rely on single-dimensional generalization. However, in most cases, real-world data publishing entities will have multiple sensitive attributes (MSAs). Known anonymization techniques like k-anonymity [1,6] and l-diversity [2] that were previously proposed do not preserve privacy for MSAs. In the case of MSAs, these techniques fail to protect privacy because the adversary breaches privacy with some background and non-membership knowledge attack.

Motivation

In this section, different scenarios are presented to demonstrate how previous techniques fail to deal with MSAs. In Table 1, Gender, Age, and Zipcode are QIs whereas Disease, Treatment, Physician, Symptom, and Diagnostic method are SAs. Table 2 displays anonymization of the micro-data of Table 1 by removing the explicit identifiers from Table 1 and also showing generalization of QIs by making each group three diverse and four anonymous. The privacy breaches are explained in different scenarios.

Scenario 1: Let us start with a scenario in which the adversary already knows something about their next-door neighbor Richard. The adversary knows Richard is a 26-year-old man who lives in the same neighborhood as him, therefore he also knows their zip code. He noticed that Richard has recently lost weight. With such background and demographic knowledge, the adversary identifies from Table 2 that Richard belongs to group 1, and then discovers that the only patient in group 1 who has lost weight has cancer. In this manner, privacy is compromised by exploiting some demographic and background knowledge.

Scenario 2: In a different scenario, if the adversary from Table 2 knows Ana’s diagnostic method is an ELISA test, the adversary will be able to easily determine that Ana has HIV. As a result, existing approaches for single sensitive attributes are insufficient when it comes to preserving privacy for multiple sensitive attributes.

Scenario 3: In the case of MSAs, the previously proposed techniques for MSAs [7,8] still have some limitations. Single dimensional generalization is used in proposed MSA approaches, and there is a trade-off between privacy disclosure and data utility. SLOMS [9] has a demographic knowledge attack and significant information loss, whereas SLASMA [7] has a privacy risk from a demographic knowledge attack as well as low data utility.

Scenario 4: The approach (p, k) angelization [8] is similar to the strategy angelization [10], except that an adversary uses background knowledge to obtain a single SA value for each attribute by iteratively intersecting MSAs in correlated buckets. Additionally, because (p, k) angelization is based on MSA weight computations, the algorithm is more complex and takes longer to complete..

In this article, a fuzzy logic [11] based approach is proposed to address the limitations of previously proposed techniques; it is multi-dimensional partitioning and a rule-based technique. To preserve privacy, it offers multi-dimensional partitioning for both QIs and SAs. In the literature, fuzzy-based techniques for privacy preservation are proposed in [12,13], but none of them include MSAs.

The initial step in the proposed approach is to apply fuzzy classification on QIs (Age–Zipcode) and generate classes. Classification is not limited to 2-anonymous (two tuples in one class) or 3-anonymous (three tuples in one class); instead, each class has a different number of tuples. For example, class q-C2 has five patients in Table 3a, whereas class q-C4 has only one. SAs are classified after QIs have been classified. In SA classification, the class containing one patient is merged with another class to make the classification at least 2-anonymous and to avoid identity disclosure. In Figure 1 and Figure 2, Matlab [14] simulations of fuzzy logic membership functions (mfs) and rules assessment are shown. Table 3b shows the results of the fuzzy classification of three SAs.

As a final step, a permutation is used to generate anonymized data based on Table 3a–c. Table 4b,c are anonymized tables for MSTs to be published after patient identities were removed from Table 3b,c.

To evaluate the privacy breach of anonymized Table 4a, in the worst-case scenario, there is only one patient P12 in the last tuple of Table 4a, and the likelihood of re-identification is high. C1 and

α

C3 are the classes allocated to patient P12 based on SAs, and when looking at Table 4b,c, it can be seen that C1 has four tuples and

α

C3 has two. Going deeper into C1, there are three different diseases for disease attribute {Asthma, Flu, Indigestion}, as well as three distinct physicians {Suzan, Anas, Jem}. Similarly, there are two separate symptoms in

α

C3 {eating disorder, heartburn}, as well as three different diagnostic methods {Methacholine challenge Tests, Body mass index, Chest X-ray}. Going into further detail with C1, there are three different diseases {Asthma, Flu, Indigestion} for disease attribute and three different physicians {Suzan, Anas, Jem}. Likewise, in

α

C3 there are 2 different symptoms {eating disorder, heartburn} and 3 different diagnostic methods {Methacholine challenge Tests, Body mass index, Chest X-ray}. As a result, it would be difficult for an adversary to deduce a direct relationship between any information in a high-dimensional data set with only one attribute in one class.

The following are the main contributions of this paper:

The article presents a fuzzy logic classifier (F-Classify) based on artificial intelligence (AI). The suggested methodology classifies QIs and SAa using a single methodology, namely fuzzy classification, rather than utilizing two distinct approaches for QIs and SAa. Instead of fixed classes/buckets, variable numbers of classes/buckets (k is variable) are formed in the proposed methodology.
The proposed algorithm is verified for correctness using higher-level Petri nets (HLPN).
The proposed F-classify approach is implemented in Python, and the results are compared to those obtained through (p-k) angelization. The results indicate that fuzzy classification (multi-dimensional partitioning) of correlated attributes increases data utility while permutation of multiple tables improves privacy. When compared to techniques that propose two different methods for QIs and SAs privacy, F-classify uses fuzzy logic for both QAs and SAs, resulting in minimal overhead.

In this article, the privacy preservation of MSAs is studied and proposed, the following section will highlight relevant work. Section 3 will discuss preliminaries and definitions, and Section 4 will describe the proposed work. Validation of the proposed approach is demonstrated using HLPN in Section 5. In Section 6, the findings and discussion are presented. The article concludes with Section 7.

2. Literature Review

This section summarizes the work that has been done so far in the area of privacy-preserving data publishing of single and multiple sensitive attribute data sets. Many privacy-preserving approaches have been proposed, using generalization, bucketization, or slicing techniques. K-anonymity [1,6], l-diversity [2], t-closeness [3] and many others [4,5,15,16,17] used generalization to provide privacy. Work based on bucketization has been proposed in [18,19,20,21], while slicing is a relatively new and evolving approach, first proposed by Li et al. [22].

The majority of these approaches focused on a single sensitive attribute. In reality, the data could be comprised of MSAs. The preservation of MSA privacy is still in its early phases, and a wide range of anonymization models have been presented in this regard, using several methodologies. Slicing [9,22], a method for anonymizing MSAs, was first presented in [22] for anonymizing high dimensional data. Because generalization causes information loss, Susan et al. [7] suggested a privacy model SLAMSA that utilized anatomization with slicing to resolve the information loss issue. Some enhanced slicing models, such as suppression and mondrian slicing, have been introduced in [23]. To eliminate the co-relationship between MSAs, Ref. [9] proposed “SLOMS”, which used slicing. Aside from slicing, numerous alternative approaches based on clustering and multi-sensitive bucketization have been proposed (MSB). For the privacy preservation of numerical MSAs, MSB-based approaches have been introduced [24], but these approaches have ignored textual data.

Another strategy (

α

, l) was proposed to meet the diversity of MSAs. Positive and negative disclosure risks are minimized in this technique by analyzing the correlation between MSAs [22,25,26]. (

α

, l) is also utilized in [27], together with anatomy, generalization, and suppression, which resulted in significant data loss. Ref. [28] introduces a rating approach for MSAs; it generalizes the sensitive attribute values, increasing information loss and hence decreasing utility. Another approach, Ref. [28], is based on rating, and the rating used could be compromised via association rules. The decomposition-based technique and its extension decomposition plus improved l-diversity for MSAs [29,30]. In [31], “ANGELMS” have been proposed to anonymize MSAs using vertical partitioning. Ref. [32] proposes a (p+)-sensitive and t-closeness model for MSAs that meets t-closeness requirements for the published table.

The privacy model (p, k) angelization [8] has some significant advantages over others, but it still has certain shortcomings because weights have been calculated and allocated to SAs based on interdependence and sensitivity of sensitive attributes. Weights for SAs cannot be calculated in every case, and weight calculation increases execution time. Khan et al. [33] in (p, k) angelization identify the fingerprint correlation attack and suggest an improved (c, k)-anonymization technique. The innovative KCi-slice [34] is a KC-slice model enhancement with better privacy and utility requirements. The author of [35] proposed multiple security levels for different SAs values. The proposed method claims more utility, but requires more time to execute.

Until now, we have only discussed MSAs with single record data sets. In the literature, there is also some work done in multiple records together with MSA data sets. Ref. [36] proposes the first privacy model for 1:M and MSAs, which evaluates the work of [8] for 1:M and MSAs-based privacy disclosures. Although the proposed approach provides good protection against adversarial attacks, it appears that efficiency can be improved. Recent work on adversarial attack identification in a balanced p sensitive k-anonymity based privacy model for 1:M and MSAs have been proposed. They presented 1:M MSA-(p, l)-diversity in [37] as an efficient, resilient, and utility aware privacy technique. Table 5 highlights some of the work proposed for MSAs.

To aggregate attributes based on QIs or MSAs, previously proposed models used techniques such as generalization, bucketization, and slicing. Information is lost while using the generalization approach provided in k-anonymity [1,2] since the records in one group are quite close to each other. Furthermore, because each attribute is generalized independently, there is no link between them. As a result, when analyzing the data, it is possible to find every potential combination of attributes. Despite the fact that bucketization has better utility than generalization [18,19,20,21], membership disclosure attacks are likely to occur because most bucketized algorithms use the same QIs values as the original table. Slicing of the data set has mostly focused on horizontal and vertical slicing. Slicing is mostly used for sensitive attributes, while QIs are either ignored or generalized via k-anonymity.

The basic terminologies and definitions used in this approach, as well as previously proposed approaches, will be highlighted in the following section.

3. Preliminaries

The techniques discussed earlier are based on single-dimensional generalization, and each technique provides a separate method for preserving QI and SA privacy. Single dimensional generalization is used to preserve QIs, while bucketization, slicing, and other techniques are used to preserve SAs. To maintain privacy, the approach used in this paper is based on fuzzy logic to provide multi-dimensional partitioning for both QIs and SAs. The basic terminologies and definitions used in this article and related articles are discussed in this section to help understand the presented methodology.

3.1. Notation

The data set is in the form of a table T with m data attributes and n tuples. The m data attributes are quasi-identifiers QI =

{q i_{1}, \dots, q i_{n}}

and sensitive attributes SA =

{s a_{1}, \dots, s a_{n}}

. Adversary commonly uses sensitive attributes to reveal private information about individuals, and QI attributes can be linked to any other external data set to identify individuals. Table 6 lists the other notations used in this paper.

(Demographic knowledge attack) [8] If any individual i is uniquely recognized in any group G with n tuples through QIs, it means that the attacker uses demographic knowledge (dk). The adversary’s ability to find an individual [41] is facilitated by the individual’s QI attributes. If the attacker can trace an individual’s personal information via QIs, he is capable of launching a dk attack.

3.2. (p, k) Angelization Revisited

((p, k)-Angelization) [8] For a Table T, a batch partitioning =

{B_{1}, B_{2} \dots B_{g}}

and a bucket partitioning =

{C_{1}, C_{2}, \dots C_{f}}

is given, a (p, k)-Angelization of Table T yields two different tables, sensitive batch table (SBT), and generalized table (GT).

3.3. Fuzzification

The process of fuzzification is the transformation of a precise number into a fuzzier one. In this step, inputs are changed into linguistic variables that can be used with fuzzy sets. Below are definitions of linguistic variables, membership functions (mfs), and fuzzy sets.

Linguistic variable: Let Table T be the universe under consideration with m data attributes and n tuples. Table T has crisp data. The first step in mapping crisp data into fuzzy data is to define linguistic variables (lv). The lv is a data attribute with some values that can include QIs and SAs. In Table 1, QI age is a linguistic variable and it has some linguistic value, i.e., 27 years.

Membership function (mfs): The degree of membership is determined by the values of linguistic variables. The value assigned to attributes is called its degree. Mfs are determined based on degree of membership. Depending on the values of the linguistic variable, Mfs can be two, three, or four. For example, we can define two mfs for the linguistic variable age in Table 1 as

μ_{1}

= (25–33 years) and

μ_{2}

= (34–48 years).

Fuzzy sets: Mfs are used to generate fuzzy sets. The fuzzy sets include everything between completely false (0.0) and completely true (1.0). For example, the two mfs for age A =

μ_{1}

,

μ_{2}

form one fuzzy set. Assume that Table T is the universe under consideration and t is a specific element of T, then A is a fuzzy set defined on T and can be expressed as;

\begin{matrix} A = {(t, μ_{A} (t)), t \in T} \\ μ_{A} (t) = T \to [0, 1] \end{matrix}

(1)

μ_{A}

is called the membership function.

Logical operations on fuzzy sets: The fuzzy set theory comprises the operations union, intersection, complement, and inclusion, just like classical set theory. In fuzzy logic, the various logical operations for compound statements in Equation (1) are considered as implications [12,32]. The implication used in the proposed approach is UNION or AND, which is defined as follows in terms of characteristic functions. (UNION) Union of two fuzzy sets A and B using (1) will be:

μ_{(A \cup B)} (t) = A N D [μ_{A} (t), μ_{B} (t)]

(2)

Fuzzy Inference: The fuzzy relation

R = A \to B

is used to represent a fuzzy rule. R can be considered as a two-dimensional membership function for a fuzzy set (1). By applying implication as a union using Equation (2) and employing IF-THEN rules, a fuzzy inference engine is formed. Possible rules are calculated based on linguistic variables and membership functions. Total rules can be calculated as

{(μ)}^{l v s}

.

Defuzzification: Following the evaluation of the rules, the input fuzzy sets are defuzzified, resulting in a set of crisp output values. The center of gravity (CoG) defuzzification method is used to defuzzify the fuzzy system [42]. In CoG, values are taken from the inference engine and aggregated.

3.4. HLPN

HLPN is used to verify the correctness of an algorithm. The HLPN [43] is a 7-tuple with N = (P, T, F,

φ

, Rn, L,

M_{0}

). F, P, and T belong to a dynamic structure, whereas L,

φ

, and Rn reflect static semantics in the group of 7-tuples. The P represents a finite set of places, each of which represents a single part of the system. T denotes the set of finite transitions, where transitions represent the system’s variations. Rn explains the transition rules, L signifies a label on F, and

M_{0}

denotes the initial marking in the 7-tuple definition of HLPN.

4. Proposed Approach: F-Classify

Section 2 investigates previously proposed techniques for single sensitive attributes and multiple sensitive attributes. According to the findings, privacy breaches occur when single sensitive attribute-based approaches are applied to MSAs. Section 2 discusses and compares MSA-based techniques based on privacy violations and utility requirements. There appears to be a trade-off between privacy and utility in the majority of MSA-based approaches. To reduce such trade-offs, this article introduces F-Classify, an AI-based classification methodology for QIs and MSAs. F-Classify will publish several tables. One anonymized QIs table and numerous MSAs tables will be published. The number of MSAs tables is determined by the number of sensitive attributes in micro-data. In the following sections, we will go through how F-Classify works.

4.1. Linguistic Variables and Fuzzy Sets

The first step is to convert crisp input (m data attributes) to linguistic variables. The values for lvs (QIs and SAs) are specified first, and then the mfs are generated. For both numerical and categorical attributes, the criteria for defining mfs are different.

For numerical attributes sort the data in any order, then divide it into two/three/four (depending on mfs) equal lists.
For categorical attributes, select unique attribute values from the list. Then, for each distinct attribute, assign a random number between 0 and 1. After assigning a random number, divide the unique list into two/three/four equal lists using the same technique.

Let lv(q) denote the linguistic variable for QIs, and lv(sa) denote the linguistic variable for sensitive attributes. First, define mfs, then fuzzy sets for lv(q) and lv(sa). Equations (3) and (4) show fuzzy sets for linguistic variable QIs and MSAs, respectively.

\begin{matrix} Q I_{A} (l v (q_{A})) = {l v (q_{A 1}), l v (q_{A 2}), \dots, l v (q_{A i})} \\ Q I_{B} (l v (q_{B})) = {l v (q_{B 1}), l v (q_{B 2}), \dots, l v (q_{B i})} \end{matrix}

(3)

\begin{matrix} S A_{a} (l v (s a_{a})) = {l v (s a_{a 1}), l v (s a_{a 2}), \dots, l v (s a_{a i}))} \\ S A_{b} (l v (s a_{b})) = {l v (s a_{b 1}), l v (s a_{b 2}), \dots, l v (s a_{b i}))} \\ S A_{c} (l v (s a_{c})) = {l v (s a_{c 1}), l v (s a_{c 2}), \dots, l v (s a_{c i}))} \end{matrix}

(4)

Output variables: Based on QAs and SAs, the output will be a crisp value. Output classification is in (5) for two attribute QAs and three MSAs.

\begin{matrix} Q I_{A} - Q I_{B} (q - C) = {q - C_{1}, q - C_{2}, \dots, q - C_{α}} \\ S A_{a} - S A_{b} - S A_{c} (s a - C) = {s a - C_{1}, s a - C_{2}, \dots, s a - C_{α}} \end{matrix}

(5)

4.2. Fuzzy Inference Rule-Based

Section 4.1 defined linguistic variables and membership functions; the next step is to define rules based on fuzzy sets and implications. The number of rules will be determined by the number of lvs and the number of mfs. For any, i and j and QIs A and B rules will be calculated in (6).

\begin{matrix} i f Q I_{A} i s l v (q_{A i}) a n d Q I_{B} i s l v (q_{B j}) \\ a c t i o n = q - C_{(i + j - 1)} \end{matrix}

(6)

For any, i, j, and k and SAs a, b, and c rules will be calculated in (7).

\begin{matrix} i f S A_{a} i s l v (s a_{a i}) a n d S A_{b} i s l v (s a_{b j}) a n d S A_{c} i s l v (s a_{c k}) \\ a c t i o n = s a - C_{(i + j + k - 2)} \end{matrix}

(7)

4.3. Defuzzification

Defuzzification is performed on the output of evaluated rules. As a result of defuzzification, we only get one tuple at a time. The result of defuzzification of SAs in the provided example is shown in Figure 2. In Figure 2, the selected attribute physician is p1, the disease is d1, and the treatment is t1, therefore the defuzzification result is class C1.

4.4. Permutation

Rules are used to classify QIs and MSAs. We assign these classes to tuples in the data set, and we now have multiple tables based on the classes we defined. Values from the SAs table are permuted into the QIs table to generate the anonymized table. The formal modeling and analysis of the F-Classify algorithm will be explained in the next section.

5. Formal Modeling and Analysis

The design and working of the F-Classify algorithm are described in depth in Section 4. Here, F-Classify algorithm formal modeling and analysis is performed using HLPN [43].

5.1. F-Classify Algorithm

The F-Classify algorithm is explained in depth in the following sections. Two parts make up the algorithm. Fuzzification is the first step, while permutation is the second.

The F-classify Algorithm 1 starts with splitting the table into QIs and SAs attributes subsets. Furthermore, it generates tables (QT) and (STm) with new attribute classes and attributes of sub-set tables for every data sub-set. Data attributes are initialized and called linguistic variables (lv). Line 1–3 in Algorithm 1 defines mfs for every lv, mfs can be 2, 3, or 4 for every attribute. Line 4: loop from 1 to the number of subsets (k). Line 5: loop from 1 to no of rules (

η

). Line 6: making rules for data-set from 1 to total rules. Line 7: Assign output class to each rule. Line 10: loop from 1 to the number of tuples (n). Line 11: loop from 1 to the number of rules (

η

). Line 12: condition to check, tuple from Table T belongs to which output class. Line 13: generate tables (QT) and (STm) with new attribute class and attributes of sub-set table for every data sub-set.

Algorithm 1 F-Classify algorithm: Fuzzification.

Require:: Table T with m data attributes and n tuples
Ensure:: Release Table QT and ${S T_{1}, \dots, S T_{m}}$
Initialisation Split the table T into multiple sub-sets (One sub-set for QI and remaining sub-sets for SAs) from the data sets. multiple sub-sets = d1, d2, d3…dk data attributes (linguistic variables) = $l v_{1}, l v_{2}, \dots, l v_{m}$ Membership functions = $μ$ γ = number of attributes in one subset η = number of member-ship functions for lv α: Number of fuzzy rules ( $α = η^{γ}$ ) Rules R [] = ${R_{1}, \dots, R_{α}}$ Classes [] = ${C_{1}, \dots, C_{α}}$

1:: for $i = 1$ to m do
2:: define mfs for lvs
3:: end for
4:: for $i = 1$ to k do
5:: for $j = 1$ to $η$ do
6:: $R [i] \leftarrow A N D (l v [1] [j], l v [2] [j], \dots l v [γ] [j])$
7:: $C [i] \leftarrow R [i]$
8:: end for
9:: end for
10:: for $i = 1$ to n do
11:: for $j = 1$ to $α$ do
12:: if ( $T (T u p l e) \in (C [α])$ ) then
13:: Generate a new table according to Classes for QIs (QT) and SA $(S T_{1}, S T_{2}, \dots S T_{m})$
14:: end if
15:: end for
16:: end for
17:: return Tables QT and $S T_{1}, S T_{2}, \dots, S T_{m}$

After tables are generated using the fuzzification procedure, the tables are passed to a permutation procedure to permute and get a higher level of privacy. Algorithm 2 takes tables from the fuzzification module and generates anonymize tables. Line 1-2: loop from 1 to the number of tuples (n), loop from 1 to the number of sub-sets (k). Line 3: condition to check QT(tuple) belongs to which class of every SAs subset table (ST). Line 4: append attribute class in QT for every subset of ST. Line 9: publish QT and SAs subsets tables

S T_{1}, S T_{2}, \dots, S T_{m}

.

In the following part, we will go through formal modeling and analysis.

Algorithm 2 F-Classify algorithm: Permutation.

Require:: QT and $S T_{1}, S T_{2}, \dots S T_{m}$ from procedure Fuzzification
Ensure:: Anonymize Table QT and Anonymize $M S T_{1}, M S T_{2} \dots M S T_{m}$

for

i = 1

to n do

2:: for $j = 1$ to m do
if ( $Q T (T u p l e) \in (S T_{m}$ ) then
4:: Append attribute Class ( $S T_{m}$ ) in QT for every ST
end if
6:: end for
end for
8:: for $i = 1$ to T do
Release Anonymize Table QT and $M S T_{1}, M S T_{2} \dots M S T_{m}$
10:: end for
return Anonymize Table QT and Anonymize $M S T_{1}, M S T_{2} \dots M S T_{m}$

5.2. Formal Modeling and Analysis

We formally validate the working of the F-Classify algorithm along with its properties. To achieve the formal analysis, HLPN and Z3 languages are used. The HLPN model has been transformed into SMT-Lib [44] together with the correctness properties to illustrate the correctness of the F-Classify algorithm. Properties are then executed via the Z3 solver to verify their correctness. In HLPN, the algorithm was first presented in terms of its mathematical properties. These attributes are first translated into SMT-Lib to see if they are valid, and then they are executed through the Z3 solver. In [44], the formal definitions of SMT and Z3 solver are presented. The notations used in this section are represented in Table 6. Figure 3 depicts the HLPN for the F-Classify algorithm. Table 7 defines the variable types that were used and their explanations. The places and descriptions included in the HLPN F-Classify algorithm are shown in Table 8. The transitions have been labeled as Input in Figure 3. The first Input transition is a raw data table with m attributes and n records of patient electronic health records (EHRs) stored in the place DT. In the input transition, a raw data table with m attributes and n records is given, which is subsequently separated into different QI and SAs subsets using the Dsplit function. In Equation (8), the entire data split procedure is shown. All m attributes are then translated into linguistic variables lv

_{m}

in (9).

\begin{matrix} R (Data Split) = \forall i 2 \in x 2, i 3 \in x 3 | \\ (i 3 [1], i 3 {[2]}_{i_{\forall i 3 [2] \in i}}) : = D S p l i t (i 2 {[2]}_{m_{\forall i 2 [2] \in m}}) \land \\ x 3^{^{'}} : = x 3 \cup {i 3 [1], i 3 [2]} \end{matrix}

(8)

\begin{matrix} R (Attrb Conversion) = \forall i 4 \in x 4, i 5 \in x 5 | \\ (i 5 {[1]}_{m_{\forall i 5 [1] \in m}}) : = C o n v e r s i o n (i 4 {[1]}_{m_{\forall i 4 [1] \in m}}) \land \\ x 5^{^{'}} : = x 5 \cup {(i 5)} \end{matrix}

(9)

All membership functions

η

are defined for linguistic variables m. Now rules are formed based on the combined values of linguistic variables and membership functions as

η^{m}

and saved in Rules, then output classes are assigned to each specific rule in (10) and (12).

\begin{matrix} R (Fuzzification) = \forall i 6 \in x 6, i 7 \in x 7, i 10 \in x 10, \\ i 11 \in x 11, i 13 \in x 13 | \\ (i 7 {[1]}_{m_{\forall i 7 [1] \in m}}) : = M f u n c t i o n {(i 6 [1])}_{m_{\forall i 6 [1] \in m}} \land \\ x 7^{^{'}} : = x 7 \cup {(i 7)} \land \\ (i 10 {[1]}_{n_{\forall i 10 [1] \in n}}) : = R u l e ((i 6 [1] [η] \land \\ {i 6 [γ] [η])}_{n_{\forall i 6 [γ] [η] \in n}}) \land \\ x 10^{^{'}} : = x 10 \cup {(i 10)} \\ {(i 13 [1])}_{n_{\forall i 13 [1] \in n}} : = {(i 11 [1])}_{n_{\forall i 11 [1] \in n}} \land \\ x 13^{^{'}} : = x 13 \cup {(i 13)} \end{matrix}

(10)

After that, each record in the data table is compared to check its class as depicted in (11), then we construct class-based quasi identifier table QcT (Table 3a) and multiple sensitive attribute tables ScT (Table 3b,c).

Now, from the class-based quasi identifier table QcT, it is checked whether the corresponding class is present in the sensitive attribute table ScT. Quasi identifier table QcT is appended to each class of multiple sensitive attribute tables ScT and saved in Anonymize T. After that, each record in the data table is checked as it is present in which class in (11), then we construct a class-based quasi identifier table QcT (Table 3a) and multiple sensitive attribute tables ScT (Table 3b,c).

It is then checked whether the matching class is present in which sensitive attribute table ScT, using the class-based quasi identifier table QcT. Each class of multiple sensitive attribute tables ScT has a quasi-identifier table QcT appended to it and saved in Anonymize T. Table 4a shows the anonymized form of the table. We publish anonymized QT (Table 4a) and MST (Table 4b,c) tables with multiple sensitive attributes. The above procedure is represented by the last transition Release Table, depicted in (13).

\begin{matrix} R (Class Table) = \forall i 14 \in x 14, i 15 \in x 15, i 16 \in x 16, \\ i 17 \in x 17, i 18 \in x 18 | \\ ((i 14 [1] \in (i 16 [1]) = T R U E)) \to \\ (i 17 [1], i 17 [2], i 17 [3]) : = M a k e c l a s s t a b l e (i 14 [1] \\ ‖ i 15 [1] ‖ i 16 [1]) \land \\ x 17^{^{'}} : = x 17 \cup {(i 17 [1], i 17 [2], i 17 [3])} \lor \\ ((i 14 [1] \in (i 16 [2]) = T R U E)) \to \\ (i 18 [1], i 18 [2], i 8 [3]) : = M a k e c l a s s t a b l e (i 14 [2] ‖ i 15 [2] \\ {‖ i 16 [2])}_{p_{\forall i 16 [2] \in p}} \land \\ x 18^{^{'}} : = x 18 \cup {(i 18 [1], i 18 [2], i 18 [3])} \end{matrix}

(11)

The working and properties of the F-Classify privacy-preserving model have been formally verified in this section. Multiple sensitive attributes are protected from membership, attribute, and identity disclosure while using a fuzzy logic-based classification methodology. In the following section, we will look at the performance of the proposed privacy model.

\begin{matrix} R (Permute) = \forall i 19 \in x 19, i 20 \in x 20 | \\ ((i 19 [2] \in {(i 20 [2])}_{i_{\forall i 20 [2] \in i}}) = T R U E) \to \\ (i 21 [1], i 21 [2], i 21 [3], i 21 [4]) \\ : = (i 19 [1], i 19 [2], i 19 [3]) ‖ (i 20 [3]) \land \\ x 21^{^{'}} : = x 21 \cup {i 21 [1], i 21 [2], i 21 [3], i 21 [4]} \end{matrix}

(12)

\begin{matrix} R (Release Table) = \forall i 22 \in x 22, i 23 \in x 23, \\ i 24 \in x 24, i 25 \in x 25 | \\ (i 24 [1], i 24 [2], i 24 [3]) : = (i 22 [1], i 22 [2], i 22 [3]) \land \\ i 25 [1] : = i 23 [2] \land i 25 [2] : = i 22 [4] \\ \land x 24^{^{'}} : = x 24 \cup {i 24 [1], i 24 [2], i 24 [3]} \\ \land x 25^{^{'}} : = x 25 \cup {i 25 [1], i 25 [2]} \end{matrix}

(13)

6. Results and Discussion

This section compares and discusses the experimental results of the proposed methodology to those of previously suggested techniques.

6.1. Experimental Setup

Our model is implemented on an Intel Core i7-3520M computer with a 500 GB hard drive and 8 GB RAM, running Windows 7. Python is the programming language used in the implementation. The two data sets for experiments have been taken from the UCI repository http://archive.ics.uci.edu/ml/datasets/Heart+Disease (accessed on 10 June 2020) and https://archive.ics.uci.edu/ml/datasets/Adults (accessed on 10 August 2020). The data used are from the Hungarian Institute of Cardiology and Cleveland Clinic Foundation of Heart Disease and Adults. In the heart disease data set, there are almost 76 attributes, but we have used 14 attributes for experimental purposes. Furthermore, out of 14, 12 are SAs and 2 of them are QIs. The QIs in the data set are age and gender, and we have added another QI zipcode for experimental purposes. The 12 SAs used are cp (chest pain type), trestbps (resting blood pressure), chol (serum cholerstrol), fbs (fasting blood sugar), restecg (resting electrocardiographic results), thalach (maximum heart rate achieved), exang (exercise-induced angina), oldpeak (ST depression induced by exercise relative to rest), slope (the slope of the peak exercise ST segment), ca (number of major vessels), thal (type of defect) and num (diagnosis of heart disease). The value of cp is either 1, 2, 3, or 4 based on different pain conditions. The value of num is either 0 or 1, and the value of the slope is either 1 (upsloping), 2 (flat), or 3 (downsloping). We have used 284 records after removing missing values records. In the second adult data set a total of 40,000 tuples are taken for experimental purposes. The 12 attributes are selected for analysis, and out of 12, 9 are sensitive attributes and 3 are QIs (age, gender, and zip code). The comparative analysis based on different parameters has been done between the proposed model and (p, k) angelization.

6.2. Measurement of Privacy

We ca not quantify the privacy level or information leakage of any method scientifically, but we can calculate the probability of information leakage. In F-Classify, we have used fuzzy logic for classification or grouping of tuples so information leakage depends on membership functions defined for QIs and SA and class/group size. In F-Classify we have dynamic class/group size, so to measure privacy leakage we will sum the number of records in each group and then find the probability, P =

\frac{1}{α} \times 100

, where

α

is the sum of records based on QIs and sensitive attributes in each class/group.

\begin{matrix} α = \sum_{i} (k_{i} + s_{i}) \end{matrix}

(14)

In (14), k is the number of records in each class/group based on QI and is denoted by

(k_{1}, \dots, k_{i})

, is the number of sensitive attributes in each class/group and i is the number of membership functions defined for QIs. We have multiple groups against one mf, therefore summation is used to add records from every group. For approach (p, k) angelization SA are not categorized, therefore the probability is based only on group size, as

P = \frac{1}{k} \times 100

, where k is a group size that is static and predefined. So this probability only depends on the number of records in one group. The likelihood of finding a record in the case of (p, k) angelization is substantially higher than in the case of F-Classify, as shown in Figure 4a. We have classification based on QI and SAs in F-Classify, therefore the chance of identifying a record in a data set is determined by the sum of records in each mf and the number of SA against each record. In (p, k) angelization, however, only the records in one group are considered. Furthermore, when the number of records in a data set increases, the group size gets bigger in F-Classify, and the likelihood of finding a record decreases, but this is not the case with (p, k) angelization, which has a fixed group size. The number of records in (p, k) angelization does not affect group size.

6.3. Discernibility Penalty

The Discernibility penalty (DCP) is a measure of indistinguishable records. Each record gets a penalty for being indistinguishable from other records, which is used to calculate DCP. The lower the DCP value, the more indistinguishable the records are from one another. If we have C indistinguishable classes, we can use (15) to determine the DCP.

\begin{matrix} D C P = \sum_{C} {| C |}^{2} \end{matrix}

(15)

We used fuzzy logic with multi-dimensional partitioning in our methodology, which fuzzifies and distinguishes records. We can observe in Figure 4b that DCP grows with increasing group size in the case of (p, k) angelization, but DCP remains the same in the case of F-Classify. We have different group sizes in one table in F-Classify, as seen in Table 3a. We have one tuple in one class/group and five tuples in the other class/group, giving us 1, 5, 6, and 1 group sizes in one table while maintaining DCP. As a result, DCP has a smaller value in F-Classify than (p, k) angelization, where DCP increases with the increase of group size.

6.4. Normalized Certainty Penalty (NCP)

To check the utility of proposed techniques, the idea of certainty penalty (CP) is proposed by Xu et al. [5]. CP is a utility-based metric, it is helpful to get information loss, and it also illustrates the significance of every attribute. Normalized certainty penalty (NCP) is calculated using (16).

N C P = \sum_{i} \sum_{j} (\frac{z_{i j} - y_{i j}}{A_{j}})

(16)

where y and z are the range of tuples defined after classification of table T, and A is the attribute for which NCP is calculated. In Figure 5a, NCP is calculated for F-Classify and (p, k) angelization. NCP is calculated based on generalization steps in the case of (p, k) angelization and in F-Classify it is based on classification of attributes. Information loss is proportional to generalization; the more the generalization, the greater the information loss. The information loss in (p, k) angelization is more than in F-Classify, as seen in Figure 5a. When there are few sensitive attributes, information loss is greater in F-Classify, but it gradually decreases in comparison to (p, k) angelization as the number of sensitive attributes increases. NCP is quite low in F-Classify in the adults data set, as seen in Figure 5b. In terms of information loss, the suggested algorithm’s low NCP shows that it performs well with larger data sets.

6.5. Query Error

Query Error is another way to assess the suggested F-Classify utility. Comparing anonymized datasets aggregated query results [45,46] is one way to determine the efficiency of privacy models. Query error is computed using Equation (17).

Q u e r y - E r r o r = E s t i m a t e d - c o u n t - A c t u a l - c o u n t / A c t u a l - c o u n t

(17)

The actual query count is the result of the query executed on the original data-set T, whereas the estimated query count is the count obtained by anonymizing the data-set (T*). The query accuracy results are compared to the number of groups and query dimensionality.

For the Heart Disease and Adults data sets, relative query error is plotted against the number of groups in Figure 6a,b. As the group size in F-Classify is not fixed like it is in (p, k) angelization, the relative query error for different group sizes is almost the same in the proposed approach. Furthermore, in the suggested methodology, fuzzy classification is applied for both QIs and SAs, resulting in a relatively low relative query error as compared to (p, k) angelization. Although enhanced generalization is employed for QIs in (p, k) angelization, query error is still greater than in F-Classify.

6.6. Execution Time Analysis

Variable numbers of records and sensitive attributes are used to compare execution time. The execution time increases as the number of records increases. While the execution time for F-Classify increases slightly as the number of records increases, the execution time for (p, k) angelization increases rapidly as the number of records grows, as illustrated in Figure 7a. When contrast to F-classify, which classifies SAs using an AI algorithm, (p, k) angelization takes longer to execute since it employs a weight calculation technique for each SA. F-Classify has a slight variation in execution time with the increasing number of SAs shown in Figure 7b. The execution time of an adult data set with 40,000 records is presented in Figure 7c, and the pattern is the same: as the number of SAs increases, so does the execution time. In both small and large data sets, (p, k) angelization takes longer to execute than F-Classify.

7. Conclusions

This article introduces F-Classify, an AI-based technique for preserving the privacy of multiple sensitive attributes while publishing micro-data. The classification of SAs and QIs in F-Classify is done using rule-based fuzzy classification. Classifying QIs and SAs using fuzzy classification provides for multi-dimensional partitioning with minimal information loss. Attribute disclosure is prevented by classifying SAs into distinct classes so that instead of a fixed number of tuples in each group, each class has a varying number of tuples. Permuting the tables after multi-dimensional partitioning results in a higher level of privacy. Experiments on real-time data sets were conducted, and the results were compared in terms of Query Error, NCP, DCP, and execution. When comparing DCP to (p, k) angelization, it was observed that F-Classify had the lowest DCP value, indicating that records are indistinguishable. Query accuracy is used to assess utility, and it reveals that F-Classify has a lower query error than (p, k) angelization. In comparison to (p, k) angelization, an algorithm’s execution time is quite minimal. We plan to extend this work in the future to include dynamic data publication. Multiple releases with insertion, deletion, and updating of records are a challenge in dynamic data publication.

Author Contributions

Conceptualization, H.A., T.K., A.A. (Adeel Anjum) and S.U.R.M.; methodology, H.A., T.K., A.A. (Adeel Anjum) and S.U.R.M.; software, H.A., T.K., A.A. (Adeel Anjum) and S.U.R.M.; validation, H.A., T.K., A.A. (Adeel Anjum) and S.U.R.M.; formal analysis, T.K. and S.U.R.M.; investigation, H.A., T.K., A.A. (Adeel Anjum), S.U.R.M., A.A. (Alia Asheralieva), H.M., A.Z., K.A. and M.A.I.; resources, H.A., T.K., A.A. (Adeel Anjum), S.U.R.M., A.A. (Alia Asheralieva), H.M., A.Z., K.A. and M.A.I.; data curation, H.A., T.K., A.A. (Adeel Anjum), S.U.R.M., A.A. (Alia Asheralieva), H.M., A.Z., K.A. and M.A.I.; writing—original draft preparation, H.A., T.K., A.A. (Adeel Anjum) and S.U.R.M.; writing—review and editing, H.A., T.K., A.A. (Adeel Anjum), S.U.R.M., A.A. (Alia Asheralieva), H.M., A.Z., K.A. and M.A.I; visualization, H.A., T.K., A.A., S.U.R.M., A.A. (Alia Asheralieva), H.M., A.Z., K.A. and M.A.I; supervision, A.A. (Adeel Anjum), S.U.R.M., A.A. (Alia Asheralieva), H.M., A.Z., K.A., M.A.I.; project administration, A.A., S.U.R.M., A.A. (Alia Asheralieva), H.M., A.Z., K.A. and M.A.I.; funding acquisition, A.A. (Adeel Anjum), S.U.R.M., A.A. (Alia Asheralieva), H.M., A.Z., K.A. and M.A.I. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

Sweeney, L. k-anonymity: A model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 2002, 10, 5. [Google Scholar] [CrossRef] [Green Version]
Machanavajjhala, A.; Kifer, D.; Gehrke, J.; Venkitasubramaniam, M. L-diversity: Privacy beyond k-anonymity. ACM Trans. Knowl. Discov. Data TKDD 2007, 1, 1. [Google Scholar] [CrossRef]
Li, N.; Li, T.; Venkatasubramanian, S. t-closeness: Privacy beyond k-anonymity and l-diversity. In Proceedings of the 2007 IEEE 23rd International Conference on Data Engineering, Istanbul, Turkey, 15–20 April 2007; pp. 106–115. [Google Scholar]
LeFevre, K.; DeWitt, D.J.; Incognito, R.R. Efficient full-domain k-anonymity. In Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, Baltimore, MD, USA, 14–16 June 2005; pp. 49–60. [Google Scholar]
Xu, J.; Wang, W.; Pei, J.; Wang, X.; Shi, B.; Fu, A.W.C. Utility-based anonymization using local re-coding. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, USA, 20–23 August 2006; pp. 785–790. [Google Scholar]
Sweeney, L. Achieving k-anonymity privacy protection using generalization and suppression. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 2002, 10, 571–588. [Google Scholar] [CrossRef]
Susan, V.S.; Christopher, T. Anatomization with Slicing: A New Privacy Preservation Technique for Multiple Sensitive Attributes; 1–21: SpringerPlus 5.1; Springer: Berlin/Heidelberg, Germany, 2016. [Google Scholar]
Anjum, A.; Ahmad, N.; Malik, S.U.; Zubair, S.; Shahzad, B. An efficient approach for publishing microdata for multiple sensitive attributes. J. Supercomput. 2018, 74, 5127–5155. [Google Scholar] [CrossRef]
Han, J.; Luo, F.; Lu, J.; Peng, H. SLOMS: A Privacy-Preserving Data Publishing Method for Multiple Sensitive Attributes Microdata. J. Softw. 2013, 8, 3096–3104. [Google Scholar] [CrossRef] [Green Version]
Tao, Y.; Chen, H.; Xiao, X.; Zhou, S.; Zhang, D. Angel: Enhancing the utility of generalization for privacy preserving publication. IEEE Trans. Knowl. Data Eng. 2009, 21, 1073–1087. [Google Scholar]
Klir, G.; Yuan, B. Fuzzy Sets, and Fuzzy Logic; Prentice Hall: Hoboken, NJ, USA, 1995; Volume 4. [Google Scholar]
Kumari, V.V.; Rao, S.S.; Raju, K.V.S.V.N.; Ramana, K.V.; Avadhani, B.V.S. Fuzzy based approach for privacy preserving publication of data. Int. J. Comput. Sci. Netw. Secur. 2008, 8, 115–121. [Google Scholar]
Kumar, P.; Varma, K.I.; Sureka, A. Fuzzy based clustering algorithm for privacy preserving data mining. Int. J. Bus. Inf. Syst. 2011, 7, 27. [Google Scholar] [CrossRef] [Green Version]
Mathworks; M.U.T.: Natick, MA, USA, 1992.
Iyengar, V.S. Transforming data to satisfy privacy constraints. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, AB, Canada, 23–26 July 2002; pp. 279–288. [Google Scholar]
Zhang, X.; Liu, C.; Nepal, S.; Chen, J. An efficient quasi-identifier index based approach for privacy preservation over incremental data sets on cloud. J. Comput. Syst. Sci. 2013, 79, 542–555. [Google Scholar] [CrossRef]
LeFevre, K.; DeWitt, D.J.; Ramakrishnan, R. Mondrian multidimensional k-anonymity. In Proceedings of the Data Engineering. Proceedings of the 22nd International Conference on Data Engineering (ICDE’06), Atlanta, GA, USA, 3–7 April 2006. [Google Scholar]
Zhang, Q.; Koudas, N.; Srivastava, D.; Yu, T. Aggregate query answering on anonymized tables. In Proceedings of the IEEE 23rd International Conference In Data Engineering, Istanbul, Turkey, 15–20 April 2007; pp. 116–125. [Google Scholar]
Hore, B.; Mehrotra, S.; Tsudik, G.A. privacy-preserving index for range queries. In Proceedings of the Thirtieth International Conference on Very Large Databases, VLDB Endowment, Toronto, ON, Canada, 31 August–3 September 2004; Volume 30, pp. 720–731. [Google Scholar]
Rcw, W.; Li, J.; Awc, F.; Wang, K. (a, k)-anonymity: An enhanced k-anonymity model for privacy-preserving data publishing. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, USA, 20–23 August 2006; pp. 754–759. [Google Scholar]
Martin, D.J.; Kifer, D.; Machanavajjhala, A.; Gehrke, J.; Halpern, J.Y. Worst-case background knowledge for privacy-preserving data publishing. In Proceedings of the Data Engineering IEEE 23rd International Conference on Data Engineering, Istanbul, Turkey, 15–20 April 2007; pp. 126–135. [Google Scholar]
Li, T.; Li, N.; Zhang, J.; Molloy, I. Slicing: A new approach for privacy preserving data publishing. IEEE Trans. Knowl. Data Eng. 2012, 24, 561–574. [Google Scholar] [CrossRef] [Green Version]
Kiruthika, S.; Raseen, M.M. Enhanced slicing models for preserving privacy in data publication. In Proceedings of the 2013 International Conference on Current Trends in Engineering and Technology (ICCTET), Coimbatore, India, 3 July 2013; pp. 406–409. [Google Scholar]
Liu, Q.; Shen, H.; Sang, Y. Privacy-preserving data publishing for multiple numerical sensitive attributes. Tsinghua Sci. Technol. 2015, 20, 246–254. [Google Scholar]
Min, G.U.O.; Zhen, L.I.U.; Huai-Bin, W.A.N.G. Personalized Privacy Preserving Approaches for Multiple Sensitive Attributes in Data Publishing; DEStech Transactions on Engineering and Technology Research Same-Ist; DEStech Publications: Lancaster, PA, USA, 2016. [Google Scholar]
Yi, T.; Shi, M. Privacy protection method for multiple sensitive attributes based on strong rule. Math. Probl. Eng. 2015, 2015, 464731. [Google Scholar] [CrossRef] [Green Version]
Li, Z.; Ye, X. Privacy protection on multiple sensitive attributes. In Proceedings of the International Conference on Information and Communications Security, Zhengzhou, China, 12–15 December 2007; Springer: Berlin/Heidelberg, Germany, 2007; pp. 141–152. [Google Scholar]
Liu, J.; Luo, J.; Huang, J.Z. Rating: Privacy preservation for multiple attributes with different sensitivity requirements. In Proceedings of the Data Mining Workshops (ICDMW) 2011 IEEE 11th International Conference on Data Mining Workshops, Vancouver, BC, Canada, 11 December 2011. [Google Scholar]
Yang, E.A. Decomposition: Privacy preservation for multiple sensitive attributes. In International Conference on Database Systems for Advanced Applicationsg; Springer: Berlin/Heidelberg, Germany, 2009. [Google Scholar]
Das, D.; Bhattacharyya, D.K. Decomposition+: Improving l-Diversity for Multiple Sensitive Attributes. In International Conference on Computer Science and Information Technology; Springer: Berlin/Heidelberg, Germany, 2012. [Google Scholar]
Luo, F.; Han, J.; Lu, J.; Peng, H. ANGELMS: A privacy-preserving data publishing framework for microdata with multiple sensitive attributes. In Proceedings of the International Conference on Information Science and Technology (ICIST), Yangzhou, China, 23–25 March 2013. [Google Scholar]
Zhu, H.; Tian, S.; Xie, M.; Yang, M. Preserving privacy for sensitive values of individuals in data publishing based on a new additive noise technique. In Proceedings of the 23rd International Conference on Computer Communication and Networks (ICCCN), Shanghai, China, 4–7 August 2014. [Google Scholar]
Khan, R.; Tao, X.; Anjum, A.; Sajjad, H.; Khan, A.; Amiri, F. Privacy Preserving for Multiple Sensitive Attributes against Fingerprint Correlation Attack Satisfying c-Diversity. Wirel. Commun. Mob. Comput. 2020, 2020, 8416823. [Google Scholar] [CrossRef] [Green Version]
Raju, N.L.; Seetaramanath, M.; Rao, P.S. A novel dynamic KCi-slice publishing prototype for retaining privacy and utility of multiple sensitive attributes. Int. J. Inf. Technol. Comput. Sci. 2019, 11, 18–32. [Google Scholar] [CrossRef]
Xiao, Y.; Li, H. Privacy Preserving Data Publishing for Multiple Sensitive Attributes Based on Security Level. Information 2020, 11, 166. [Google Scholar] [CrossRef] [Green Version]
Kanwal, T.; Shaukat, S.A.A.; Anjum, A.; Choo, K.K.R.; Khan, A.; Ahmad, N.; Ahmad, M.; Khan, S.U. Privacy-preserving model and generalization correlation attacks for 1:M data with multiple sensitive attributes. Inf. Sci. 2019, 488, 238–256. [Google Scholar] [CrossRef]
Kanwal, T.; Anjum, A.; Malik, S.U.; Sajjad, H.; Khan, A.; Manzoor, U.; Asheralieva, A. A robust privacy preserving approach for electronic health records using multiple dataset with multiple sensitive attributes. Comput. Secur. 2021, 105, 102224. [Google Scholar] [CrossRef]
Dhumal, M.T.S.; Patil, M.Y.S. Implementation of slicing for multiple column multiple attributes: Privacy preserving data publishing. Int. J. Recent Innov. Trends Comput. Commun. 2015, 3, 4261–4266. [Google Scholar]
Xiao, X.; Tao, Y. Anatomy: Simple and effective privacy preservation. In Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB Endowment, Seoul, Korea, 12–15 September 2006; pp. 139–150. [Google Scholar]
Sowmyarani, C.N.; Srinivasan, G.N. A robust privacy preserving model for data publishing. In Proceedings of the International Conference on Computer Communication and Informatics (ICCCI), Coimbatore, India, 8–10 January 2015. [Google Scholar]
Majeed, A.; Ullah, F.; Lee, S. Vulnerability-and diversity-aware anonymization of personally identifiable information for improving user privacy and utility of publishing data. Sensors 2017, 17, 5. [Google Scholar] [CrossRef] [Green Version]
Fuzzy Set Theory and Its Applications; Springer: Berlin/Heidelberg, Germany, 1996.
Ali, M.; Malik, S.U.; Khan, S.U. DaSCE: Data security for cloud environment with semi-trusted third party. IEEE Trans. Cloud Comput. 2015, 5, 642–655. [Google Scholar] [CrossRef]
Lin, Y.; Malik, S.U.R.; Bilal, K.; Yang, Q.; Wang, Y.; Khan, S.U. Designing and modeling of covert channels in operating systems. IEEE Trans. Comput. 2016, 65, 1706–1719. [Google Scholar] [CrossRef]
Xiao, X.; Tao, Y. Dynamic anonymization: Accurate statistical analysis with privacy preservation. In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, Vancouver, BC, Canada, 9–12 June 2008; pp. 107–120. [Google Scholar]
Wong, R.C.W.; Liu, Y.; Yin, J.; Huang, Z.; Fu, A.W.C.; Pei, J. (α, k)-anonymity Based Privacy Preservation by Lossy Join. In Advances in Data and Web Management; Springer: Berlin/Heidelberg, Germany, 2007; pp. 733–744. [Google Scholar]

Figure 1. Matlab simulation of membership functions.

Figure 2. Matlab simulation of fuzzy logic, rules evaluation for Physician, Disease and Treatment.

Figure 3. HLPN for F-Classify algorithm.

Figure 4. Comparison of Heart Disease Data set (a) Probability of re-identifying a record (b) Discernibility Penalty.

Figure 5. Normalized Certainty Penalty (NCP) (a) NCP Heart Disease (b) NCP Adults.

Figure 6. Relative Query Error (RQE) (a) RQE for Heart Disease (b) RQE for Adults.

Figure 7. Execution time. (a) Execution time with increasing number of records (Heart Disease). (b) Execution time with varying number of sensitive attributes (Heart Disease). (c) Execution time with varying number of sensitive attributes (Adults).

Table 1. Original data table.

Name	Gender	Age	Zipcode	Disease	Treatment	Physician	Symptom	Diagnostic Method
John	M	27	14248	HIV	Antiretroviral therapy (ART)	John	Infection	Blood Test
Ana	F	28	14207	HIV	ART	John	Weight loss	ELISA Test
Richard	M	26	14206	Cancer	Radiation	Alice	Weight loss	MRI Scan
Dave	M	25	14249	Cancer	Chemotherapy	Bob	Abdominal Pain	Chest X-ray
Kate	F	41	13053	Hepatitis	Drugs	Sarah	Fever	Blood test
William	M	48	13074	Phthisis	Antibiotic	David	Fever	Molecular diagnostic methods
Robert	M	45	13064	Asthma	Medication	Suzan	Shortness of breath	Methacholine challenge tests
Olivia	F	42	13062	Obesity	Nutrition control	Steven	Eating disorders	Body mass index (BMI)
Emily	F	33	14248	Flu	Medication	Suzan	Fever	RITD tests
Alec	M	37	14204	Flu	Medication	Eve	Fever	RITD tests
Oliver	M	36	14205	Flu	Medication	Anas	Fever	RITD tests
James	M	35	14248	Indigestion	Medication	Jem	Heartburn	Chest X-ray
Jessica	F	28	14249	Cancer	Chemotherapy	Bob	Abdominal pain	Chest X-ray

Table 2. Anonymized table (T*).

P_ID	Age	Zipcode	Group Id	Disease	Treatment	Physician	Symptom	Diagnostic Method
P1	25–28	14206-14249	1	HIV	Antiretroviral therapy (ART)	John	Infection	Blood Test
P2	28–41	13053-14248	2	HIV	ART	John	Weight loss	ELISA Test
P3	25–28	14206-14249	1	Cancer	Radiation	Alice	Weight loss	MRI Scan
P4	25–28	14206-14249	1	Cancer	Chemotherapy	Bob	Abdominal Pain	Chest X-ray
P5	28–41	13053-14248	2	Hepatitis	Drugs	Sarah	Fever	Blood test
P6	33–48	13062-14248	3	Phthisis	Antibiotic	David	Fever	Molecular diagnostic methods
P7	33–48	13062-14248	3	Asthma	Medication	Suzan	Shortness of breath	Methacholine challenge tests
P8	33–48	13062-14248	3	Obesity	Nutrition control	Steven	Eating disorders	Body mass index (BMI)
P9	33–48	13062-14248	3	Flu	Medication	Suzan	Fever	RITD tests
P10	28–41	13053-14248	2	Flu	Medication	Eve	Fever	RITD tests
P12	28–41	13053-14248	2	Indigestion	Medication	Jem	Heartburn	Chest X-ray
P13	25–28	14206-14249	1	Cancer	Chemotherapy	Bob	Abdominal pain	Chest X-ray

Table 3. Fuzzy classification of QIs and MSAs.

(a) Classification of QIs (Age-Zipcode)
P-ID	Age	Zip	Class
P10	[25–33]	[13053-14205]	q-C1
P5
P6
P7	[35–48]	[13053-14205]	q-C2
P8
P11
P1
P2
P3	[25–33]	[14206-14249]	q-C3
P4
P9
P13
P12	[35–48]	[14206-14249]	q-C4
(b) Classification of Sensitive Attributes (Symptom-Diagnostic Method)
P-ID	Symptom	Diagnostic Method	Class
P1 P2 P5	Infection Weight loss Fever	Blood Test Elisa test Blood test	$α$ C1
P3 P4 P6 P9 P10 P11 P13	Weight loss Abdominal pain Fever Fever Fever Fever Abdominal Pain	MRI Scan Chest X-ray Molecular diagnostic Methods RITD tests RITD tests Chest X-ray	$α$ C2
P7 P8 P12	Shortness of breath Eating disorders Heartburn	Methacholine challenge tests Body mass index (BMI) Chest X-ray	$α$ C3
(c) Classification of Sensitive Attributes (Disease-Treatment-Physician)
P-ID	Disease	Treatment	Physician	Class
P1 P2 P3	HIV HIV Cancer	ART ART Radiation	John John Alice	C1
P4 P5 P13	Cancer Hepatitis Cancer	Chemotherapy Drugs Chemotherapy	Bob Sarah Bob	C2
P6 P7 P9	Phthisis Asthma Flu	Antibiotic Medication Medication	David Suzan Suzan	C3
P8 P10 P11 P12	Obesity Flu Flu Indigestion	Nutritional Control Medication Medication Medication	Steven Eve Anas Jem	C4

Table 4. Anonymized QT and MST.

(a) Anonymized Table (QT)
P-ID	Age	Zip	Age-Zip Class	Physician-Disease-Treatment	Symptom-Diagnostic Method
P10	[25–33]	[13053-14205]	q-C1	C4	$α$ C2
P5 P6 P7 P8 P11	[35–48]	[13053-14205]	q-C2	C2 C3 C4	$α$ C1 $α$ C2 $α$ C3
P1 P2 P3 P4 P9 P13	[25–33]	[14206-14249]	q-C3	C1 C2 C3	$α$ C1 $α$ C2
P12	[35–48]	[14206-14249]	q-C4	C4	$α$ C3
(b) Anonymized Table (Multiple Sensitive Attribute (MST (1)))
Disease	Treatment	Physician	Class
HIV HIV Cancer	ART ART Radiation	John John Alice	C1
Cancer Hepatitis Cancer	Chemotherapy, Drugs Chemotherapy	Bob Sarah Bob	C2
Phthisis Asthma Flu	Antibiotic Medication Medication	David Suzan Suzan	C3
Obesity Flu Flu Indigestion	Nutritional Control Medication Medication Medication	Steven Eve Anas Jem	C4
(c) Anonymized Table (Multiple Sensitive Attribute (MST (2)))
Symptom	Diagnostic Method	Class
Infection Weight loss Fever	Blood Test Elisa test Blood test	$α$ C1
Weight loss Abdominal pain Fever Fever Fever Fever Abdominal Pain	MRI Scan Chest X-ray Molecular diagnostic Methods RITD tests RITD tests Chest X-ray	$α$ C2
Shortness of breath Eating disorders Heartburn	Methacholine challenge tests Body mass index (BMI) Chest X-ray	$α$ C3

Table 5. Comparison of MSAs based approaches.

	Privacy Models	Evaluation	Attacks	Utility
[22]	Slicing	It was intended for high dimensional data, but it has failed and has given original tuples when multiple tuples have identical SAs and QIDs.	Skewness, sensitivity, and similarity attacks	Loss of information
[7]	Slicing and anatomization	The proposed approach has a very complex solution. It publishes multiple tables, and also has greater execution time.	Demographic knowledge attack	Loss of information
[38]	Multiple column multiple attributes slicing	The proposed approach is for the MSAs anonymization, and QIs are overlooked. In case of 1:M occurrence of record, it shows incorrect results.	Skewness attacks, similarity attacks, and sensitivity attacks	Loss of information
[9]	SLOMS	Proposed approach released several tables with information loss. The correlation among MSA was also removed in this approach.	Demographic knowledge attack	Loss of information
[24]	Multi-sensitive bucketization with clustering	The approach only worked with numerical data if the consequence suppression rate is low.	-	Information loss is less
[25]	MSA( $α$ ,l)	The approach used generalization with suppression and anatomy. It caused the utility to decrease.	-	High information loss
[27,39]	( $α$ ,l), Anatomy, generalization, and suppression	Decrease in utility due to suppression of SA values.	-	Loss of information
[28]	Rating	SAs are generalized.	Association privacy attack	Loss of information
[29]	Decomposition	The proposed approach preserves privacy by assuring diversity in MSAs, as a consequence it activated information loss.	Similarity and skewness privacy attacks	Loss of information is high
[30]	Decomposition plus	Noise is added in proposed method, resulting in loss of utility. Attribute and identity disclosure are also not prevented in this approach.	Similarity and skewness privacy attacks	Loss of information is high
[31]	ANGELMS	There is a zero correlation between MSAs and QIDs in this approach, results in high information loss.	Sensitivity, similarity, and skewness privacy attacks	Loss of information is high.
[32]	P+ sensitive t-closeness	It assigns sensitivity level to each SA in such a way that each group contains at least p-distinct sensitivity levels. It also generalizes the QIs.	-	Loss of information
[40]	P-cover k-anonymity	It generalizes QI values to ensure privacy, it also ensures the MSA P-diversity constraint between MSA. It avoids membership, identity and attribute disclosures.	Sensitivity, skewness, and similarity privacy attacks	Loss of information.
[8]	(p, k)-angelization	The proposed approach preserves the privacy of MSAs using weight calculations. Weight calculation takes additional execution time and hence resulted into higher execution time.	-	Loss of information.

Table 6. Summary of notations.

Symbol	Description
DT	Data Table
ST	Subset of quasi attributes and sensitive attributes in ST
QA	Quasi identifier
SA	Sensitive attribute
MSAs	Multiple sensitive attributes
Class	Classes of quasi attributes and sensitive attributes
q-C	Quasi identifier class
sa-C	Sensitive attribute class
m	Number of data attributes
n	Number of tuples
(lv)	Linguistic variables
$μ$	Membership function for linguistic variables
Rules	Fuzzy
$η$	Number of member ship functions for l $v_{m}$
$α$	Number of fuzzy rules
$γ$	Number of attributes in one subset
Qc T	Quasi attributes class based tables
Sc T	Sensitive attributes class based tables
Anonymize T	Anonymize table of quasi and sensitive attributes
QT	Quasi identifier table
MST	Multiple sensitive attribute tables

Table 7. Types used in HLPN for F-Classify algorithm.

Types	Description
Tp $_{m}$	m tuples in Data Table
Dq	Subset of quasi-identifier
Ds $_{i}$	Multiple Subsets of sensitive attribute values
Qc	Class for quasi-identifiers
Sci	Multiple classes for sensitive attributes
LV $_{m}$	Linguistic variables for m attributes
R $_{μ}$	mu number of fuzzy rules
PID	Patient identifier in Data Table
Q	Group of quasi identifiers
C $_{q}$	Quasi identifier classes
C $_{s}$	Sensitive attribute classes
SA $_{i}$	Multiple number of sensitive attribute Tables

Table 8. Mapping of data types on places.

Types	Description
$φ (D T)$	$P$ (PID × Tp $_{m}$ )
$φ (S T)$	$P$ (Dq × Ds $_{i}$ )
$φ (C l a s s)$	$P$ (Qc × Sc $_{i}$ )
$φ (L - V a r i a b l e)$	$P$ (L V $_{m}$ )
$φ (M F)$	$P$ (mf $_{i}$ )
$φ (R u l e s)$	$P$ (R $_{μ}$ )
$φ (Q c T)$	$P$ (PID × Q x C $_{q}$ )
$φ (S c T)$	$P$ (PID × SA $_{i}$ × C $_{s}$ )
$φ (A n o n y m i z e T)$	$P$ ((PID × Q × C $_{q}$ x C $_{s}$ )
$φ (A n o n y m i z e Q T)$	$P$ ((Q × C $_{q}$ )
$φ (M S T)$	$P$ ((SA $_{i}$ × C $_{i}$ )

Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).

Share and Cite

MDPI and ACS Style

Attaullah, H.; Anjum, A.; Kanwal, T.; Malik, S.U.R.; Asheralieva, A.; Malik, H.; Zoha, A.; Arshad, K.; Imran, M.A. F-Classify: Fuzzy Rule Based Classification Method for Privacy Preservation of Multiple Sensitive Attributes. Sensors 2021, 21, 4933. https://doi.org/10.3390/s21144933

AMA Style

Attaullah H, Anjum A, Kanwal T, Malik SUR, Asheralieva A, Malik H, Zoha A, Arshad K, Imran MA. F-Classify: Fuzzy Rule Based Classification Method for Privacy Preservation of Multiple Sensitive Attributes. Sensors. 2021; 21(14):4933. https://doi.org/10.3390/s21144933

Chicago/Turabian Style

Attaullah, Hasina, Adeel Anjum, Tehsin Kanwal, Saif Ur Rehman Malik, Alia Asheralieva, Hassan Malik, Ahmed Zoha, Kamran Arshad, and Muhammad Ali Imran. 2021. "F-Classify: Fuzzy Rule Based Classification Method for Privacy Preservation of Multiple Sensitive Attributes" Sensors 21, no. 14: 4933. https://doi.org/10.3390/s21144933

APA Style

Attaullah, H., Anjum, A., Kanwal, T., Malik, S. U. R., Asheralieva, A., Malik, H., Zoha, A., Arshad, K., & Imran, M. A. (2021). F-Classify: Fuzzy Rule Based Classification Method for Privacy Preservation of Multiple Sensitive Attributes. Sensors, 21(14), 4933. https://doi.org/10.3390/s21144933

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Menu

F-Classify: Fuzzy Rule Based Classification Method for Privacy Preservation of Multiple Sensitive Attributes

Abstract

1. Introduction

Motivation

2. Literature Review

3. Preliminaries

3.1. Notation

3.2. (p, k) Angelization Revisited

3.3. Fuzzification

3.4. HLPN

4. Proposed Approach: F-Classify

4.1. Linguistic Variables and Fuzzy Sets

4.2. Fuzzy Inference Rule-Based

4.3. Defuzzification

4.4. Permutation

5. Formal Modeling and Analysis

5.1. F-Classify Algorithm

5.2. Formal Modeling and Analysis

6. Results and Discussion

6.1. Experimental Setup

6.2. Measurement of Privacy

6.3. Discernibility Penalty

6.4. Normalized Certainty Penalty (NCP)

6.5. Query Error

6.6. Execution Time Analysis

7. Conclusions

Author Contributions

Funding

Conflicts of Interest

References

Share and Cite

Article Metrics

Article Access Statistics

Further Information

Guidelines

MDPI Initiatives

Follow MDPI