Ittai Abraham
Senior Researcher
Herzliya, IL, IL
I do research in Algorithms and Distributed Computing
I am a founding member of the VMware Research Group (dec 2014-), the VMware Blockchain Project (2016-) and the VMware Research Group in Israel (2016-). Prior to joining VMware, I was a researcher at Microsoft Research Silicon Valley (2008-2014). I hold a PHd in Computer Science from the Hebrew University.
My work spans from the theory of algorithms through the foundations of distributed computing to practical aspects in industrial research, algorithm engineering, distributed systems and blockchain technology.
Steering committee member of the conference on Advances in Financial Technologies: https://aftconf.github.io/
Visit our Decentralized Thoughts group blog and my personal homepage
Projects
- Corfu
- Fragmented Log-Structured Merge Trees
- VMware Blockchain
- Blinder - Anonymous Committed Broadcast
- SplinterDB
- Digital Cash Infrastructure
Publications
- Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity
- Low-distortion Inference of Latent Similarities from a Multiplex Social Network
- On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs
- Approximate Nearest Neighbor Search in Metrics of Planar Graphs
- How Many Workers to Ask? Adaptive Exploration for Collecting High Quality Labels
- Silver: A scalable, distributed, multi-versioning, Always growing (Ag) File System
- Replex: A Scalable, Highly Available Multi-Index Store
- BVP: Byzantine Vertical Paxos
- Virtualized Congestion Control
- On Fully Dynamic Graph Sparsifiers
- vCorfu: A Cloud-Scale Object Store on a Shared Log
- PebblesDB: Building Key-Value Stores using Fragmented Log-Structured Merge Trees
- The Blockchain Consensus Layer and BFT.
- Efficient Synchronous Byzantine Consensus
- Brief Announcement: Practical Synchronous Byzantine Consensus
- Solidus: An incentive-compatible cryptocurrency based on permissionless Byzantine consensus
- Solida: A Cryptocurrency Based on Reconfigurable Byzantine Consensus
- Online Detection of Effectively Callback Free Objects with Applications to Smart Contracts
- Revisiting Fast Practical Byzantine Fault Tolerance
- Revisiting Fast Practical Byzantine Fault Tolerance: Thelma, Velma, and Zelma
- HotStuff: BFT Consensus in the Lens of Blockchain
- SBFT: a Scalable Decentralized Trust Infrastructure for Blockchains
- Distributed SSH Key Management with Proactive RSA Threshold Signatures
- Metric Embedding via Shortest Path Decompositions
- Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n^2) Communication, and Optimal Resilience
- Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication
- Dfinity Consensus, Explored
- Asymptotically Optimal Validated Asynchronous Byzantine Agreement
- SBFT: a Scalable and Decentralized Trust Infrastructure
- Communication Complexity of Byzantine Agreement, Revisited
- Sync HotStuff: Simple and Practical State Machine Replication
- HotStuff: BFT Consensus with Linearity and Responsiveness
- Implementing Mediators with Asynchronous Cheap Talk
- Sync HotStuff: Simple and Practical Synchronous State Machine Replication
- Towards Scalable Threshold Cryptosystems
- Efficient Verifiable Secret Sharing with Share Recovery in BFT Protocols
- Aggregatable Subvector Commitments for Stateless Cryptocurrencies
- When Nakamoto Meets Nash: Blockchain Breakthrough Through the Lens of Game Theory (Invited Talk)
- Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency
- Peaches, lemons, and cookies: Designing auction markets with dispersed information
- Ramsey Spanning Trees and Their Applications
- On the Optimality of Optimistic Responsiveness
- Blinder - Scalable, Robust Anonymous Committed Broadcast
- Information Theoretic HotStuff
- Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience
- Using Petal-Decompositions to Build a Low Stretch Spanning Tree
- Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs
- Distributed Protocols for Leader Election: A Game-Theoretic Perspective
- Good-case Latency of Byzantine Broadcast: a Complete Categorization
- Reaching Consensus for Asynchronous Distributed Key Generation
- Efficient Perfectly Secure Computation with Optimal Resilience
- Brief Announcement: Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption
- Good-case and Bad-case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization
- Optimal Good-case Latency for Rotating Leader Synchronous BFT
- UTT: Decentralized Ecash with Accountable Privacy
- Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time
- BeeGees: Stayin' Alive in Chained BFT