DocumentCode
2932920
Title
How To Safeguard Your Sensitive Data
Author
Mungamuru, Bob ; Garcia-Molina, Hector ; Mitra, Subhasish
Author_Institution
Dept. of Comput. Sci., Stanford Univ., CA
fYear
2006
fDate
2-4 Oct. 2006
Firstpage
199
Lastpage
211
Abstract
In order to safeguard a sensitive database, we must ensure both its privacy and its longevity. However, privacy and longevity tend to be competing objectives. We show how to design a system that provides both good privacy and good longevity simultaneously. Systems are modelled as compositions of two basic operators, copy and split. We propose metrics with which to evaluate the privacy, longevity and performance offered by such systems. The search for the "best" system under these metrics is then formulated as a constrained optimization problem. Solving the optimization problem exactly turns out to be intractable, so we propose techniques for efficiently finding an approximate solution
Keywords
data privacy; database management systems; optimisation; software metrics; constrained optimization problem; copy operator; data privacy; sensitive database; split operator; Computer science; Constraint optimization; Credit cards; Cryptography; Data privacy; Databases; Error analysis; Fault tolerance; Hospitals; Protection;
fLanguage
English
Publisher
ieee
Conference_Titel
Reliable Distributed Systems, 2006. SRDS '06. 25th IEEE Symposium on
Conference_Location
Leeds
ISSN
1060-9857
Print_ISBN
0-7695-2677-2
Type
conf
DOI
10.1109/SRDS.2006.25
Filename
4032482
Link To Document