An Approach to Information Hiding Based on Rough Set

With the rapid development of Internet, It is important to seek a balance between the publicity of sensitive or important information and the anonymisation of privacy information. In this paper, we propose β-Importance based on VPRS model and granularity theory to hide data effectively. When we obtain the important attributes from the information table, and then handle the values of unimportant attributes to extend. In term of users, the granularity of information become rough, so we achieve the anonymisation. We propose the relevant algorithm and apply this method to a real example, the results show that the proposed method is feasible.