27 May 2019 in IEEE Access
A new k-anonymous method which is different from traditional k-anonymous was proposed to solve the problem of privacy protection. Specifically, numerical data achieves k-anonymous by adding noises, and categorical data achieves k-anonymous by using randomization. Using the above two methods, the drawback that at least k elements must have the same quasi identifier in the k-anonymous data set has been solved. Since the process of finding anonymous equivalence is very time consuming, a two-step clustering method is used to divide the original data set into equivalence classes. Firstly, the original data set is divided into several different sub-datasets, and then the equivalence classes are formed in the sub-datasets, thus greatly reducing the computational cost of finding anonymous equivalence classes. Experiments are conducted on three different data sets, and the results show that the proposed method is more efficient and the information loss of anonymous dataset is much smaller.
1 January 2021 in International Journal of Information and Computer Security
Differential privacy can provide provable privacy security protection. In recent years, a great improvement has been made, however, in practical applications, the utility of original data is highly susceptible to noise, and thus, it limits its application and extension. To address the above problem, a new differential privacy method based on smooth sensitivity has been proposed in this paper. Using this method, the dataset's utility is improved greatly by reducing the amount of noise that is added, and this was validated by experiments.