News
We are looking for a Director of Research
Please see the job posting.
Three new research papers accepted for publication
October 15th, 2025
- Optimistic, Signature-Free Reliable Broadcast and Its Applications. Nibesh Shrestha (Supra Research), Qianyu Yu (The Hong Kong University of Science and Technology (Guangzhou)), Aniket Kate (Purdue University / Supra Research), Giuliano Losa (Stellar Development Foundation), Kartik Nayak (Duke University), Xuechao Wang (The Hong Kong University of Science and Technology (Guangzhou)). CCS 2025. arXiv version
- From OT to OLE with Subquadratic Communication. Jack Doerner (Brown, UVa), Iftach Haitner (TAU, Stellar Foundation), Yuval Ishai (Technion, Amazon/AWS), Nikolaos Makriyannis (Fireblocks). CCS 2025
- A Tale of Two Case Studies: A Unified Exploration of Rust Verification with SeaBMC. Joseph Tafese (University of Waterloo), Siddharth Priya (University of Waterloo), Giuliano Losa (Stellar Development Foundation), Arie Gurfinkel (University of Waterloo), and Graydon Hoare (Stellar Development Foundation). FMCAD 2025
Two new research papers accepted for publication
February 11th, 2025
- Dan Boneh (Stanford), Iftach Haitner (Stellar Development Foundation), and Yehuda Lindell (Coinbase). Exponent-VRFs and Their Applications. Eurocrypt 2025. Preprint
- Giulian Losa (Stellar Development Foundation), Yifan Mao (Ohio State University), Shaileshh Bojja Venkatakrishnan (Ohio State University), and Yunqi Zhang (Ohio State University). Constellation: Peer-to-Peer Overlays for Federated Byzantine Agreement Systems. FC 2025. Preprint.
Workshop on Formal Reasoning in Distributed Algorithms
August 13th, 2024
Slides of the presentations are now available on the workshop's website.
3 papers accepted at the PODC 2024 conference!
April 22nd, 2024
- L. Zanolini, F. D’Amato, G. Losa. Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols (arXiv version)
- Q. Yu, G. Losa, X. Wang. TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus (arXiv version)
- G. Losa and E. Gafni. Brief Announcement: Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model (arXiv version)