SMCQL: Secure querying for federated databases

Johes Bater, Satyender Goel, Gregory Elliott, Abel Kho, Craig Eggen, Jennie Rogers

Research output: Research - peer-reviewArticle

  • 1 Citations

Abstract

People and machines are collecting data at an unprecedented rate. Despite this newfound abundance of data, progress has been slow in sharing it for open science, business, and other data-intensive endeavors. Many such efforts are stymied by privacy concerns and regulatory compliance issues. For example, many hospitals are interested in pooling their medical records for research, but none may disclose arbitrary patient records to researchers or other healthcare providers. In this context we propose the Private Data Network (PDN), a federated database for querying over the collective data of mutually distrustful parties. In a PDN, each member database does not reveal its tuples to its peers nor to the query writer. Instead, the user submits a query to an honest broker that plans and coordinates its execution over multiple private databases using secure multiparty computation (SMC). Here, each database's query execution is oblivious, and its program counters and memory traces are agnostic to the inputs of others. We introduce a framework for executing PDN queries named SMCQL. This system translates SQL statements into SMC primitives to compute query results over the union of its source databases without revealing sensitive information about individual tuples to peer data providers or the honest broker. Only the honest broker and the querier receive the results of a PDN query. For fast, secure query evaluation, we explore a heuristics-driven optimizer that minimizes the PDN's use of secure computation and partitions its query evaluation into scalable slices.

LanguageEnglish (US)
Pages673-684
Number of pages12
JournalProceedings of the VLDB Endowment
Volume10
Issue number6
StatePublished - 2016

Fingerprint

Data storage equipment
Industry

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computer Science(all)

Cite this

Bater, J., Goel, S., Elliott, G., Kho, A., Eggen, C., & Rogers, J. (2016). SMCQL: Secure querying for federated databases. Proceedings of the VLDB Endowment, 10(6), 673-684.

SMCQL : Secure querying for federated databases. / Bater, Johes; Goel, Satyender; Elliott, Gregory; Kho, Abel; Eggen, Craig; Rogers, Jennie.

In: Proceedings of the VLDB Endowment, Vol. 10, No. 6, 2016, p. 673-684.

Research output: Research - peer-reviewArticle

Bater, J, Goel, S, Elliott, G, Kho, A, Eggen, C & Rogers, J 2016, 'SMCQL: Secure querying for federated databases' Proceedings of the VLDB Endowment, vol 10, no. 6, pp. 673-684.
Bater, Johes ; Goel, Satyender ; Elliott, Gregory ; Kho, Abel ; Eggen, Craig ; Rogers, Jennie. / SMCQL : Secure querying for federated databases. In: Proceedings of the VLDB Endowment. 2016 ; Vol. 10, No. 6. pp. 673-684
@article{914e397ea07149b59a00b357f73b9374,
title = "SMCQL: Secure querying for federated databases",
abstract = "People and machines are collecting data at an unprecedented rate. Despite this newfound abundance of data, progress has been slow in sharing it for open science, business, and other data-intensive endeavors. Many such efforts are stymied by privacy concerns and regulatory compliance issues. For example, many hospitals are interested in pooling their medical records for research, but none may disclose arbitrary patient records to researchers or other healthcare providers. In this context we propose the Private Data Network (PDN), a federated database for querying over the collective data of mutually distrustful parties. In a PDN, each member database does not reveal its tuples to its peers nor to the query writer. Instead, the user submits a query to an honest broker that plans and coordinates its execution over multiple private databases using secure multiparty computation (SMC). Here, each database's query execution is oblivious, and its program counters and memory traces are agnostic to the inputs of others. We introduce a framework for executing PDN queries named SMCQL. This system translates SQL statements into SMC primitives to compute query results over the union of its source databases without revealing sensitive information about individual tuples to peer data providers or the honest broker. Only the honest broker and the querier receive the results of a PDN query. For fast, secure query evaluation, we explore a heuristics-driven optimizer that minimizes the PDN's use of secure computation and partitions its query evaluation into scalable slices.",
author = "Johes Bater and Satyender Goel and Gregory Elliott and Abel Kho and Craig Eggen and Jennie Rogers",
year = "2016",
volume = "10",
pages = "673--684",
journal = "Proceedings of the VLDB Endowment",
issn = "2150-8097",
publisher = "Very Large Data Base Endowment Inc.",
number = "6",

}

TY - JOUR

T1 - SMCQL

T2 - Proceedings of the VLDB Endowment

AU - Bater,Johes

AU - Goel,Satyender

AU - Elliott,Gregory

AU - Kho,Abel

AU - Eggen,Craig

AU - Rogers,Jennie

PY - 2016

Y1 - 2016

N2 - People and machines are collecting data at an unprecedented rate. Despite this newfound abundance of data, progress has been slow in sharing it for open science, business, and other data-intensive endeavors. Many such efforts are stymied by privacy concerns and regulatory compliance issues. For example, many hospitals are interested in pooling their medical records for research, but none may disclose arbitrary patient records to researchers or other healthcare providers. In this context we propose the Private Data Network (PDN), a federated database for querying over the collective data of mutually distrustful parties. In a PDN, each member database does not reveal its tuples to its peers nor to the query writer. Instead, the user submits a query to an honest broker that plans and coordinates its execution over multiple private databases using secure multiparty computation (SMC). Here, each database's query execution is oblivious, and its program counters and memory traces are agnostic to the inputs of others. We introduce a framework for executing PDN queries named SMCQL. This system translates SQL statements into SMC primitives to compute query results over the union of its source databases without revealing sensitive information about individual tuples to peer data providers or the honest broker. Only the honest broker and the querier receive the results of a PDN query. For fast, secure query evaluation, we explore a heuristics-driven optimizer that minimizes the PDN's use of secure computation and partitions its query evaluation into scalable slices.

AB - People and machines are collecting data at an unprecedented rate. Despite this newfound abundance of data, progress has been slow in sharing it for open science, business, and other data-intensive endeavors. Many such efforts are stymied by privacy concerns and regulatory compliance issues. For example, many hospitals are interested in pooling their medical records for research, but none may disclose arbitrary patient records to researchers or other healthcare providers. In this context we propose the Private Data Network (PDN), a federated database for querying over the collective data of mutually distrustful parties. In a PDN, each member database does not reveal its tuples to its peers nor to the query writer. Instead, the user submits a query to an honest broker that plans and coordinates its execution over multiple private databases using secure multiparty computation (SMC). Here, each database's query execution is oblivious, and its program counters and memory traces are agnostic to the inputs of others. We introduce a framework for executing PDN queries named SMCQL. This system translates SQL statements into SMC primitives to compute query results over the union of its source databases without revealing sensitive information about individual tuples to peer data providers or the honest broker. Only the honest broker and the querier receive the results of a PDN query. For fast, secure query evaluation, we explore a heuristics-driven optimizer that minimizes the PDN's use of secure computation and partitions its query evaluation into scalable slices.

UR - http://www.scopus.com/inward/record.url?scp=85020383211&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85020383211&partnerID=8YFLogxK

M3 - Article

VL - 10

SP - 673

EP - 684

JO - Proceedings of the VLDB Endowment

JF - Proceedings of the VLDB Endowment

SN - 2150-8097

IS - 6

ER -