Privacy Policy. What is Data Privacy? Privacy Policy. Data Privacy Friend or Foe? Some Positives

Transcription

1 Privacy Policy Data Privacy Friend or Foe? Some Limitations Need robust language Need enforcement Scope of world / interaction Syntax, not semantics Bradley Malin, malin@cscmuedu Data Privacy Laboratory, School of Computer Science Carnegie Mellon University October 26, 24 What is Data Privacy? WHERE does data come from? WHAT does data reveal? HOW do we prove data does not reveal more than specified? Privacy Policy Some Positives Procedure Specifies how data can (not) be used Logical Cognition Requires active involvement and thought regarding information Standardization equal opportunity Legal Enforcement What is Data Privacy? The study of computational solutions for releasing data such that the data remain practically useful while the aspects of the subjects of the data are not revealed Privacy Protection ( data protectors ): release information such that entity-specific properties (eg identity) are controlled restrict what can be learned Data Linkage ( data detectives ) combining disparate pieces of entity-specific information to learn more about an entity

2 Relationships Between Related Areas INFERENCE CONTROL PUBLIC POLICY DISCLOSURE CONTROL PRIVACY- PRESERVING DATA MINING LAW PRIVACY SPECIFICATION ANONYMITY (De-identification) Diagram courtesy of Michael Shamos HUMAN INTERFACE ORGANIZATIONAL PRACTICES ENFORCEMENT & IMPLEMENTATION AUDIT & ACCOUNTABILITY SECURITY TRUSTED HARDWARE CRYPTO Data Data Data What kind of data? Field Structured Databases Text Documents Genomic Image Video Network (Physical or Social) Communications All kinds! Data Privacy is Interdisciplinary Table courtesy of Latanya Sweeney AI learning theory database language security IS anonymity heavy some heavy rights mgt some heavy database some heavy some ubiquitous heavy heavy heavy some some some AI primarily concerns knowledge representation and semantics Learning focuses on data mining algorithms Theory includes zero-knowledge proofs and multi-party computations Information Explosion 3 Increase in technological capability for collection, storage, 25 transfer Growth in 2 active web 5 Decrease servers in cost Global Disk Storage Per Person (GDSP) Sewrvers (in Millions) GDSP (MB/person) ~(hard drive space) / (world population) Storage (tera) Population ( 9 ) Person-time / page months 6, hour [Sweeney 997] Growth in available disk storage 993 First WWW 57 conference 2 2,8, 6 35 min Year

3 Anonymity & De-identification Anonymous: Data can not be manipulated or linked to identify an individual De-identified: All explicit identifiers, such as name, address, & phone number are removed, generalized, or replaced with made up values Does Anonymous = De-identified? Direct Linkage Uses the combination of attributes to determine the uniqueness of an entity in a dataset Second dataset with identified subjects is used to make the re-identification by drawing inferences between the two datasets on the related attributes The attributes do not have to be equal, but there must exist some ability for inference of between attributes Medical Information Linking to re-identify data Attributes Recommended by NAHDO (outside scope of HIPAA) Patient Zip Code Patient Birth Date Patient Gender Patient Racial Background Patient Number Visit Date Principle Diagnosis Codes (ICD-9) Procedure Codes Physician ID Number Physician Zip Code Total Charges Ethnicity Visit date Diagnosis Procedure Medication Total charge Zip Birthdate Sex Medical Data 3

4 Linking to re-identify data Zip Birthdate Sex Name Address Date registered Party affiliation Date last voted {date of birth, gender, 5-digit ZIP} uniquely identifies 87% of USA [Sweeney 97, 98] Few fields are needed to uniquely identify individuals Voter List Linking to re-identify data Ethnicity Visit date Diagnosis Procedure Medication Total charge Zip Sex Name Address 87% of the United States is Birthdate RE-IDENTIFIABLE Date registered Party affiliation Date last voted [Sweeney 97, 98] {date of birth, gender, 5-digit ZIP} [Sweeney 97, 98] uniquely identifies 87% of USA ZIP 6623, 2,67 people, %, not % insufficient # above the age of 55 living there Medical Data Voter List 4

5 {date of birth, gender, 5-digit ZIP} uniquely identifies 87% of USA pop ZIP 794, 548 people, primarily between 9 and 24 (4666 of 548 or 86%), only 3% [Sweeney 97, 98] Chain of Links Voter List D G Z Medical Data Semantic Learning Chain of Links Mining strategic information from text, and from video Automated profiles (putting disparate pieces together) Resolving ambiguous identities in data (eg Michael Jordan, the basketball player, vs Michael Jordan, the computer scientist) Edoardo Airoldi William Gronim Ralph Gross Kishore Madhava Bradley Malin Algorithms for learning sensitive information from seemingly innocent information Voter List D G Z Medical Data So what do you do? DNA Data Mutation Analysis Prediction and Risk Pharmaco-Genomic Relations Familial Relations ATCGATCGAT 5

