ACM Home Page
Please provide us with feedback. Feedback
Probabilistic privacy analysis of published views
Full text PdfPdf (444 KB)
Source Workshop On Privacy In The Electronic Society archive
Proceedings of the 5th ACM workshop on Privacy in electronic society table of contents
Alexandria, Virginia, USA
SESSION: Short papers table of contents
Pages: 81 - 84  
Year of Publication: 2006
ISBN:1-59593-556-8
Authors
Hui Wang  University of British Columbia, Vancouver, Canada
Laks V.S. Lakshmanan  University of British Columbia, Vancouver, Canada
Sponsors
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 22,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1179601.1179616
What is a DOI?

ABSTRACT

Among techniques for ensuring privacy in data publishing, k-anonymity and publishing of views on private data are quite popular. In this paper, we consider data publishing by views and develop a probability framework for the analysis of privacy breach. We propose two attack models and derive the probability of privacy breach for each model.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Alin Deutsch, Yannis Papakonstantinou, "Privacy in Database Publishing", ICDT'05.
3
 
4
Kristen LeFevre, David DeWitt, and Raghu Ramakrishnan, "Mondrian Multidimensional K-Anonymity", ICDE'05.
 
5
6
7
8
 
9
 
10
Claude Elwood Shannon, "Communication theory of secrecy systems", Bell System Technical Journal, 1949.
11
 
12

Collaborative Colleagues:
Hui Wang: colleagues
Laks V.S. Lakshmanan: colleagues