2012-04-11 - : K-Anonymity in Social Networks: A Clustering Approach - CERIAS Security Seminar
Recorded: 04/11/2012
CERIAS Security Seminar at Purdue University
: K-Anonymity in Social Networks: A Clustering Approach
Traian Truta, Northern Kentucky University
The proliferation of social networks, where individuals share private information, has caused, in the last few years, a growth in the volume of sensitive data being stored in these networks. As users subscribe to more services and connect more with their friends, families, and colleagues, the desire to use this information from the networks has increased. Online social interaction has become very popular around the globe and most sociologists agree that this will not fade away. Social network sites gather confidential information from their users (for instance, the social network site PacientsLikeMe collects confidential health information) and, as a result, social network data has begun to be analyzed from a different, specific privacy perspective. Since the individual entities in social networks, besides the attribute values that characterize them, also have relationships with other entities, the risk of disclosure increases. In this talk we present a greedy algorithm for anonymizing a social network and a measure that quantifies the information loss in the anonymization process due to edge generalization.
Traian Marius Truta is an associate professor of Computer Science at Northern Kentucky University. He received his Ph.D. in computer science from Wayne State University in 2004. His major areas of expertise are data privacy and anonymity, privacy in statistical databases, and data management. He has served on the program committee of various conferences such as International Conference on Database and Expert Systems Applications (DEXA), Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), ACM Symposium of Applied Computing (SAC), and International Symposium on Data, Privacy, and E-Commerce (ISDPE). He received the Yahoo Research! Best Paper Award for Privacy, Security, and Trust in KDD 2008 (PinKDD) for the paper �A Clustering Approach for Data and Structural Anonymity in Social Networks� in 2008. For more information, including the list of research publications please see: http://www.nku.edu/~trutat1/research.html. (Visit: www.cerias.purude.edu)
Видео 2012-04-11 - : K-Anonymity in Social Networks: A Clustering Approach - CERIAS Security Seminar канала Purdue CERIAS
CERIAS Security Seminar at Purdue University
: K-Anonymity in Social Networks: A Clustering Approach
Traian Truta, Northern Kentucky University
The proliferation of social networks, where individuals share private information, has caused, in the last few years, a growth in the volume of sensitive data being stored in these networks. As users subscribe to more services and connect more with their friends, families, and colleagues, the desire to use this information from the networks has increased. Online social interaction has become very popular around the globe and most sociologists agree that this will not fade away. Social network sites gather confidential information from their users (for instance, the social network site PacientsLikeMe collects confidential health information) and, as a result, social network data has begun to be analyzed from a different, specific privacy perspective. Since the individual entities in social networks, besides the attribute values that characterize them, also have relationships with other entities, the risk of disclosure increases. In this talk we present a greedy algorithm for anonymizing a social network and a measure that quantifies the information loss in the anonymization process due to edge generalization.
Traian Marius Truta is an associate professor of Computer Science at Northern Kentucky University. He received his Ph.D. in computer science from Wayne State University in 2004. His major areas of expertise are data privacy and anonymity, privacy in statistical databases, and data management. He has served on the program committee of various conferences such as International Conference on Database and Expert Systems Applications (DEXA), Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), ACM Symposium of Applied Computing (SAC), and International Symposium on Data, Privacy, and E-Commerce (ISDPE). He received the Yahoo Research! Best Paper Award for Privacy, Security, and Trust in KDD 2008 (PinKDD) for the paper �A Clustering Approach for Data and Structural Anonymity in Social Networks� in 2008. For more information, including the list of research publications please see: http://www.nku.edu/~trutat1/research.html. (Visit: www.cerias.purude.edu)
Видео 2012-04-11 - : K-Anonymity in Social Networks: A Clustering Approach - CERIAS Security Seminar канала Purdue CERIAS
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
Introduction to the ARX Data Anonymization ToolThe Difference Between Pseudonymization & Anonymization | comforte AGK-Anonymization or why Aggregation is not Enough[Коллоквиум]: k-Anonymization by Freeform GeneralizationLinking Attack and K-AnonymityHow does location data anonymity work?Lecture 24 — Community Detection in Graphs - Motivation | Stanford University2014-04-30 CERIAS - Women In Cyber SecurityDATA MINING 4 Pattern Discovery in Data Mining 5 2 GSP Apriori Based Sequential Pattern MininThe Definition of Differential Privacy - Cynthia DworkPresidio - Automated identification and anonymization of PII data at scaleCERIAS Seminar: Security Applications for Physically Unclonable FunctionsLatanya Sweeney: When anonymized data is anything but anonymous2016-09-14 CERIAS - General Motors Product Cybersecurity OverviewUSENIX Security '17 - Differential Privacy: From Theory to DeploymentIntroduction to Vehicular Ad hoc Network (VANET) in EnglishProblem on Haar Wavelet transform (vector)"Navigating Cybersecurity and Public Policy Six Key Issues," Herbert LinIntroduction to Sequential Pattern Mining - Customer Transactionsl diversity k anonymity for privacy preserving data ( Java)