Privacy-Preserving Algorithms for Multiple Sensitive Attributes Satisfying t-Closeness

在线阅读 下载PDF 导出详情
摘要 Althoughk-anonymityisagoodwayofpublishingmicrodataforresearchpurposes,itcannotresistseveralcommonattacks,suchasattributedisclosureandthesimilarityattack.Toresisttheseattacks,manyrefinementsofk-anonymityhavebeenproposedwitht-closenessbeingoneofthestrictestprivacymodels.Whilemostexistingt-closenessmodelsaddressthecaseinwhichtheoriginaldatahaveonlyonesinglesensitiveattribute,datawithmultiplesensitiveattributesaremorecommoninpractice.Inthispaper,wecoverthisgapwithtwoproposedalgorithmsformultiplesensitiveattributesandmakethepublisheddatasatisfyt-closeness.Basedontheobservationthatthevaluesofthesensitiveattributesinanyequivalenceclassmustbeasspreadaspossibleovertheentiredatatomakethepublisheddatasatisfyt-closeness,bothofthealgorithmsusedifferentmethodstopartitionrecordsintogroupsintermsofsensitiveattributes.Oneusesaclusteringmethod,whiletheotherleveragestheprincipalcomponentanalysis.Then,accordingtothesimilarityofquasi-identifierattributes,recordsareselectedfromdifferentgroupstoconstructanequivalenceclass,whichwillreducethelossofinformationasmuchaspossibleduringanonymization.Ourproposedalgorithmsareevaluatedusingarealdataset.Theresultsshowthattheaveragespeedofthefirstproposedalgorithmisslowerthanthatofthesecondproposedalgorithmbuttheformercanpreservemoreoriginalinformation.Inaddition,comparedwithrelatedapproaches,bothproposedalgorithmscanachievestrongerprotectionofprivacyandreduceless.
机构地区 不详
出版日期 2018年06月16日(中国期刊网平台首次上网日期,不代表论文的发表时间)
  • 相关文献