<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">IASC</journal-id>
<journal-id journal-id-type="nlm-ta">IASC</journal-id>
<journal-id journal-id-type="publisher-id">IASC</journal-id>
<journal-title-group>
<journal-title>Intelligent Automation &#x0026; Soft Computing</journal-title>
</journal-title-group>
<issn pub-type="epub">2326-005X</issn>
<issn pub-type="ppub">1079-8587</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">27949</article-id>
<article-id pub-id-type="doi">10.32604/iasc.2023.027949</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Multi Attribute Case Based Privacy-preserving for Healthcare Transactional Data Using Cryptography</article-title><alt-title alt-title-type="left-running-head">Multi Attribute Case Based Privacy-preserving for Healthcare Transactional Data Using Cryptography</alt-title><alt-title alt-title-type="right-running-head">Multi Attribute Case Based Privacy-preserving for Healthcare Transactional Data Using Cryptography</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Saranya</surname><given-names>K.</given-names></name><email>saranyakbit@gmail.com</email>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Premalatha</surname><given-names>K.</given-names></name>
</contrib><aff><institution>Department of Computer Science and Engineering, Bannari Amman Institute of Technology</institution>, <addr-line>Sathyamangalam, 638401</addr-line>, <country>India</country></aff>
</contrib-group><author-notes><corresp id="cor1"><label>&#x002A;</label>Corresponding Author: K. Saranya. Email: <email>saranyakbit@gmail.com</email></corresp></author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-06-20"><day>20</day>
<month>06</month>
<year>2022</year></pub-date>
<volume>35</volume>
<issue>2</issue>
<fpage>2029</fpage>
<lpage>2042</lpage>
<history>
<date date-type="received"><day>29</day><month>1</month><year>2022</year></date>
<date date-type="accepted"><day>07</day><month>3</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Saranya and Premalatha</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Saranya and Premalatha</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_IASC_27949.pdf"></self-uri>
<abstract>
<p>Medical data mining has become an essential task in healthcare sector to secure the personal and medical data of patients using privacy policy. In this background, several authentication and accessibility issues emerge with an intention to protect the sensitive details of the patients over getting published in open domain. To solve this problem, Multi Attribute Case based Privacy Preservation (MACPP) technique is proposed in this study to enhance the security of privacy-preserving data. Private information can be any attribute information which is categorized as sensitive logs in a patient&#x2019;s records. The semantic relation between transactional patient records and access rights is estimated based on the mean average value to distinguish sensitive and non-sensitive information. In addition to this, crypto hidden policy is also applied here to encrypt the sensitive data through symmetric standard key log verification that protects the personalized sensitive information. Further, linear integrity verification provides authentication rights to verify the data, improves the performance of privacy preserving technique against intruders and assures high security in healthcare setting.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Privacy-preserving</kwd>
<kwd>crypto policy</kwd>
<kwd>medical data mining</kwd>
<kwd>integrity and verification</kwd>
<kwd>personalized records</kwd>
<kwd>cryptography</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Personal health information system is an important paradigm in healthcare industry that collects and stores the patient data including sensitive information like demographic data, medical history, diagnostic codes, treatment plans, lab records, insurance information, immune dates, allergies, etc. [<xref ref-type="bibr" rid="ref-1">1</xref>]. Privacy preservation in medical healthcare data has gained much attention in the recent years, especially information mining analysis in big data analysis play an important role for healthcare decisions. Healthcare industry generates huge volumes of medical data which should be analyzed with caution, as the number of patterns to be processed are high. Further, this healthcare data contains both sensitive and non-sensitive information in both structured and non-structured format. So, information access during any transactions pose severe threats to individual&#x2019;s data security in health care industry. Most of the patients have records, directed from hospitals, and it contains their Personal Health Information (PHI) which are used before treating a person. In this context, Personal Health Information (PHI) of a patient is shared among different departments of a hospital namely, pharmacy, lab, consulting, admin etc. Such medical records contain sensitive information with regard to the patients&#x2019; medical history. The chances for this information to be misused by anonymous intruders are extremely high. Private information leakage issue leads to information theft from patient&#x2019;s records or any other healthcare related documents. A patient&#x2019;s privacy and data security is breached when their healthcare data is shared without proper channel. So there is a need exists to develop a viable way that balances both healthcare data sharing as well as privacy protection [<xref ref-type="bibr" rid="ref-2">2</xref>]. In this study, a new privacy preserving framework is to be designed in the form of attribute-based protection using crypto analysis. This framework is developed for healthcare conditions and manages raw transaction datasets. A multi-attribute based protection policy is proposed using crypto policy standard to protect the raw data from segregating sensitive attributes which restrict unauthorized access and gives reverse hidden crypto policy to protect the sensitive information. This leads to the protection of sensitive medical information which is an important milestone in privacy preserving data policy.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Privacy preserving process in EHR</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_27949-fig-1.png"/>
</fig>
<p>Few privacy-preserving methods exist with an aim to protect the appropriate information of patients, while at the same time, it also maintains their private information including healthcare details. To accomplish this aim, a large number of privacy-preserving models is proposed to hide the sensitive information from public setting. Such Privacy-Preserving Data Publishing (PPDP) models are utilized to secure different types of information including socioeconomics and analysis codes with an expectation to keep the dangers of character disclosures such as trait disc1osure and enrollment disclosure as shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. Further, the privacy methods have evolved with another meaning of privacy called &#x2018;k secrecy&#x2019; which roughly translates into verified access from utility access logs. Being a namelessness demonstrate, it provides structure to the calculation whereas the frameworks disseminate the information, after anonymization. It secures the information that correlates to a specific substance. It principally keeps the private data away from linkage assault. Namelessness is accomplished by leveraging both concealment and speculation.</p>
<p>Most healthcare industry processes directly make use of data about patient&#x2019;s healthcare information without any protection. The industries do not concentrate on the influence of attacks upon sensitive information. In this scenario, outsider access becomes sophisticated and data access becomes easy. Otherwise, encryption policy is commonly employed to unhide or hide the whole data. The attribute case is non-violent against healthcare sensitive information and so the access restriction becomes an important element to verify the log of authentication.</p>
<p>When the personalized medical information is separated as attributes in the form of sensitive and non-sensitive patient&#x2019;s records, it specifies the existence of highly confidential and classified sensitive information. Medical reports contain the personal information of patients in unstructured formats. It contains critical information of the patient and their caretakers such as names, telephone numbers, locality, age and furthermore the points of sicknesses.</p>
<p>The medical records contain the original information, directed from hospital records, based on the diagnosed information. So, the data records must be open access for anyone to read the information. The sensitive information, which are non-secure in nature, contains various types of personalized information. The information from patients include general details of the patient like name, phone number and address while these data are not sensitive in nature than the treatment and disease facts.</p>
<p>For example, DNA sample and drugs intake levels are sensitive information in a case record of a patient. This medical record includes the patient&#x2019;s original drug details and if it is accessed by the hackers through unreasonable approaches, they may exploit the data to enhance their business interests and continue to do so. However, -crypto based hidden policy hides the sensitive information excluding authorized person who possess rights to access and ensure key authentication to access the data.</p>
<p>With the implementation of the proposed crypto policy, the patient&#x2019;s information logs in healthcare industry get high security. This can be achieved by improving privacy preserving framework in the form of provable privacy security policy. During the implementation of this policy, verifiable resources are verified which contain attributes that are highly sensitive and insensitive information that does not affect the transactions done in healthcare domain, by maintaining the privacy of the patient. Masking identifiers specify the sensitive information of suffix hidden crypto encryption standard that maintains the individual records of the patient.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Literature Survey</title>
<p>Privacy preserving approach is an important technique to secure the personalized data and privacy information of individuals. This is applicable especially in case of healthcare details of the patients [<xref ref-type="bibr" rid="ref-3">3</xref>]. Though most of the privacy preserving techniques secure personalized information and are difficult to use the differential security to control information, these techniques fail in hiding private data as sensitive information. So healthcare data and the information of patients get distributed freely. This sensitive data gets uncovered which is an essential issue to be overcome. One of the data privacy protection techniques called k-namelessness is implemented based on crypto policy. In k-anonym zed dataset [<xref ref-type="bibr" rid="ref-4">4</xref>], each record is undefined from any rate whereas k &#x2212;1 possesses different records regarding certain unique traits that depend upon the hiding principle.</p>
<p>Anonymization of restorative records is of extraordinary significance in healthcare domain, since uniform content can be easily accessible. This data about personal information of patients, accessed from healthcare specialist&#x2019;s records, can be protected based on Machine Learning approach named Principle Component Analysis (PCA) [<xref ref-type="bibr" rid="ref-5">5</xref>]. This is inclusive of bouncing the vulnerability of the calculated relapse and annoying the scholarly classifier with clamor that corresponds to the vulnerability [<xref ref-type="bibr" rid="ref-6">6</xref>]. When considering this approach, there are constraints present in it, when connected with other machine learning approaches. At that point, another privacy protection robust reversible calculation algorithm is discussed [<xref ref-type="bibr" rid="ref-7">7</xref>]. The proposed Scheme Against Global Eavesdropping (SAGE) can accomplish both security and provide relevant protection against global attackers. Privacy Preserving Data Publishing (PPDP) has a lot of strategies and devices to disseminate valuable data while safeguarding the information. The novel study is conducted to reveal how regression and correlation analysis can be performed on vertically-divided data using Locality Sensitive Hashing (LSH) approach [<xref ref-type="bibr" rid="ref-8">8</xref>]. As of late, PPDP has got impressive track record to look into groups, and numerous methodologies have been proposed for different types of information dissemination scenarios [<xref ref-type="bibr" rid="ref-9">9</xref>]. This sort of prerequisite is considerably harder to be addressed for dynamic and expansive scale joint efforts. Here, the quantity of access control approaches are huge in nature for both dissemination and exploration of the data [<xref ref-type="bibr" rid="ref-10">10</xref>]. In literature, Internet of Things (IoT) has been proposed to reconcile the activities that assess the application of strategies in health care applications [<xref ref-type="bibr" rid="ref-11">11</xref>].</p>
<p>In literature, the researchers investigated the necessities of a correspondence structure brought together from different individual entities. This study broke down the storyline based on a day in Robert&#x2019;s life. In the study conducted earlier [<xref ref-type="bibr" rid="ref-12">12</xref>], Secure Personal health information Sharing (SPS) was proposed which envelops personality-based cryptography to guarantee security and privacy of PHI by utilizing short advanced signature and pseudo-identity of the patient [<xref ref-type="bibr" rid="ref-13">13</xref>]. SPS reduces the burden of Health Service Provider (HSP) in terms of PHI stockpiling and administration. Further, it also supports the same by joining distributed storage administrations to electronic Health (eHealth) mind framework [<xref ref-type="bibr" rid="ref-14">14</xref>]. PHR is a sort of wellbeing record recorded and maintained by both patient and the healthcare professionals. A perfectly-maintained individual healthcare record can provide therapeutic data of the patient from various sources and help in decision making for the patient&#x2019;s wellbeing [<xref ref-type="bibr" rid="ref-15">15</xref>,<xref ref-type="bibr" rid="ref-16">16</xref>]. The medicinal synopsis from PHR can be accessed through Internet or other such media when there is a necessity for security and privacy.</p>
<p>From healthcare data security perspective, healthcare data is processed through Mobile Healthcare Networks (MHN) which needs support so that the quality of access verification can be enhanced. Further, a few countermeasures can also be taken for security and privacy assurance in MHNs including privacy-preserving healthcare information integration [<xref ref-type="bibr" rid="ref-17">17</xref>], preparation of secure healthcare information, and troubles in recognizing the information. Fine-Grained and versatile information reach the control plot in light of Attribute Based Encryption (ABE). Furthermore, PHI sharing approaches might be sensitive [<xref ref-type="bibr" rid="ref-18">18</xref>] and may uncover data about hidden PHI or information senders or recipients [<xref ref-type="bibr" rid="ref-19">19</xref>]. In current study, each characteristic is allowed to have a property name along with pride. Further, it is allowed to embrace the Bloom channel to check the traits before decryption efficiently. A certifiable and unavoidable health monitoring application (inescapable fall recognition for stroke alleviation) is developed to show the adequacy and viability of haze registered across the globe in wellbeing monitoring [<xref ref-type="bibr" rid="ref-20">20</xref>]. The author proposes an Adaptive Private Security (APS) algorithm to protect the sensitive information in healthcare industry [<xref ref-type="bibr" rid="ref-21">21</xref>,<xref ref-type="bibr" rid="ref-22">22</xref>].</p>
</sec>
<sec id="s3">
<label>3</label>
<title>Multi Attribute Case-Based Privacy Preservation Scheme</title>
<p>The healthcare processes contain sufficient security resource to carry out the protection of personalized data so as to safeguard the privacy information of patients. Conventional medical data is huge in quantity while the personal information cannot be easily mined out by product developers. Hence, the current study proposes to privacy-preserving the sensitive data from patent logs using Multi Attribute Case Based Privacy Preservation (MACPP). This is proposed for the purpose of improving the security of patient data. Healthcare information is viewed as an extremely critical aspect in today&#x2019;s world. Such data must be handled in a sensitive manner using advanced techniques since the patient&#x2019;s personal information are at risk. When such data is distributed without any inhibition, the data becomes defenseless against any types of attacks. Numerous methods have been proposed earlier to safeguard the privacy of healthcare information. In current research work, a review of the models and systems proposed earlier is shown while these models are used for distributing information about patients.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Architecture of multi attribute case based privacy preservation</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_27949-fig-2.png"/>
</fig>
<p>In this method, preprocessing is the first step to clean the raw data from medical dataset collection. Each transaction from the medical records contains different types of sensitive information in terms of drugs. So, this healthcare information should be accessed both on a private and general level. But the usage of personal medical information is different from general information of the patient. This should be understood finely to distinguish the sensitive information and protect it through hidden policy. Such sensitive data should be represented on raw conditions themselves which need privacy protection to be accessed by unauthorized persons.</p>
<p>The personal data collected from patients are always in raw state and can be segregated based on sensitive attributes from patient&#x2019;s records. Based on these values, the mean value of average is determined for both descriptive sensitive and non-sensitive data as shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. The average counts find the weightage factors for highly sensitive drug usage of the patients to use service level encryption standard that can hide the data. Finally, the linear integrity verifies the privacy terms against a user&#x2019;s key validation to prove the security.<list list-type="bullet"><list-item>
<p>Security and Privacy in Data Mining</p></list-item></list></p>
<p>Privacy is regularly characterized as a condition in which the sensitive information is secured by any means. It focuses on the utilization and administration of a person&#x2019;s personal information like making arrangements and setting up approval prerequisites so that the patient&#x2019;s personal information is gathered, shared and used in appropriate ways. By improving the security principles, the information can be partitioned in which the personalized information gets different access from general information that can be accessed by those only who has authorization. It focuses on shielding the information for authentication processes and taking information for a benefit by an authenticated person. In spite of the fact that security is imperative to ensure the information is safe, the privacy still lacks.<list list-type="bullet"><list-item>
<p>Objective consideration</p></list-item></list></p>
<p>From the proposal, it can be considered to apply data separation based on provable partition crypto techniques so that privacy can be preserved in classifying medical data. The authors considered two approaches to ensure privacy such as vertical partition and horizontal partition. In vertical partition approach, each site utilizes a segment of credits to register its outcomes. Followed by, the appropriate outcomes are collected at a focal point which gathers huge amount of outfit strategy. In horizontal partition approach, the information is conveyed among a few locales. Each site processes a particular information and a focal trust gathers information about these outcomes.</p>
<sec id="s3_1">
<label>3.1</label>
<title>Preprocessing Medical Datasets</title>
<p>Across the healthcare institutions, medical data sets are collected in the form of raw data so as to maintain the patient log. The information collected in hospitals form records with attributes that contain patient&#x2019;s information, drugs, suggestions and consent forms. The unavoidable yet unnecessary information is called as noise since it interrupts the information that provides much insights about the patient&#x2019;s health history. The attributes are nonlinear in its raw stages since it is yet to be pre-processed. Since empty fields bring noise to the analysis, record omission is carried out so that the important records are not avoided. Further, distinct outliers from medical data records are removed.</p>
<table-wrap id="table-1"><label>Table 1</label>
<caption>
<title>Raw pharm medical preprocessed dataset</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th colspan="12">Medical dataset attribute case process from pharm-medical raw records</th>
</tr>
<tr>
<th>Hospitalnumber</th>
<th>PatientId</th>
<th>Patientname</th>
<th>Age</th>
<th>Postcode</th>
<th>Diagnose</th>
<th>Mobnumber</th>
<th colspan="5">Drugs</th>
</tr>
<tr>
<th></th>
<th></th>
<th></th>
<th></th>
<th></th>
<th></th>
<th></th>
<th>Sancol</th>
<th>MMF</th>
<th>Livgen</th>
<th>Parctml</th>
<th>Misopro</th>
</tr>
</thead>
<tbody>
<tr>
<td>KMS1</td>
<td>1</td>
<td>Raja</td>
<td>24</td>
<td>635234</td>
<td>Arteries</td>
<td>9987876</td>
<td>40 mg</td>
<td>150 mg</td>
<td>35 mg</td>
<td>50 mg</td>
<td>Nil</td>
</tr>
<tr>
<td>KMS2</td>
<td>2</td>
<td>Devi</td>
<td>26</td>
<td>635124</td>
<td>H1N1</td>
<td>9987453</td>
<td>24 mg</td>
<td>10 mg</td>
<td>20 mg</td>
<td>100 mg</td>
<td>1 mg</td>
</tr>
<tr>
<td>KMS3</td>
<td>3</td>
<td>Kumar</td>
<td>28</td>
<td>636113</td>
<td>Dialysis</td>
<td>8976254</td>
<td>10 mg</td>
<td>20 mg</td>
<td>80 mg</td>
<td>10 mg</td>
<td>Nil</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="table" rid="table-1">Tab. 1</xref> demonstrates the preprocessed dataset out of raw pharm medical. This dataset contains information on patient id, name, age, mobile number, diagnose and drugs name &#x0026; dose.</p>
<fig id="fig-7">
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_27949-fig-7.png"/>
</fig>
<p>The above algorithm clears the raw data (Rs), which was collected as data without any outliers. to form distinct values from sensitive and non-sensitive information. Preprocessing narrows the raw data from a conventional approach in which each record is considered as an attribute while empty case are taken as Null field to reduce the dimension and simplify the privacy principle process.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Multi Attribute Case Reasoning</title>
<p>The attributes are measured to ensure data dependency and segregate the transactional data as sensitive and non-sensitive attributes. The verified category of sensitive case attributes is different from standard attribute case, for example, the paramedical counts from normal patients differ from other high-risk patients. So, the physicians prescribe drugs with highly sensitive information to treat the patients. In this point of view, privacy concerns arise due to the involvement of high sensitive data. This considers multiple attributes based on the relation between drug and diagnosed disease condition, and compound molecule pattern to process the reasoning principle and protect the data. The provable partition differentiates the sensitive attributes with differential count measure of other drug average mean values.</p>
<table-wrap id="table-2"><label>Table 2</label>
<caption>
<title>Raw attribute values</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th colspan="12">Medical dataset attribute case process from pharm-medical raw records</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="2">Hospital number</td>
<td colspan="3">Non sensitive attribute</td>
<td colspan="8">Sensitive attribute</td>
</tr>
<tr>
<td>Patient Id</td>
<td>Patient name</td>
<td>Post code</td>
<td>Age</td>
<td>Diagnose</td>
<td>Mob number</td>
<td>Sancol</td>
<td>MMF</td>
<td>Livgen</td>
<td>Parctml</td>
<td>Misopro</td>
</tr>
<tr>
<td>KMS1</td>
<td>1</td>
<td>Raja</td>
<td>635234</td>
<td>24</td>
<td>Arteries</td>
<td>9987876</td>
<td>40 mg</td>
<td>150 mg</td>
<td>35 mg</td>
<td>50 mg</td>
<td>Nil</td>
</tr>
<tr>
<td>KMS2</td>
<td>2</td>
<td>Devi</td>
<td>635124</td>
<td>26</td>
<td>H1N1</td>
<td>9987453</td>
<td>24 mg</td>
<td>10 mg</td>
<td>20 mg</td>
<td>100 mg</td>
<td>1 mg</td>
</tr>
<tr>
<td>KMS3</td>
<td>3</td>
<td>Kumar</td>
<td>636113</td>
<td>28</td>
<td>Dialysis</td>
<td>8976254</td>
<td>10 mg</td>
<td>20 mg</td>
<td>80 mg</td>
<td>10 mg</td>
<td>Nil</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The raw attribute is obtained from a confidential list which has a cross mean value of drug representation to combine the records as shown in <xref ref-type="table" rid="table-2">Tab. 2</xref>.</p>
<fig id="fig-8">
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_27949-fig-8.png"/>
</fig>
<p>The above algorithm splits the attributes into sensitive (Si) and non-sensitive (Nsi) based on results of relative mean analyses obtained from sensitive factors.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Hidden Crypto Security Analysis</title>
<p>In this stage, privacy principles verify the nature of outsourced data based on access principle so that cryptographic principle can be applied. This makes the sensitive information safer and its fortunes of privacy information cannot be misused. So, the suffix patterns are hidden to encrypt the data. In healthcare industry, patient&#x2019;s private information is highly important since it involves drugs and prescriptions that are hidden based on specified principles and access rights. The hidden crypto policy encrypts the sensitive information from logical suffix representation of each attribute. In records, it can be reversed to hide the information with specific characters using symmetric key verification standards.</p>
<table-wrap id="table-3"><label>Table 3</label>
<caption>
<title>Suffix hidden crypto policy</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th colspan="13">Medical data set attribute case process from pharm-medical Raw records</th>
</tr>
<tr>
<th>Hospital number</th>
<th colspan="3">Non sensitive attribute</th>
<th colspan="9">Sensitive attribute</th>
</tr>
<tr>
<th></th>
<th>Patient Id</th>
<th>Patient name</th>
<th>Post code</th>
<th>Age</th>
<th>Gender</th>
<th>Diagnose</th>
<th>Mob number</th>
<th>Sancol</th>
<th>MMF</th>
<th>Livgen</th>
<th>Parctml</th>
<th>Misopro</th>
</tr>
</thead>
<tbody>
<tr>
<td>KMS1</td>
<td>1</td>
<td>Raja</td>
<td>635234</td>
<td>XX</td>
<td>&#x002A;</td>
<td>Arteries</td>
<td>998XXX</td>
<td>40X</td>
<td>&#x002A;&#x002A;</td>
<td>&#x002A;&#x002A;</td>
<td>50XX</td>
<td>-</td>
</tr>
<tr>
<td>KMS2</td>
<td>2</td>
<td>Devi</td>
<td>635124</td>
<td>XX</td>
<td>&#x002A;</td>
<td>H1N1</td>
<td>998XXX</td>
<td>24X</td>
<td>&#x002A;&#x002A;</td>
<td>&#x002A;&#x002A;</td>
<td>10XX</td>
<td>&#x002A;&#x002A;</td>
</tr>
<tr>
<td>KMS3</td>
<td>3</td>
<td>Kumar</td>
<td>636113</td>
<td>XX</td>
<td>&#x002A;</td>
<td>Dialysis</td>
<td>897XXX</td>
<td>10X</td>
<td>&#x002A;&#x002A;</td>
<td>&#x002A;&#x002A;</td>
<td>10XX</td>
<td>-</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The sensitive attribute enriches the least maximum of suffix value and secures the information from unauthorized access. <xref ref-type="table" rid="table-3">Tab. 3</xref> shows the suffix hidden crypto policy for personal health information which is divided into sensitive and non-sensitive attributes.</p>
<fig id="fig-9">
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_27949-fig-9.png"/>
</fig>
<p>From the above table, the patient&#x2019;s information is secured using hidden crypto privacy policy. In patient information, the sensitive information such as drug and other medical information are categorized as &#x2018;miso&#x2019;. In special case, the private information specified from the prescription are hidden compared to other patient drug information. So this information is considered as a private one to be preserved.</p>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Linear Integrity for Verifiable Outsource Data</title>
<p>Linear integrity verifies the attribute case records which are sensitive in nature in terms of access rights on verification and validation against hackers. These hackers attempt to encrypt and decrypt the information on symmetric standard and hold the information constructs based on confirmation. Further, the trustworthiness of such data needs to be checked and the outsourced data must be reworked to meet the customer&#x2019;s demand. In addition, secure data sensitivity approach is proposed with enhanced security. This plan too helps in gaining extensive evidence and ensure dynamic skill activity simultaneuosly.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Result and Discussion</title>
<p>Multi attribute case-based privacy preservation algorithm was proposed and implemented in this study to assess its effectiveness upon patients&#x2019; health care records sourced from UCI web repository. The proposed privacy principle implemented a context-aware multi attribute relational analysis with hidden crypto model to deduce a set of privacy fields from a user&#x2019;s Electronic Health Records (EHR). The proposed method produced efficient results on context-aware clustering and improved the performance too. Principle Component Analysis (PCA), Locality Sensitive Hashing (LSH) and Adaptive Private Security (APS) are some of the algorithms used for comparison and its parameters are tabulated herewith.</p>
<table-wrap id="table-4"><label>Table 4</label>
<caption>
<title>Details of dataset</title></caption>
<table><colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Parameter</th>
<th>Value</th>
</tr>
</thead>
<tbody>
<tr>
<td>EHR</td>
<td>Medical records</td>
</tr>
<tr>
<td>Total records</td>
<td>3000</td>
</tr>
<tr>
<td>Tools used</td>
<td>Microsoft .net framework</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="table" rid="table-4">Tab. 4</xref> shows the details of data set used to evaluate the performance of the proposed Multi-Attribute Provable Partition-based approach. The performance of MAPPC was evaluated through privacy accuracy (cs), precision rate, recall rate and time complexity.</p>
<p><disp-formula id="eqn-1"><label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:mi mathvariant="normal">P</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">v</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">y</mml:mi><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">u</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">y</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">s</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="normal">R</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">v</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">u</mml:mi><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">b</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">u</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">r</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mi mathvariant="normal">s</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">p</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">k</mml:mi><mml:mi mathvariant="normal">s</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">d</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">s</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">r</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">f</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">m</mml:mi><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">h</mml:mi><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">k</mml:mi><mml:mi mathvariant="normal">s</mml:mi></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>

