A method for protecting multi-sensitive attributes based on maximal-leaf-subtree-first strategy

Ruili Qi · Journal of Yanshan University · 2009

First,the multi-sensitive attributes privacy protecting problem was transformed into the multi-sensitive attributes L-diversity problem.Then,a method of construction for the multi-sensitive attributes tree and the maximal-leaf-subtree-first strategy were presented.Based on this,a multi-sensitive attributes protecting algorithm was proposed.Finally,the algorithm was confirmed and analyzed through experiment.The results show that the method can effectively protect data privacy and reducing information disclosure.

Read the paper · More papers on PaperTik