Publications

Accepted and published papers are listed first. See also my Google Scholar profile.

Accepted / Published

  • F. Elsheimy, S. H. Kamp,
    “BumbleBee: Best-of-Both-Worlds MVBA with Optimal Communication, Latency and Resilience Tradeoffs.”
    IEEE Symposium on Security and Privacy (S&P 2027).

  • F. Elsheimy, S. H. Kamp, J. Loss, J. B. Nielsen,
    “Optimal Best-of-Both-Worlds Consensus.”
    CRYPTO 2026.

  • F. Elsheimy, S. H. Kamp,
    “Brief Announcement: BumbleBee: Best-of-Both-Worlds MVBA with Optimal Communication, Latency and Resilience Tradeoffs.”
    PODC 2026, pp. 212–215.

  • A. Saraf, G. Kaklamanis, S. Wadhwa, F. Elsheimy,
    “Censorship Resistance and Throughput with Multiple Concurrent Proposers.”
    AFT 2026.

  • F. Elsheimy, I. Kaklamanis, S. Wadhwa, C. Papamanthou, F. Zhang,
    “Censorship Resistance vs Throughput in Multi-Proposer BFT Protocols.”
    CCS 2026.

  • G. Asharov, F. Elsheimy, G. Stern,
    “Fast and Efficient Perfectly Secure Network-Agnostic Secure Computation.”
    EUROCRYPT 2026.

  • M. M. Jalalzai, K. Babel, J. Jovan, T. Klenze, S. Das, F. Elsheimy, M. Setrin, J. Bergschneider, B. P. Gilkalaye,
    “AegisBFT: Fast, Responsive, ForkResistant Consensus with Speculation Accountability.”
    DISC 2026.

  • F. Elsheimy, J. Loss, C. Papamanthou,
    “Early Stopping Byzantine Agreement in $(1+\epsilon)\cdot f$ Rounds.”
    ASIACRYPT 2024.

  • F. Elsheimy, G. Tsimos, C. Papamanthou,
    “Deterministic Byzantine Agreement with Adaptive $O(n \cdot f)$ Communication.”
    SODA 2024, pp. 1120–1146.

  • J. Ernstberger, J. Lauinger, F. Elsheimy, L. Zhou, S. Steinhorst, R. Canetti, et al.,
    “SoK: Data Sovereignty.”
    EuroS&P 2023, pp. 122–143.

Preprints & Papers Under Submission

  • G. Asharov, A. Chandramouli, F. Elsheimy, G. Stern,
    “SCALE-IT: Perfect MPC with Constant Overhead.”
    Under submission, 2026.

  • K. Babel, F. Elsheimy, L. Heimbach, M. M. Jalalzai, T. Klenze, et al.,
    “Cadence: Extreme Pipelining with Multiple Concurrent Proposers.”
    arXiv:2607.02275, 2026.

  • F. Elsheimy, J. Loss, S. H. Kamp,
    “Early Stopping is Cheap.”
    Cryptology ePrint Archive, 2026.

  • M. M. Jalalzai, K. Babel, J. Komatovic, T. Klenze, S. Das, F. Elsheimy, M. Setrin, et al.,
    “MonadBFT: Fast, Responsive, Fork-Resistant Streamlined Consensus.”
    arXiv:2502.20692, 2025.

  • F. Elsheimy, J. Loss, C. Papamanthou,
    “Towards Optimal Early Stopping Agreement Protocols.”
    Cryptology ePrint Archive, 2025.