Mungamuru, Bob and Garcia-Molina, Hector and Subhasish, Mitra (2006) How To Safeguard Your Sensitive Data. In: 25th IEEE Symposium on Reliable Distributed Systems (SRDS 2006), October 2-4, 2006, Leeds, UK.
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.
|Item Type:||Conference or Workshop Item (Paper)|
|Subjects:||Computer Science > Distributed Systems|
|Related URLs:||Project Homepage||http://crypto.stanford.edu/portia/|
|Deposited By:||Import Account|
|Deposited On:||11 May 2008 17:00|
|Last Modified:||19 Dec 2008 10:19|
Repository Staff Only: item control page