Fatima Elsheimy
Fatima Elsheimy

I am a PhD candidate in Computer Science at Yale University and a member of the Yale Applied Cryptography Laboratory. I began my PhD in 2022 under the supervision of Prof. Charalampos Papamanthou and also work closely with Julian Loss.

My research focuses on distributed systems, multiparty computation, and blockchain protocols.

Accepted and published papers are listed first. See also the full publication page and Google Scholar.

Accepted / published
2027

BumbleBee: Best-of-Both-Worlds MVBA with Optimal Communication, Latency and Resilience Tradeoffs

F. Elsheimy, S. H. Kamp

S&P 2027

2026

Optimal Best-of-Both-Worlds Consensus

F. Elsheimy, S. H. Kamp, J. Loss, J. B. Nielsen

CRYPTO 2026

2026

Brief Announcement: BumbleBee: Best-of-Both-Worlds MVBA with Optimal Communication, Latency and Resilience Tradeoffs

F. Elsheimy, S. H. Kamp

PODC 2026

2026

Censorship Resistance and Throughput with Multiple Concurrent Proposers

A. Saraf, G. Kaklamanis, S. Wadhwa, F. Elsheimy

AFT 2026

2026

Censorship Resistance vs Throughput in Multi-Proposer BFT Protocols

F. Elsheimy, I. Kaklamanis, S. Wadhwa, C. Papamanthou, F. Zhang

CCS 2026

2026

Fast and Efficient Perfectly Secure Network-Agnostic Secure Computation

G. Asharov, F. Elsheimy, G. Stern

EUROCRYPT 2026

2026

AegisBFT: Fast, Responsive, ForkResistant Consensus with Speculation Accountability

M. M. Jalalzai, K. Babel, J. Jovan, T. Klenze, S. Das, F. Elsheimy, M. Setrin, J. Bergschneider, B. P. Gilkalaye

DISC 2026

2024

Early Stopping Byzantine Agreement in \((1+\epsilon)\cdot f\) Rounds

F. Elsheimy, J. Loss, C. Papamanthou

ASIACRYPT 2024

2024

Deterministic Byzantine Agreement with Adaptive \(O(n \cdot f)\) Communication

F. Elsheimy, G. Tsimos, C. Papamanthou

SODA 2024

2023

SoK: Data Sovereignty

J. Ernstberger, J. Lauinger, F. Elsheimy, L. Zhou, S. Steinhorst, R. Canetti, et al.

EuroS&P 2023

Preprints & Papers Under Submission
2026

SCALE-IT: Perfect MPC with Constant Overhead

G. Asharov, A. Chandramouli, F. Elsheimy, G. Stern

Under submission

2026

Cadence: Extreme Pipelining with Multiple Concurrent Proposers

K. Babel, F. Elsheimy, L. Heimbach, M. M. Jalalzai, T. Klenze, et al.

arXiv:2607.02275

2026

Early Stopping is Cheap

F. Elsheimy, J. Loss, S. H. Kamp

Cryptology ePrint Archive

2025

MonadBFT: Fast, Responsive, Fork-Resistant Streamlined Consensus

M. M. Jalalzai, K. Babel, J. Komatovic, T. Klenze, S. Das, F. Elsheimy, M. Setrin, et al.

arXiv:2502.20692

2025

Towards Optimal Early Stopping Agreement Protocols

F. Elsheimy, J. Loss, C. Papamanthou

Cryptology ePrint Archive

Mysten Labs

Research Intern · New York

Worked with Lefteris and Alberto Sonnino on new consensus protocols.

May–Aug 2026

Category Labs

Research Intern · New York

Worked with Mussadiq Jalalzai and Kushal Babel on MonadBFT and was one of the main authors of Cadence, Monad's next-generation consensus protocol.

Jun 2025–May 2026

CISPA Helmholtz Center for Information Security

Visiting Researcher · Saarbrücken, Germany

Worked with Julian Loss on efficient consensus protocols.

Jan–Apr 2024

UC Berkeley

Visiting Researcher · Berkeley, CA

Worked with Dawn Song on data sovereignty and Web3.

Jun 2020–Aug 2022

Xerox Corporation

Embedded Software Engineer · Rochester, NY

Developed and tested embedded software and hardware-facing interfaces.

Jun 2019–Aug 2020

Optimal Best-of-Both-Worlds Consensus

Summer School on Blockchain Consensus · Columbia University
May 2026

Censorship Resistance vs Throughput in Multi-Proposer BFT Protocols

Invited Talk · IC3 2026
2026

Selected honors

  • Ethereum Research Grant, $42,000, joint with Fan Zhang (2025)
  • Valedictorian Award, Rochester Institute of Technology (2019)
  • Outstanding Undergraduate Scholar Award, Rochester Institute of Technology (2019)

External reviewing

IEEE S&P, CCS, Financial Cryptography, EUROCRYPT, CRYPTO, and PODC.

The easiest way to reach me is by email. You can also find my work and academic profile through the links below.