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

Elizabeth Margolin

dblp:358/2337 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0003-9066-9380ORCID · corroborated

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

Security and privacy · 2 · 2 since 2021Software 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
3 papers
Privacy and data protection · 53% Cryptographic protocols and secure computation · 47%
Theoretical computer science
2 papers
Automata and formal languages · 57% Algorithms and data structures · 43%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
1.822026
Coral: Fast Succinct Non-Interactive Zero-Knowledge CFG Proofs · SP 2026
Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex Proofs · USENIX Security Symposium 2024
Privacy and data protection
differential privacy
0.712023
Arboretum: A Planner for Large-Scale Federated Analytics with Differential Privacy · SOSP 2023
Privacy and data protection › privacy-preserving data analysis
federated analytics
0.712023
Arboretum: A Planner for Large-Scale Federated Analytics with Differential Privacy · SOSP 2023
Privacy and data protection
privacy-preserving data analysis
0.712023
Arboretum: A Planner for Large-Scale Federated Analytics with Differential Privacy · SOSP 2023
Automata and formal languages › formal grammars
context-free grammar
0.312026
Coral: Fast Succinct Non-Interactive Zero-Knowledge CFG Proofs · SP 2026
Algorithms and data structures › sequence algorithms › string algorithms › string matching
regular expression matching
0.212024
Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex Proofs · USENIX Security Symposium 2024
Distributed systems › distributed database
distributed query processing
0.212023
Arboretum: A Planner for Large-Scale Federated Analytics with Differential Privacy · SOSP 2023

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

succinct proofs · 1.5regex verification · 1.5query planning · 1.3differential privacy · 1.3cryptographic primitives · 1.3
YearPublicationVenuePosition
2026 Coral: Fast Succinct Non-Interactive Zero-Knowledge CFG Proofs
Sebastian Angel, Sofía Celi, Elizabeth Margolin, Pratyush Mishra 0001, Martin Sander, Jess Woods
SP3
2024 Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex Proofs
Sebastian Angel, Eleftherios Ioannidis, Elizabeth Margolin, Srinath Setty, Jess Woods
USENIX Security Symposium3
2023 Arboretum: A Planner for Large-Scale Federated Analytics with Differential Privacy
abstract
Federated analytics is a way to answer queries over sensitive data that is spread across multiple parties, without sharing the data or collecting it in a single place. Prior work has developed solutions that can scale to large deployments with millions of devices but, due to the distributed nature of federated analytics, these solutions can support only a limited class of queries - typically various forms of numerical queries, which can be answered with lightweight cryptographic primitives. Supporting richer queries, such as categorical queries, requires heavier cryptography, whose cost can quickly exceed even the resources of a powerful data center.
Elizabeth Margolin, Karan Newatia, Edo Roth, Andreas Haeberlen
SOSP1