Attacks against K-anonymity

Slides:



Advertisements
Similar presentations
Collections Chapter Java Collection Frameworks The Java collection framework is a set of utility classes and interfaces. Designed for working with.
Advertisements

Relational Algebra Dashiell Fryer. What is Relational Algebra? Relational algebra is a procedural query language. Relational algebra is a procedural query.
Implementation of Relational Operations (Part 2) R&G - Chapters 12 and 14.
M-Invariance: Towards Privacy Preserving Re-publication of Dynamic Datasets by Tyrone Cadenhead.
SECTION 21.5 Eilbroun Benjamin CS 257 – Dr. TY Lin INFORMATION INTEGRATION.
UTEPComputer Science Dept.1 University of Texas at El Paso Privacy in Statistical Databases Dr. Luc Longpré Computer Science Department Spring 2006.
1 Dr. Xiao Qin Auburn University Spring, 2011 COMP 7370 Advanced Computer and Network Security Generalizing.
15.6 Index-based Algorithms Jindou Jiao 101. Index-based algorithms are especially useful for the selection operator Algorithms for join and other binary.
 Thumbnails are used to show a library of images in a small space.  When you click on the thumbnail image the full size image appears.
1 Dr. Xiao Qin Auburn University Spring, 2011 COMP 7370 Advanced Computer and Network Security Generalizing.
C MU U sable P rivacy and S ecurity Laboratory 1 Privacy Policy, Law and Technology Data Privacy October 30, 2008.
Relational Model and Relational Algebra Rose-Hulman Institute of Technology Curt Clifton.
Anatomy: Simple and Effective Privacy Preservation Israel Chernyak DB Seminar (winter 2009)
Privacy Policy, Law and Technology Carnegie Mellon University Fall 2007 Lorrie Cranor 1 Data Privacy.
April 13, 2010 Towards Publishing Recommendation Data With Predictive Anonymization Chih-Cheng Chang †, Brian Thompson †, Hui Wang ‡, Danfeng Yao † †‡
Protecting Privacy when Disclosing Information Pierangela Samarati Latanya Sweeney.
Selection Sort
The Union-Split Algorithm and Cluster-Based Anonymization of Social Networks Brian Thompson Danfeng Yao Rutgers University Dept. of Computer Science Piscataway,
PRIVACY CRITERIA. Roadmap Privacy in Data mining Mobile privacy (k-e) – anonymity (c-k) – safety Privacy skyline.
Preserving Privacy in Clickstreams Isabelle Stanton.
1 times table 2 times table 3 times table 4 times table 5 times table
Privacy-preserving Anonymization of Set Value Data Manolis Terrovitis, Nikos Mamoulis University of Hong Kong Panos Kalnis National University of Singapore.
AP Statistics Section 13.1 A. Which of two popular drugs, Lipitor or Pravachol, helps lower bad cholesterol more? 4000 people with heart disease were.
Li Xiong CS573 Data Privacy and Security Healthcare privacy and security: Genomic data privacy.
Section 2.4: Simple Comparative Experiments. Experiment – A planned intervention undertaken to observe the effects of one or more explanatory variables,
7.2-3 Solving Linear Equations. A linear equation in one variable is an equation in which the same letter is used in all variable terms and the exponent.
AP Statistics Section 13.1 A. Which of two popular drugs, Lipitor or Pravachol, helps lower bad cholesterol more? 4000 people with heart disease were.
Data Anonymization – Introduction and k-anonymity Li Xiong CS573 Data Privacy and Security.
Hybrid l-Diversity* Mehmet Ercan NergizMuhammed Zahit GökUfuk Özkanlı
HIDING EMERGING PATTERNS WITH LOCAL RECODING GENERALIZATION Presented by: Michael Cheng Supervisor: Dr. William Cheung Co-Supervisor: Dr. Byron Choi.
Preservation of Proximity Privacy in Publishing Numerical Sensitive Data J. Li, Y. Tao, and X. Xiao SIGMOD 08 Presented by Hongwei Tian.
1 Publishing Naive Bayesian Classifiers: Privacy without Accuracy Loss Author: Barzan Mozafari and Carlo Zaniolo Speaker: Hongwei Tian.
Selection Sort
Sorting by the Numbers Sorting Part Four. Question Suppose you are given the task of writing an application to sort a big data file. What do you need.
Adding SubtractingMultiplyingDividingMiscellaneous.
Privacy-preserving data publishing
Thesis Sumathie Sundaresan Advisor: Dr. Huiping Guo.
AS91587 Simultaneous Equations. In mathematics, a system of linear equations (or linear system) is a collection of linear equations involving the same.
CSCI 347, Data Mining Data Anonymization.
Preserving Privacy GPS Traces via Uncertainty-Aware Path Cloaking Baik Hoh, Marco Gruteser, Hui Xiong, Ansaf Alrabady Presenter:Yao Lu ECE 256, Spring.
Anonymizing Data with Quasi-Sensitive Attribute Values Pu Shi 1, Li Xiong 1, Benjamin C. M. Fung 2 1 Departmen of Mathematics and Computer Science, Emory.
$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.
Restrictions Objectives of the Lecture : To consider the algebraic Restrict operator; To consider the Restrict operator and its comparators in SQL.
Tables Learning Support
Unraveling an old cloak: k-anonymity for location privacy
Suppose a sequence begins 2, 4, …………………. Would could the formula be?
DATA MANAGEMENT AND DATABASES. Data Management Data management is the process of controlling the information generated during a research project or transaction.
Personalized Privacy Preservation: beyond k-anonymity and ℓ-diversity SIGMOD 2006 Presented By Hongwei Tian.
Database Security. Introduction to Database Security Issues (1) Threats to databases Loss of integrity Loss of availability Loss of confidentiality To.
An agency of the European Union Guidance on the anonymisation of clinical reports for the purpose of publication in accordance with policy 0070 Industry.
Database System Implementation CSE 507
ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION International Journal on Uncertainty, Fuzziness and Knowledge-based Systems,
Times Tables.
BACK SOLUTION:
18.5 An Architecture for a Locking Scheduler
Inference and Flow Control
The Relational Algebra and Relational Calculus
More Relational Algebra
أنماط الإدارة المدرسية وتفويض السلطة الدكتور أشرف الصايغ
Confidence intervals for the difference between two means: Paired samples Section 10.3.
Presented by : SaiVenkatanikhil Nimmagadda
For First Place Most Times Up at the Table
Adding with 9’s.
Adding with 10’s.
Inference and Observation Activity.
Adding ____ + 10.
3 times tables.
6 times tables.
HILDA Survey Melbourne Institute of Applied Economic and Social Research The Household, Income and Labour Dynamics in Australia (HILDA) Survey is a household-based.
RANDOM NUMBERS SET # 1:
Presentation transcript:

Attacks against K-anonymity

Unsorted matching attack against k-anonymity Problem This attack is based on the order in which tuples appear in the released table. Solution By randomly sorting the tuples of the solution table

Unsorted matching attack against k-anonymity

Complementary release attack against k-anonymity Suppose Table GT1 is released. If subsequently GT3 is also released, then the k-anonymity protection will no longer hold, even though the tuple positions are randomly determined in both tables

Temporal attack against k-anonymity Problem Data collections are dynamic. Tuples are added, changed, and removed constantly. As a result, releases of generalized data over time can be subject to a temporal inference attack. Solution Either all of the attributes of first table would be considered a quasiidentifier for subsequent releases Subsequent releases themselves would be based on first table.