Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Craig Eggen

dblp:182/2033 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 56% Distributed and cloud data management · 44%
Network and information security
1 paper
Cryptographic protocols and secure computation · 50% Privacy and data protection · 50%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed and cloud data management › federated database
federated query processing
0.312017
SMCQL: Secure Query Processing for Private Data Networks · Proc. VLDB Endow. 2017
Query processing and optimization
secure query processing
0.312017
SMCQL: Secure Query Processing for Private Data Networks · Proc. VLDB Endow. 2017
Privacy and data protection › privacy-preserving query processing
oblivious query processing
0.312017
SMCQL: Secure Query Processing for Private Data Networks · Proc. VLDB Endow. 2017
Cryptographic protocols and secure computation
secure multiparty computation
0.312017
SMCQL: Secure Query Processing for Private Data Networks · Proc. VLDB Endow. 2017
Query processing and optimization
query optimization
0.112017
SMCQL: Secure Query Processing for Private Data Networks · Proc. VLDB Endow. 2017

Methods — techniques the papers use, named apart from their topics

secure multiparty computation · 0.6heuristic-driven optimization · 0.6
YearPublicationVenuePosition
2017 SMCQL: Secure Query Processing for Private Data Networks
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.
Johes Bater, Gregory Elliott, Craig Eggen, Satyender Goel, Abel N. Kho, Jennie Rogers
Proc. VLDB Endow.3