Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/SRDS.2006.25 | SRDS |
Keywords | Field | DocType |
basic operator,sensitive data,approximate solution,good longevity,optimization problem,good privacy,sensitive database,database management systems,software metrics,data privacy,distributed systems | Computer science,Longevity,Theoretical computer science,Safeguard,Operator (computer programming),Software metric,Information privacy,Approximate solution,Optimization problem,Privacy software,Distributed computing | Conference |
ISSN | ISBN | Citations |
1060-9857 | 0-7695-2677-2 | 5 |
PageRank | References | Authors |
0.65 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bob Mungamuru | 1 | 12 | 2.25 |
| Héctor García-Molina | 2 | 24359 | 5652.13 |
| Subhasish Mitra | 3 | 3657 | 228.90 |