Abstract

In recent years, personal data availability has become vast, which leads to the concept of Privacy-preserving. Privacy-Preserving is an essential issue in all research fields. Many privacy methods are available for privacy-preserving data publishing (PPDP); however, it suffers from a few drawbacks i) couldn't use on heterogeneous multiple sensitive attributes; ii) Customized sensitivity requirements are ignored. To make the model satisfy both criteria, we have proposed a Quasi-Identifier-Multiple heterogeneous sensitive attribute (QI-MHSA) generalization algorithm. Our first work in this paper is to apply vertical partitioning in the microdata and partitioning it into i) Quasi-identifier bucket (QIB) ii) Multiple heterogeneous sensitive attribute bucket (MHSAB). Second, we have applied k-anonymity in QIB to anonymize the quasi-identifiers and l-diversity in MHSAB to anonymize the different sensitive attributes (categorical and numerical). A Top-down generalization method is adopted to generalize the categorical and numerical attributes. Finally, a new approach has been implemented in the personalized privacy of sensitive attributes. A flag is set for both categorical and numerical sensitive attributes based on their sensitivity requirements in MHSAB. The generalization approaches differ according to the level of sensitivity requirement. Extensive implementation is done on two datasets to compare the algorithm's efficiency and prove that our model has a better balance between privacy and utility.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.