Zahra Jafargholi

dblp:120/4042 · DBLP profile ↗
← Back
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
YearPublicationVenuePosition
2021 Optimal Oblivious Priority Queues
abstract
In 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
SODA1
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
Algorithmica1
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