Skip to Main Content
ASME Press Select Proceedings

International Conference on Information Technology and Computer Science, 3rd (ITCS 2011)

Editor
V. E. Muhin
V. E. Muhin
National Technical University of Ukraine
Search for other works by this author on:
W. B. Hu
W. B. Hu
Wuhan University
Search for other works by this author on:
ISBN:
9780791859742
No. of Pages:
656
Publisher:
ASME Press
Publication date:
2011

Sensitive relationship preservation is an important issue on publishing social network. The existing anonymization methods protect the social network by deleting the sensitive relationship in social network, which distort the social network greatly. Therefore, the utility of anonymous social network is low. This paper proposes a k-sensitive edge anonymity model which ensures that if a node has a sensitive edge, the number of the sensitive edges of the node is at least k to prevent the attacker exactly identifying sensitive relationship between individuals. The experiments show that k-sensitive edge anonymity model can retain more utility of the social network than the method of deleting sensitive edges under the condition of preserving the sensitive relationship.

This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal