Qualitative Analysis Of Differential Privacy Applied Over Graph Structures
2013 ROEDUNET INTERNATIONAL CONFERENCE (ROEDUNET): NETWORKING IN EDUCATION, 11TH EDITION(2013)
摘要
The increase in popularity of online services has generated interest in developing new algorithms to better protect user privacy. Some services defend individual user records by only releasing statistics like the number of users that match certain criteria. If an attacker has access to side information, releasing such summaries can lead to privacy breaches where the records of a certain user are revealed. Differential privacy is a new technique which protects individual user records by altering the released statistics. Many services organize their data as a graph with the edge weights representing statistics. If such services are interested in releasing the information, they must do so in a privacy-preserving manner. We analyze how differential privacy can be used to protect such graph structures. We assess the quality of the released data in relation to the Dijkstra shortest path algorithm. Finally, we propose research directions to improve the performance of the released data.
更多查看译文
关键词
Internet,data privacy,graph theory,statistical analysis,Dijkstra shortest path algorithm,differential privacy,edge weights,graph structure protection,online services,performance improvement,privacy breaching,qualitative analysis,statistical analysis,user privacy protection,user record protection,
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络