<p>In <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, the comparison results for privacy-preserving accuracy are shown which infer that the proposed method produced the highest performance than other methods.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Comparison of privacy accuracy</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_27949-fig-3.png"/>
</fig>

<p><xref ref-type="table" rid="table-5">Tab. 5</xref> shows the comparison results of privacy preserving accuracy achieved by the proposed method against existing techniques. The proposed model achieved privacy preserving accuracy values such as 96.8%, 97.9%, and 98.4% under 1000, 2000, and 3000 records respectively.</p>
<table-wrap id="table-5"><label>Table 5</label>
<caption>
<title>Comparison of privacy-preserving accuracy</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th colspan="6">Impact of privacy accuracy in %</th>
</tr>
<tr>
<th>Methods/number of records</th>
<th>Random projection</th>
<th>PCA</th>
<th>LSH</th>
<th>APS</th>
<th>MACPP</th>
</tr>
</thead>
<tbody>
<tr>
<td>1000 records</td>
<td>82.2</td>
<td>87.3</td>
<td>91.1</td>
<td>96.1</td>
<td>96.8</td>
</tr>
<tr>
<td>2000 records</td>
<td>85.4</td>
<td>89.5</td>
<td>93.2</td>
<td>97.5</td>
<td>97.9</td>
</tr>
<tr>
<td>3000 records</td>
<td>87.4</td>
<td>91.3</td>
<td>94.1</td>
<td>98.1</td>
<td>98.4</td>
</tr>
</tbody>
</table>
</table-wrap>
<sec id="s4_1">
<label>4.1</label>
<title>Analysis of Precision Rate</title>
<p>Precision (Pr) is defined as the proportion of total number of relevant sensitive information from healthcare dataset, where R is the relevant margin rate calculated and A is the total number of sensitive data.</p>
<p><disp-formula id="eqn-2"><label>(2)</label>
<mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:mi mathvariant="normal">P</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">P</mml:mi><mml:mi mathvariant="normal">r</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mspace width="thickmathspace" /><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>u</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>v</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>u</mml:mi><mml:mi>e</mml:mi><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>n</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mi>b</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>A</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mspace width="thickmathspace" /></mml:mrow><mml:mn>100</mml:mn></mml:mstyle></mml:math>
</disp-formula></p>

