Demo Data from EDBT 2026 / reviewers in the wild / expert
Eli Baum
dblp:376/0257
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0003-7311-1705ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021
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.
| Network and information security
1 paper |
Cryptographic protocols and secure computation · 77% Privacy and data protection · 23% | |
| Databases, data mining, and information retrieval
1 paper |
Query processing and optimization · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization
secure query processing |
0.9 | 1 | 2025 | ORQ: Complex Analytics on Private Data with Strong Security Guarantees · SOSP 2025 |
Cryptographic protocols and secure computation
secure multiparty computation |
0.9 | 1 | 2025 | ORQ: Complex Analytics on Private Data with Strong Security Guarantees · SOSP 2025 |
Methods — techniques the papers use, named apart from their topics
vectorized query engine · 1.7oblivious operators · 1.7multiparty computation · 0.9multi-party computation · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | ORQ: Complex Analytics on Private Data with Strong Security GuaranteesabstractWe present Orq, a system that enables collaborative analysis of large private datasets using cryptographically secure multi-party computation (MPC). Orq protects data against semi-honest or malicious parties and can efficiently evaluate relational queries with multi-way joins and aggregations that have been considered notoriously expensive under MPC. To do so, Orq eliminates the quadratic cost of secure joins by leveraging the fact that, in practice, the structure of many real queries allows us to join records and apply the aggregations "on the fly" while keeping the result size bounded. On the system side, Orq contributes generic oblivious operators, a data-parallel vectorized query engine, a communication layer that amortizes MPC network costs, and a dataflow API for expressing relational analytics—all built from the ground up. Eli Baum, Sam Buxbaum, Nitin Mathai, Muhammad Faisal 0001, Vasiliki Kalavri, Mayank Varia, John Liagouris |
SOSP | 1 |