1 dr. xiao qin auburn university xqin [email protected] spring, 2011 comp 7370 advanced computer and...
Post on 19-Dec-2015
214 views
TRANSCRIPT
![Page 1: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/1.jpg)
1
Dr. Xiao Qin
Auburn Universityhttp://www.eng.auburn.edu/~xqin
Spring, 2011
COMP 7370 Advanced Computer and Network Security
The VectorCover Algorithm (2)
![Page 2: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/2.jpg)
2
Minimal Distance Vectors
![Page 3: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/3.jpg)
3
The Outlier Set and All Set
• Outliers: Tuples which have less than k occurrences
• All: a set of distinct tuples in a table
![Page 4: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/4.jpg)
4
Pair – (strategy, tuples)
• New data structure
• Represents a transformation strategy
• Represents a set of tuples after applying such a transformation.
• Strategy = Distrance Vectors
![Page 5: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/5.jpg)
5
Distance between Two Tuples
![Page 6: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/6.jpg)
6
The VectorCover Algorithm
![Page 7: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/7.jpg)
7
Dr. Xiao Qin
Auburn Universityhttp://www.eng.auburn.edu/~xqin
Spring, 2011
COMP 7370 Advanced Computer and Network Security
The MinGen Algorithm
![Page 8: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/8.jpg)
8
![Page 9: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/9.jpg)
9
Step 1: PT vs. PT[QI]
vs.
![Page 10: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/10.jpg)
10
Step 2: history <- [d_1, … d_n]
n =2
E_0 -> d_1 = 0
Z_0 -> d_2 = 0
E_1 -> d_1 = ?
Z_2 -> d_2 = ?
E_1 -> d_1 = 1
Z_2 -> d_2 = 2
Use subscripts to represent generalization strategies.
![Page 11: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/11.jpg)
11
Step 2: history <- [d_1, … d_n]Note: E_i and Z_j must be specific when you implement the MinGen algorithm.
You must specify your generalization strategies. For example:
![Page 12: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/12.jpg)
12
Step 2: E_i, Z_j
n =2
E_0 -> d_1 = 0
Z_0 -> d_2 = 0
E_1 -> d_1 = ?
Z_2 -> d_2 = ?
E_1 -> d_1 = 1
Z_2 -> d_2 = 2
![Page 13: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/13.jpg)
13
Step 3: Check single attributes• Each single attribute must satisfy k-anonymity
E -> MGT[E]
v = a -> freq(a, MGT[E]) = ?
If 4 < k then what does this mean?
What should we do?
4
![Page 14: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/14.jpg)
14
Step 3.1: Check single attributes• Each single attribute must satisfy k-anonymity
If 4 < k then we need data generalization!
V_E = [d_E, d_Z] = [1, 0] not [0, 1]
Note: move one step at a time.
![Page 15: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/15.jpg)
15
Step 3.2: the generalize() function• Each single attribute must satisfy k-anonymity
E -> MGT[E]
Value v = a -> freq(a, MGT[E]) = ?
If 4 < k then what does this mean?
V_E = [d_E, d_Z] = [1, 0]
MGT <- generalize(MGT, V_E, [0,0])
4
![Page 16: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/16.jpg)
16
Step 3.2: the generalize() function• Each single attribute must satisfy k-anonymity
MGT <- generalize(MGT, v, h)
Generalize() transform MGT based on a generalization strategy specified by v, h.
![Page 17: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/17.jpg)
17
Step 3.3: update the history vector• Each single attribute must satisfy k-anonymity
Can you give me an example to illustrate how step 3.3 works?
History [d_E, d_Z] = [0, 0]
V_E = [1, 0]
New History [0, 0] + [1, 0] = [1, 0]
![Page 18: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/18.jpg)
Step 6.2
18
![Page 19: 1 Dr. Xiao Qin Auburn University xqin xqin@auburn.edu Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover](https://reader035.vdocuments.us/reader035/viewer/2022062714/56649d385503460f94a10c8a/html5/thumbnails/19.jpg)
Step 6.3
19