<p><xref ref-type="fig" rid="fig-4">Fig. 4</xref> shows the comparison results for precision rate produced by the proposed method against existing methods. The results infer that the proposed method produced an excellent performance rate than other methods.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Comparison of a precision rate</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_27949-fig-4.png"/>
</fig>

<p><xref ref-type="table" rid="table-6">Tab. 6</xref> shows the results accomplished by the proposed approach i.e., high performance ratios such as 89.1%, 85.4%, and 86.8% under 1000&#x2013;3000 records respectively.</p>
<table-wrap id="table-6"><label>Table 6</label>
<caption>
<title>Comparison of precision rate</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th colspan="6">Impact of precision in %</th>
</tr>
<tr>
<th>Methods/number of users</th>
<th>Random projection</th>
<th>PCA</th>
<th>LSH</th>
<th>APS</th>
<th>MACPP</th>
</tr>
</thead>
<tbody>
<tr>
<td>1000 records</td>
<td>68.2</td>
<td>71.2</td>
<td>76.3</td>
<td>87.3</td>
<td>89.1</td>
</tr>
<tr>
<td>2000 records</td>
<td>76.4</td>
<td>69.4</td>
<td>74.8</td>
<td>84.6</td>
<td>85.4</td>
</tr>
<tr>
<td>3000 records</td>
<td>66.2</td>
<td>70.2</td>
<td>73.2</td>
<td>85.5</td>
<td>86.8</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Analysis of Recall</title>
<p>Recall (Rc) is defined as the proportion of matched drug items within relevant drugs against the total drugs with high sensitivity.</p>
<p><disp-formula id="eqn-3"><label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:mrow><mml:mi mathvariant="normal">R</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">R</mml:mi><mml:mi mathvariant="normal">c</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mi>r</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>R</mml:mi><mml:mi>A</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>d</mml:mi><mml:mi>r</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>m</mml:mi><mml:mi>s</mml:mi><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>R</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mn>100</mml:mn></mml:mstyle></mml:math>
</disp-formula></p>

