Distributing Data for Secure Database Services

Authors:
Vignesh Ganapathy;Dilys Thomas;Tomas Feder;Hector Garcia-Molina;Rajeev Motwani
Affiliations:
Stanford University/ TRDDC Pune/ Google. e-mail: vignesh@google.com;Stanford University/ TRDDC Pune/ Google. e-mail: dilys@cs.stanford.edu;Stanford University/ TRDDC Pune/ Google. e-mail: tomas@theory.stanford.edu;Stanford University/ TRDDC Pune/ Google. e-mail: hector@cs.stanford.edu;Stanford University/ TRDDC Pune/ Google. e-mail: rajeev@cs.stanford.edu
Venue:
Transactions on Data Privacy
Year:
2012

Citing 15
Cited 2

Some optimal inapproximability results

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Principles of distributed database systems (2nd ed.)

Principles of distributed database systems (2nd ed.)
Executing SQL over encrypted data in the database-service-provider model

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications

SIAM Journal on Computing
Improved results for directed multicut

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Providing Database as a Service

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Random sampling and approximation of MAX-CSPs

Journal of Computer and System Sciences - STOC 2002
Order preserving encryption for numeric data

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fully homomorphic encryption using ideal lattices

Proceedings of the forty-first annual ACM symposium on Theory of computing
Anonymizing tables

ICDT'05 Proceedings of the 10th international conference on Database Theory
Security issues in querying encrypted data

DBSec'05 Proceedings of the 19th annual IFIP WG 11.3 working conference on Data and Applications Security
Blind custodians: a database service architecture that supports privacy without encryption

DBSec'05 Proceedings of the 19th annual IFIP WG 11.3 working conference on Data and Applications Security
Evaluating 2-DNF formulas on ciphertexts

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Fragmentation and encryption to enforce privacy in data storage

ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security

Database fragmentation with encryption: under which semantic constraints and a priori knowledge can two keep a secret?

DBSec'13 Proceedings of the 27th international conference on Data and Applications Security and Privacy XXVII
Dividing secrets to secure data outsourcing

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The advent of database services has resulted in privacy concerns on the part of the client storing data with third party database service providers. Previous approaches to enabling such a service have been based on data encryption, causing a large overhead in query processing. A distributed architecture for secure database services is proposed as a solution to this problem where data is stored at multiple servers. The distributed architecture provides both privacy as well as fault tolerance to the client. In this paper we provide algorithms for (1) distributing data: our results include hardness of approximation results and hence a heuristic greedy algorithm for the distribution problem (2) partitioning the query at the client to queries for the servers implemented by a bottom up state based algorithm. Finally the results at the servers are integrated to obtain the answer at the client. We provide an experimental validation and performance study of our algorithms.