Epsolute: Efficiently Querying Databases While Providing Differential Privacy

被引:8
作者
Bogatov, Dmytro [1 ]
Kellaris, Georgios
Kollios, George [1 ]
Nissim, Kobbi [2 ]
O'Neill, Adam [3 ]
机构
[1] Boston Univ, Boston, MA 02215 USA
[2] Georgetown Univ, Washington, DC USA
[3] Univ Massachusetts, Amherst, MA 01003 USA
来源
CCS '21: PROCEEDINGS OF THE 2021 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY | 2021年
基金
美国国家科学基金会;
关键词
Differential Privacy; ORAM; differential obliviousness; sanitizers;
D O I
10.1145/3460120.3484786
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
As organizations struggle with processing vast amounts of information, outsourcing sensitive data to third parties becomes a necessity. To protect the data, various cryptographic techniques are used in outsourced database systems to ensure data privacy, while allowing efficient querying. A rich collection of attacks on such systems has emerged. Even with strong cryptography, just communication volume or access pattern is enough for an adversary to succeed. In this work we present a model for differentially private outsourced database system and a concrete construction, 8psolute, that provably conceals the aforementioned leakages, while remaining efficient and scalable. In our solution, differential privacy is preserved at the record level even against an untrusted server that controls data and queries. 8psolute combines Oblivious RAM and differentially private sanitizers to create a generic and efficient construction. We go further and present a set of improvements to bring the solution to efficiency and practicality necessary for real-world adoption. We describe the way to parallelize the operations, minimize the amount of noise, and reduce the number of network requests, while preserving the privacy guarantees. We have run an extensive set of experiments, dozens of servers processing up to 10 million records, and compiled a detailed result analysis proving the efficiency and scalability of our solution. While providing strong security and privacy guarantees we are less than an order of magnitude slower than range query execution of a non-secure plain-text optimized RDBMS like MySQL and PostgreSQL.
引用
收藏
页码:2262 / 2276
页数:15
相关论文
共 75 条
[1]  
[Anonymous], 2014, P 4 ACM C DAT APPL S, DOI DOI 10.1145/2557547.2557561
[2]  
[Anonymous], 2011, INT C THEOR APPL CRY, DOI DOI 10.1007/978-3-642-25385-0_11
[3]  
Arasu A., 2013, P 2013 ACM SIGMOD IN, P1033
[4]  
Arasu Arvind, 2013, CIDR
[5]   TrustedDB: A Trusted Hardware-Based Database with Privacy and Data Confidentiality [J].
Bajaj, Sumeet ;
Sion, Radu .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2014, 26 (03) :752-765
[6]   Shrinkwrap: Efficient SQL Query Processing in Differentially Private Data Federations [J].
Bater, Johes ;
He, Xi ;
Ehrich, William ;
Machanavajjhala, Ashwin ;
Rogers, Jennie .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2018, 12 (03) :307-320
[7]   SMCQL: Secure Querying for Federated Databases [J].
Bater, Johes ;
Elliott, Gregory ;
Eggen, Craig ;
Goel, Satyender ;
Kho, Abel ;
Rogers, Jennie .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2017, 10 (06) :673-684
[8]  
Beimel Amos, 2013, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Algorithms and Techniques. 16th International Workshop, APPROX 2013 and 17th International Workshop, RANDOM 2013. Proceedings: LNCS 8096, P363, DOI 10.1007/978-3-642-40328-6_26
[9]   Bounds on the sample complexity for private learning and private data release [J].
Beimel, Amos ;
Brenner, Hai ;
Kasiviswanathan, Shiva Prasad ;
Nissim, Kobbi .
MACHINE LEARNING, 2014, 94 (03) :401-437
[10]  
Beimel Amos, 2019, APPROXIMATION RANDOM, V65