<p><xref ref-type="fig" rid="fig-5">Fig. 5</xref> shows the comparison results of false recall ratio produced by the proposed method against other methods. The proposed method achieved excellent performance over other methods.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Comparison of recall</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_27949-fig-5.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-6">Fig. 6</xref> shows the comparison results of time complexity achieved by both the proposed method and other methods considered for the study. The proposed approach produced less time complexity compared to other methods.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Comparison of time complexity</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_27949-fig-6.png"/>
</fig>
<p><xref ref-type="table" rid="table-7">Tab. 7</xref> shows the comparison results of recall value which infer that the proposed method accomplished the highest performance compared to other methods.</p>

<table-wrap id="table-7"><label>Table 7</label>
<caption>
<title>Comparison of recall</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th colspan="6">Impact of recall in %</th>
</tr>
<tr>
<th>Methods/number of records</th>
<th>Random projection</th>
<th>PCA</th>
<th>LSH</th>
<th>APS</th>
<th>MACPP</th>
</tr>
</thead>
<tbody>
<tr>
<td>1000 records</td>
<td>68.2</td>
<td>71.2</td>
<td>76.3</td>
<td>87.3</td>
<td>91.3</td>
</tr>
<tr>
<td>2000 records</td>
<td>67.4</td>
<td>69.4</td>
<td>74.8</td>
<td>84.6</td>
<td>92.2</td>
</tr>
<tr>
<td>3000 records</td>
<td>66.2</td>
<td>70.2</td>
<td>73.2</td>
<td>85.5</td>
<td>94.6</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Analysis of Time Complexity</title>
<p><disp-formula id="eqn-4"><label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">p</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">x</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">y</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">c</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">k</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">k</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x00D7;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="normal">p</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">p</mml:mi><mml:mi mathvariant="normal">r</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">l</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">c</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">k</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">s</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>

<p><xref ref-type="table" rid="table-8">Tab. 8</xref> shows the comparison of time complexity of the proposed precision clustering which offered time complexity values such as 4.7, 5.2 and 7.1 ms under 1000&#x2013;3000 records respectively.</p>
<table-wrap id="table-8"><label>Table 8</label>
<caption>
<title>Comparison of time complexity</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th colspan="6">Impact of time complexity in Mille seconds (ms)</th>
</tr>
<tr>
<th>Methods/number of records</th>
<th>Random projection</th>
<th>PCA</th>
<th>LSH</th>
<th>APS</th>
<th>MACPP</th>
</tr>
</thead>
<tbody>
<tr>
<td>1000 records</td>
<td>11.6</td>
<td>9.1</td>
<td>6.3</td>
<td>5.3</td>
<td>4.7</td>
</tr>
<tr>
<td>2000 records</td>
<td>14.4</td>
<td>13.4</td>
<td>8.8</td>
<td>6.6</td>
<td>5.2</td>
</tr>
<tr>
<td>3000 records</td>
<td>17.2</td>
<td>15.2</td>
<td>10.3</td>
<td>8.5</td>
<td>7.1</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>Healthcare privacy techniques focus on sensitive information collected from patient logs such as drug information, patient&#x2019;s medical history. So, such sensitive information must be protected from intruders. The current study proposed a multi attribute sensitive protection method using relational analyses using benchmark healthcare data. The proposed MACPP considered radical patient-centric information from drugs category with sensitive personal prescription in order to achieve provable linear partition and enhance the level of security. The performance of the proposed framework, in terms of accuracy, was found to be higher compared to other methods. The proposed method improved the performance of privacy accuracy by 96.8%, with a least time complexity of 4.7 milliseconds. The experimental results established the privacy-preserving ability of state-of-the-art model which is phenomenal and better than existing methods. In future, hybrid deep learning models can be employed to further improve the security of sensitive data.</p>
</sec>
</body>
<back><fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> The authors received no specific funding for this study.</p>
</fn>
<fn fn-type="conflict">
<p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>K. M.</given-names> <surname>Chong</surname></string-name></person-group>, &#x201C;<article-title>Privacy-preserving healthcare informatics: A review</article-title>,&#x201D; in <conf-name>ITM Web of Conf.</conf-name>, <conf-loc>Malaysia</conf-loc>, <volume>36</volume>, pp. <fpage>4005</fpage>, <year>2021</year>. </mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Dong</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Chen</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Healthchain: Secure EMRs management and trading in distributed healthcare service system</article-title>,&#x201D; <source>IEEE Internet of Things Journal</source>, vol. <volume>8</volume>, no. <issue>9</issue>, pp. <fpage>7192</fpage>&#x2013;<lpage>7202</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Ahmad</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>A new anti-quantum proxy blind signature for blockchain-enabled Internet of Things</article-title>,&#x201D; <source>Computers Materials &#x0026; Continua</source>, vol. <volume>61</volume>, no. <issue>2</issue>, pp. <fpage>711</fpage>&#x2013;<lpage>726</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.-Y.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>X.-B.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>Y.-L.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>Y.-Y.</given-names> <surname>Hou</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>A New lattice-based signature scheme in post-quantum blockchain network</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>2026</fpage>&#x2013;<lpage>2033</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Szarvas</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Farkas</surname></string-name> and <string-name><given-names>R. B.</given-names> <surname>Fekete</surname></string-name></person-group>, &#x201C;<article-title>State-of-the-art anonymization of medical records using an iterative machine learning framework</article-title>,&#x201D; <source>Journal of the American Medical Informatics Association</source>, vol. <volume>14</volume>, pp. <fpage>574</fpage>&#x2013;<lpage>580</lpage>, <year>2007</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X. R.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>W. F.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>X. M.</given-names> <surname>Sun</surname></string-name> and <string-name><given-names>S. K.</given-names> <surname>Jha</surname></string-name></person-group>, &#x201C;<article-title>A robust 3-D medical watermarking based on wavelet transform for data protection</article-title>,&#x201D; <source>Computer Systems Science &#x0026; Engineering</source>, vol. <volume>41</volume>, no. <issue>3</issue>, pp. <fpage>1043</fpage>&#x2013;<lpage>1056</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X. R.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>X. M.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Sun</surname></string-name> and <string-name><given-names>S. K.</given-names> <surname>Jha</surname></string-name></person-group>, &#x201C;<article-title>Robust reversible audio watermarking scheme for telemedicine and privacy protection</article-title>,&#x201D; <source>Computers Materials &#x0026; Continua</source>, vol. <volume>71</volume>, no. <issue>2</issue>, pp. <fpage>3035</fpage>&#x2013;<lpage>3050</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. F.</given-names> <surname>Karr</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Lin</surname></string-name>, <string-name><given-names>A. P.</given-names> <surname>Sanil</surname></string-name> and <string-name><given-names>J. P.</given-names> <surname>Reiter</surname></string-name></person-group>, &#x201C;<article-title>Privacy-preserving analysis of vertically partitioned data using secure matrix products</article-title>,&#x201D; <source>Journal of Official Statistics</source>, vol. <volume>25</volume>, no. <issue>1</issue>, pp. <fpage>125</fpage>&#x2013;<lpage>138</lpage>, <year>2009</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B. C. M.</given-names> <surname>Fung</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>P. S.</given-names> <surname>Yu</surname></string-name></person-group>, &#x201C;<article-title>Privacy-preserving data publishing: A survey of recent developments</article-title>,&#x201D; <source>ACM Computing Survey</source>, vol. <volume>42</volume>, no. <issue>4</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>53</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Lin</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Rao</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Bertino</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Li</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Lobo</surname></string-name></person-group>, &#x201C;<article-title>EXAM: A comprehensive environment for the analysis of access control policies</article-title>,&#x201D; <source>International Journal of Information Security</source>, vol. <volume>9</volume>, no. <issue>4</issue>, pp. <fpage>253</fpage>&#x2013;<lpage>273</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Bui</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Zorzi</surname></string-name></person-group>, &#x201C;<article-title>Health care applications: A solution based on the internet of things</article-title>,&#x201D; in <conf-name>ISABEL &#x0027;11: Proc. of the 4th Int. Symp. on Applied Sciences in Biomedical and Communication Technologie</conf-name>, <publisher-loc>Barcelona, Spain</publisher-loc>, pp. <fpage>131</fpage>&#x2013;<lpage>135</lpage>, <year>2011</year>. </mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>S&#x00E1;nchez</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Bates</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Viejo</surname></string-name></person-group>, &#x201C;<article-title>Automatic general-purpose sanitization of textual documents</article-title>,&#x201D; <source>IEEE Transactions on Information Forensics and Security</source>, vol. <volume>8</volume>, no. <issue>6</issue>, pp. <fpage>853</fpage>&#x2013;<lpage>862</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Barua</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Lu</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Shen</surname></string-name></person-group>, &#x201C;<article-title>SPS: Secure personal health information sharing with patient-centric access control in cloud computing</article-title>,&#x201D; in <conf-name>2013 IEEE Global Communications Conf. (GLOBECOM)</conf-name>, <publisher-loc>Atlanta, GA</publisher-loc>, pp. <fpage>647</fpage>&#x2013;<lpage>652</lpage>, <year>2013</year>. </mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Hay</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Miklau</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>A data- and workload-aware algorithm for range queries under differential privacy</article-title>,&#x201D; <source>Proceedings of the VLDB Endowment</source>, vol. <volume>7</volume>, no. <issue>5</issue>, pp. <fpage>341</fpage>&#x2013;<lpage>352</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T. S.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>C. H.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>T. L.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>C. S.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>J. G.</given-names> <surname>Bau</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Secure dynamic access control scheme of PHR in cloud computing</article-title>,&#x201D; <source>Journal of Medical Systems</source>, vol. <volume>36</volume>, no. <issue>6</issue>, pp. <fpage>4005</fpage>&#x2013;<lpage>4020</lpage>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Xue</surname></string-name></person-group>, &#x201C;<article-title>Role-based and time-bound access and management of EHR data</article-title>,&#x201D; <source>Security and Communication Networks</source>, vol. <volume>7</volume>, no. <issue>6</issue>, pp. <fpage>994</fpage>&#x2013;<lpage>1015</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Liang</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Su</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Shen</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Security and privacy for mobile healthcare networks: From a quality of protection perspective</article-title>,&#x201D; <source>IEEE Wireless Communications</source>, vol. <volume>22</volume>, no. <issue>4</issue>, pp. <fpage>104</fpage>&#x2013;<lpage>112</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Jiang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zhu</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Epps: Efficient and privacy-preserving personal health information sharing in mobile healthcare social networks</article-title>,&#x201D; <source>Sensors</source>, vol. <volume>15</volume>, no. <issue>9</issue>, pp. <fpage>22419</fpage>&#x2013;<lpage>22438</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>E. K.</given-names> <surname>Park</surname></string-name></person-group>, &#x201C;<article-title>Big data as an e-Health service</article-title>,&#x201D; in <conf-name>2014 Int. Conf. on Computing, Networking and Communications (ICNC)</conf-name>, <publisher-loc>Honolulu, HI, USA</publisher-loc>, pp. <fpage>982</fpage>&#x2013;<lpage>988</lpage>, <year>2014</year>. </mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Tang</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Lan</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>A case for software-defined code scheduling based on transparent computing</article-title>,&#x201D; <source>Peer-to-Peer Networking and Applications</source>, vol. <volume>11</volume>, no. <issue>4</issue>, pp. <fpage>668</fpage>&#x2013;<lpage>678</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Cao</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Hou</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Brown</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Chen</surname></string-name></person-group>, &#x201C;<article-title>Distributed analytics and edge intelligence: Pervasive health monitoring at the era of fog computing</article-title>,&#x201D; in <conf-name>Mobidata &#x0027;15: Proc. of the 2015 Workshop on Mobile Big Data</conf-name>, <publisher-loc>New York</publisher-loc>, <publisher-name>NY, United States</publisher-name>, pp. <fpage>43</fpage>&#x2013;<lpage>48</lpage>, <year>2015</year>. </mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Alnemari</surname></string-name>, <string-name><given-names>C. J.</given-names> <surname>Romanowski</surname></string-name> and <string-name><given-names>R. K.</given-names> <surname>Raj</surname></string-name></person-group>, &#x201C;<article-title>An adaptive differential privacy algorithm for range queries over healthcare data</article-title>,&#x201D; in <conf-name>2017 IEEE Int. Conf. on Healthcare Informatics (ICHI)</conf-name>, <publisher-loc>Park City, UT, USA</publisher-loc>, pp. <fpage>397</fpage>&#x2013;<lpage>402</lpage>, <year>2017</year>. </mixed-citation></ref>
</ref-list>
</back>
</article>