EDBT 2026 Demo / reviewers in the wild / expert
Zahra Jafargholi
dblp:120/4042
· DBLP profile ↗
8ranked-venue papers
5as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 6 · 3 first-authorTheory of computation · 4 · 4 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
5 papers |
Cryptographic protocols and secure computation · 87% Privacy and data protection · 9% Cryptographic primitives and cryptanalysis · 4% | |
| Theoretical computer science
1 paper |
Computational complexity · 100% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › secure multiparty computation
adaptive security |
0.5 | 2 | 2017 | Be Adaptive, Avoid Overcommitting · CRYPTO (1) 2017 Adaptively Secure Garbled Circuits from One-Way Functions · CRYPTO (3) 2016 |
Cryptographic protocols and secure computation
oblivious data structures |
0.5 | 1 | 2021 | Optimal Oblivious Priority Queues · SODA 2021 |
Cryptographic protocols and secure computation › oblivious data structures
oblivious RAM |
0.5 | 1 | 2021 | Optimal Oblivious Priority Queues · SODA 2021 |
Cryptographic protocols and secure computation
garbled circuits |
0.2 | 1 | 2016 | Adaptively Secure Garbled Circuits from One-Way Functions · CRYPTO (3) 2016 |
Computational complexity › reduction
quasipolynomial-time reduction |
0.2 | 1 | 2015 | A Quasipolynomial Reduction for Generalized Selective Decryption on Trees · CRYPTO (1) 2015 |
Computational complexity
reduction |
0.2 | 1 | 2015 | A Quasipolynomial Reduction for Generalized Selective Decryption on Trees · CRYPTO (1) 2015 |
Privacy and data protection › differential privacy
privacy amplification |
0.2 | 1 | 2014 | Amplifying Privacy in Privacy Amplification · CRYPTO (2) 2014 |
Cryptographic primitives and cryptanalysis
one-way functions |
0.1 | 1 | 2016 | Adaptively Secure Garbled Circuits from One-Way Functions · CRYPTO (3) 2016 |
Methods — techniques the papers use, named apart from their topics
garbled circuits · 0.2randomness extraction · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Optimal Oblivious Priority QueuesabstractIn this work, we present the first asymptotically optimal oblivious priority queue, which matches the lower bound of Jacob, Larsen, and Nielsen (SODA'19). Our construction is conceptually simple and statistically secure. We illustrate the power of our optimal oblivious priority queue by presenting a conceptually equally simple construction of statistically secure offline ORAMs with O(log n) bandwidth overhead. Zahra Jafargholi, Kasper Green Larsen, Mark Simkin 0001 |
SODA | 1 |
| 2017 | Be Adaptive, Avoid Overcommitting
Zahra Jafargholi, Chethan Kamath, Karen Azari, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs |
CRYPTO (1) | 1 |
| 2017 | Adaptively Indistinguishable Garbled Circuits
Zahra Jafargholi, Alessandra Scafuro, Daniel Wichs |
TCC (2) | 1 |
| 2016 | Adaptively Secure Garbled Circuits from One-Way Functions
Brett Hemenway, Zahra Jafargholi, Rafail Ostrovsky, Alessandra Scafuro, Daniel Wichs |
CRYPTO (3) | 2 |
| 2016 | 3SUM, 3XOR, Triangles
Zahra Jafargholi, Emanuele Viola |
Algorithmica | 1 |
| 2015 | A Quasipolynomial Reduction for Generalized Selective Decryption on Trees
Georg Fuchsbauer, Zahra Jafargholi, Krzysztof Pietrzak |
CRYPTO (1) | 2 |
| 2015 | Tamper Detection and Continuous Non-malleable Codes
Zahra Jafargholi, Daniel Wichs |
TCC (1) | 1 |
| 2014 | Amplifying Privacy in Privacy Amplification
Divesh Aggarwal, Yevgeniy Dodis, Zahra Jafargholi, Eric Miles, Leonid Reyzin |
CRYPTO (2) | 3 |