Abstract
More and more people pay attention to the security problems in social network. We propose a (α,β,l,k)-anonymity model to protect the publishing data security based on the graph structure of social network. It can make anonymous vertexes and edges of graph effectively resist d-neighborhood attack, and structure attack. At the same time, it can make anonymous data of vertexes in social network effectively resist background knowledge attack and homogeneity attack by using the influence matrix of background knowledge, and can solve diversity of vertexes sensitive attribute, meet personalized needs according to the weighted parameter α, β given in advance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: DEStech Transactions on Computer Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
