| Summary: | Preserving privacy of users has been one of the important research issues in social networks. Social networks contain sensitive personal information that are often released for business and research purposes. The privacy of a user can be breached if the data are not released in an anonymized form. In this thesis, we address edge weight disclosure, link disclosure and identity disclosure problems in publishing weighted network data. To counter these privacy risks while preserving high utility of the published data, we define two key privacy properties, namely edge weight unlinkability and node unlinkability. We design two novel anonymization schemes namely MinSwap and
|
|---|