6 Building Up Relations Ethnicity Visit date Zip Diagnosis Birthdate Procedure Sex Medication Total charge Medical Data DNA Data ATCGATCGAT CleanGene Step : gender via genetic locus Step 2: classify disease by known mutations Step 3: hospital ID and other inferences Step 4: linking DNA with the medical profile [Malin & Sweeney 2] 2 3 n HID k m 2 HID k f 3 HID k m n HID k f 2 3 n STEP Full Sequences known STEP 3 STEP n 2 3 n m f m f STEP 2 ESTs / cdnas ZIP i DOB HID k m 2 ZIP j DOB 2 HID k f 3 ZIP i DOB 3 HID k m m ZIP i DOB m HID k f Genotype-Phenotype Relations Can infer genotype-phenotype relationships out of both DNA and medical databases Medical Database DIAGNOSIS Phenotype With Genetic Trait ACTG Genomic DNA Longitudinal Genomic Learning Model Clinical Profiles Diagnoses Clinical Phenotype State Mapping Classify Profile Visits [Malin & Sweeney 22] DIAGNOSIS Disease Phenotype ACTG Disease Sequences DNA Database Constrain Profile State Alignment DNA Predictions 6

7 Experimental Results DNA with Huntington s Disease Example: Huntington s disease Exists strong correlation between age of onset and DNA mutation (# of CAG repeats) Given longitudinal clinical info, accurately infer age of onset in 2 of 22 cases Size of Repeat vs Age of Onset y = -248Ln(x) R 2 = 889 Malin B and Sweeney L Inferring genotype from clinical phenotype through a knowledge-based algorithm Privacy Policy, In Technology, Pacific and Symposium Law on Biocomputing Data Privacy: pp Foe, 4-52, then Jan Friend 22 # CAG repeats Age Age of Onset Age of Onset Prediction individual Individual act ual age min age max age Websites Share Weblogs Yoda Leah Obi 8254 Han Obi Yoda C3PO Jabba C3PO Obi Leah Lando Learning from Trails Identity algorithms to learn where a person has been by the trail left behind eg, IP addresses left behind while visiting websites [Malin & Sweeney, 4], [Malin 2] IP IP IP 2 IP 3 IP Websites Share Consumer Lists Yoda Leah Obi Han Obi Yoda C3PO Jabba C3PO Obi Leah Lando Yoda Leah Obi Han Obi Yoda C3PO Jabba C3PO Obi Leah Lando 7

8 Identity REIDIT-I Example Example of what was learned: (known by name) visited Amazon even though he never bought anything at Amazon IP IP IP 2 IP 3 IP 4 Reidentified IP2 IP IP 4 IP 3 Protection Models Jcd Jwq Jxy Dan Don Dave Ann Abe Al Subjects Population Universe Ann /2/6 239 cardiac Abe 7/4/6 239 cancer Al 3/8/6 238 liver Private Information Jcd Jwq Jxy Null-Map Al 3/8/6 238 cardiac Ann /2/6 239 cancer Abe 7/4/6 239 liver Wrong-Map A* 96 23* cardiac A* 96 23* cancer A* 96 23* liver k-anonymity cardiac cancer liver Overview Idea of k-map and k-anonymity [Sweeney 97, 98] General Idea of Data Privacy Data Analysis in Personal Information Learning Demographic Data Genetic Data Data Protection Formal Models Video Data For every record released, there will be at least k individuals to whom the record indistinctly refers In k-map, the k individuals exist in the world In k-anonymity, the k individuals appear in the release 8

9 Model Examples Distributions of a Population Register k-map: For each tuple t in the release, t must indistinctly refer to at least k entities in the population A* * cardiac A* 96 23* cancer A* * liver Gil Hal Jim There are three colors with frequencies: red, 3 green and 2 blue There are 2 types of figures, with 2 of one type and 4 of the other k-anonymity: k in the release A* 96 23* cardiac A* 96 23* cancer A* 96 23* liver Ken Len Mel Register The combination of color and figure labeled as Hal and Len are each unique k-anonymity, enforce on release Quasi-identifier, profile {Birth, ZIP, Gender} Generalization /27/ Suppression 239 Encryption Re-identification Example Gil Hal Jim Ken Len Mel Register Release There are 3 green figures and 2 figures having the same profile as the release But only Hal is green and has the same figure type as the profile in the release It is a unique match 9

10 Re-identification Example Overview Gil Hal Jim Ken Len Mel Register Release There are two matches for this profile, Jim and Mel There is no unique match General Idea of Data Privacy Data Analysis in Personal Information Learning Demographic Data Genetic Data Data Protection Formal Models Video Data Formal Protection Example Gil Hal Jim Ken Len Mel Register + = Release To achieve k-map where k=2, agents for Gil, Hal and Ken agree to merge their information together Information released about any of them results in the same merged image Video Data Privacy Modify video images so that Privacy: automated attempts to recognize faces fail Utility: knowledge learned from data is useful Solution to problem Enables sharing of data for specified purposes Protects rights as specified in policy eg your identity won t be revealed unless you have done something illegal

11 De-identification of Faces Face Recognition: The Big Idea Example Captured images are below Here is a known image of Bob Which person is Bob? Identification Algorithm* Name of Person Identity Unknown? Face Recognition Software: ~7% % of Samples Where Correct Match Found All Rank Data Privacy: Foe, then Friend 24 Bradley Malin PCA-Based Face Recognition Systems Limiting the success of Module 2 is our goal

12 Basic Approach in Eigenfaces Use a training set to identify a set of characteristic faces 2 Given a gallery of known faces and a probe image of an unknown person, compare each face to the characteristic faces to get a distance measure for each Eigenvectors The characteristic function: (A-λI) = 3 The probe s identity is determined by the shortest distance to a gallery image 4 There is one image per person in the gallery and one corresponding picture per person in the probe set where A is the covariance matrix C Module 2: Eigenfaces / PCA Training Set Gallery Probe Face Space of Average Face Projected Gallery Distance Measure Projected Probe De-identification: T-mask Example continued Captured images are deidentified below Here is a known image of Bob Which person is Bob? 2

13 De-identification: T-mask Example continued Captured images are deidentified below Here is a known image of Bob Which person is Bob? De-identification: pixel reduction Example continued Captured images are deidentified below Here is a known image of Bob Which person is Bob? Automated Recognition Fails! % of Samples Where Correct Match Found De-identification: pixel reduction Example continued Captured images are deidentified below Here is a known image of Bob Which person is Bob? All Rank 3

14 Face recognition Works, Humans Don t! % of Samples Where Correct Match Found All Rank Some Experiments Single Bar Mask T-Mask Black Blob Mouth Only Grayscale Black & White Ordinal Data Threshold Pixelation Negative Grayscale Black & White Random Grayscale Black & White Mr Potato Head Pixelation: Automated Recognition Easier! Ad Hoc Methods = Poor Protection % of Samples Where Correct Match Found All Rank % of Samples Where Correct Match Found Percent Identifie All Black Test 4

15 % of Samples Where Correct Match Found Uh Oh, Not Looking Good T = 65 T = 5 Don t be Naïve Again, de-identified anonymous Masks can be removed and trained against Some cases naïve de-identification even harms privacy! pixelation and blur improves performance Time to get logical Threshold Level % of Samples Where Correct Match Found Random Changes to Grayscale Images Percent Correctly Identified Original Gray Scale/Rand Experiment: ID rate v Number of Pixels Changed Identification Rate for Randomly Changed set in Gallery Randomly v Originals changed gallery Identification Rate for Originals v Randomly Changed Randomly changed probe set in Probe Number of Values Changed Number of Pixels Changed (R) R = 3 R = 9 Back to k-protection Models [Newton, Sweeney, Malin 4,5] k-anonymity: For every record, there are at least k individuals to whom it refers (realized upon release) k-same: For every face, there are at least k people to whom that face refers No face actually refers to a single real person 5

16 Ranking of Faces Example How does everyone rank against each other? Who is closest? Who is farthest? Examples of k-same -Pixel -Eigen k = Example of k-same for k=2 Demonstration Time! K-Same Demo 6

17 Performance of k-same Algorithms Thanks! % of Samples Where Correct Match Found Percent Correct, Top Rank Expected[k-Same] k-same-pixel k-same-eigen k Rank Upper-bound on Recognition Performance = k Some slides adapted from: Elaine Newton Michael Shamos Latanya Sweeney More information: Overview General Idea of Data Privacy Data Analysis in Personal Information Learning Demographic Data Genetic Data Data Protection Formal Models Video Data 7