Ittai Abraham

Orcid: 0000-0001-9568-7674

According to our database1, Ittai Abraham authored at least 142 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Motorway: Seamless high speed BFT.
CoRR, 2024

2023
Corrigendum: Metric Embedding via Shortest Path Decompositions.
SIAM J. Comput., October, 2023

Reaching consensus for asynchronous distributed key generation.
Distributed Comput., September, 2023

Communication complexity of byzantine agreement, revisited.
Distributed Comput., March, 2023

Communication and Round Efficient Parallel Broadcast Protocols.
IACR Cryptol. ePrint Arch., 2023

On the Round Complexity of Asynchronous Crusader Agreement.
IACR Cryptol. ePrint Arch., 2023

Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time.
IACR Cryptol. ePrint Arch., 2023

Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time.
IACR Cryptol. ePrint Arch., 2023

BeeGees: Stayin' Alive in Chained BFT.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Fever: Optimal Responsive View Synchronisation.
Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

Bingo: Adaptivity and Asynchrony in Verifiable Secret Sharing and Distributed Key Generation.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Metric Embedding via Shortest Path Decompositions.
SIAM J. Comput., 2022

Efficient Perfectly Secure Computation with Optimal Resilience.
J. Cryptol., 2022

UTT: Decentralized Ecash with Accountable Privacy.
IACR Cryptol. ePrint Arch., 2022

New Dolev-Reischuk Lower Bounds Meet Blockchain Eclipse Attacks.
IACR Cryptol. ePrint Arch., 2022

Bingo: Adaptively Secure Packed Asynchronous Verifiable Secret Sharing and Asynchronous Distributed Key Generation.
IACR Cryptol. ePrint Arch., 2022

Authenticated Consensus in Synchronous Systems with Mixed Faults.
IACR Cryptol. ePrint Arch., 2022

Colordag: An Incentive-Compatible Blockchain.
IACR Cryptol. ePrint Arch., 2022

Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement.
IACR Cryptol. ePrint Arch., 2022

Asymptotically Free Broadcast in Constant Expected Time via Packed VSS.
IACR Cryptol. ePrint Arch., 2022

Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security.
IACR Cryptol. ePrint Arch., 2022

Revisiting asynchronous fault tolerant computation with optimal resilience.
Distributed Comput., 2022

It's not easy to relax: liveness in chained BFT protocols.
CoRR, 2022

Brief Announcement: Authenticated Consensus in Synchronous Systems with Mixed Faults.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Brief Announcement: It's not easy to relax: liveness in chained BFT protocols.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption.
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

Reflections on the Past, Present and Future of Blockchain Foundations and Applications (Invited Talk).
Proceedings of the 5th International Symposium on Foundations and Applications of Blockchain 2022, 2022

2021
Communication-Efficient BFT Protocols Using Small Trusted Hardware to Tolerate Minority Corruption.
IACR Cryptol. ePrint Arch., 2021

No-Commit Proofs: Defeating Livelock in BFT.
IACR Cryptol. ePrint Arch., 2021

Optimal Good-case Latency for Rotating Leader Synchronous BFT.
IACR Cryptol. ePrint Arch., 2021

Brief Note: Fast Authenticated Byzantine Consensus.
CoRR, 2021

Brief Announcement: Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Good-case Latency of Byzantine Broadcast: a Complete Categorization.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Good-Case and Bad-Case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization.
Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

2020
Ramsey Spanning Trees and Their Applications.
ACM Trans. Algorithms, 2020

Aggregatable Subvector Commitments for Stateless Cryptocurrencies.
IACR Cryptol. ePrint Arch., 2020

Blinder: MPC Based Scalable and Robust Anonymous Committed Broadcast.
IACR Cryptol. ePrint Arch., 2020

On the Optimality of Optimistic Responsiveness.
IACR Cryptol. ePrint Arch., 2020

Peaches, lemons, and cookies: Designing auction markets with dispersed information.
Games Econ. Behav., 2020

Optimal Good-case Latency for Byzantine Broadcast and State Machine Replication.
CoRR, 2020

Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

When Nakamoto Meets Nash: Blockchain Breakthrough Through the Lens of Game Theory (Invited Talk).
Proceedings of the 2nd International Conference on Blockchain Economics, 2020

Towards Scalable Threshold Cryptosystems.
Proceedings of the 2020 IEEE Symposium on Security and Privacy, 2020

Sync HotStuff: Simple and Practical Synchronous State Machine Replication.
Proceedings of the 2020 IEEE Symposium on Security and Privacy, 2020

Information Theoretic HotStuff.
Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

Blinder - Scalable, Robust Anonymous Committed Broadcast.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
Distributed Protocols for Leader Election: A Game-Theoretic Perspective.
ACM Trans. Economics and Comput., 2019

Using Petal-Decompositions to Build a Low Stretch Spanning Tree.
SIAM J. Comput., 2019

Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs.
SIAM J. Comput., 2019

Bootstrapping Consensus Without Trusted Setup: Fully Asynchronous Distributed Key Generation.
IACR Cryptol. ePrint Arch., 2019

Sync HotStuff: Synchronous SMR with 2∆ Latency and Optimistic Responsiveness.
IACR Cryptol. ePrint Arch., 2019

HotStuff: BFT Consensus with Linearity and Responsiveness.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Asymptotically Optimal Validated Asynchronous Byzantine Agreement.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Implementing Mediators with Asynchronous Cheap Talk.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

SBFT: A Scalable and Decentralized Trust Infrastructure.
Proceedings of the 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2019

Efficient Verifiable Secret Sharing with Share Recovery in BFT Protocols.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
Online detection of effectively callback free objects with applications to smart contracts.
Proc. ACM Program. Lang., 2018

Distributed SSH Key Management with Proactive RSA Threshold Signatures.
IACR Cryptol. ePrint Arch., 2018

Dfinity Consensus, Explored.
IACR Cryptol. ePrint Arch., 2018

Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n<sup>2)</sup> Communication, and Optimal Resilience.
IACR Cryptol. ePrint Arch., 2018

Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication.
CoRR, 2018

SBFT: a Scalable Decentralized Trust Infrastructure for Blockchains.
CoRR, 2018

Hot-Stuff the Linear, Optimal-Resilience, One-Message BFT Devil.
CoRR, 2018

Revisiting Fast Practical Byzantine Fault Tolerance: Thelma, Velma, and Zelma.
CoRR, 2018

mLSM: Making Authenticated Storage Faster in Ethereum.
Proceedings of the 10th USENIX Workshop on Hot Topics in Storage and File Systems, 2018

2017
Consistent Clustered Applications with Corfu.
ACM SIGOPS Oper. Syst. Rev., 2017

Practical Synchronous Byzantine Consensus.
IACR Cryptol. ePrint Arch., 2017

Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus.
IACR Cryptol. ePrint Arch., 2017

The Blockchain Consensus Layer and BFT.
Bull. EATCS, 2017

Revisiting Fast Practical Byzantine Fault Tolerance.
CoRR, 2017

Brief Announcement: Practical Synchronous Byzantine Consensus.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

PebblesDB: Building Key-Value Stores using Fragmented Log-Structured Merge Trees.
Proceedings of the 26th Symposium on Operating Systems Principles, 2017

Fully dynamic all-pairs shortest paths with worst-case update-time revisited.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Asymptotically Tight Bounds for Composing ORAM with PIR.
Proceedings of the Public-Key Cryptography - PKC 2017, 2017

vCorfu: A Cloud-Scale Object Store on a Shared Log.
Proceedings of the 14th USENIX Symposium on Networked Systems Design and Implementation, 2017

2016
Spanning Trees with Low Average Stretch.
Encyclopedia of Algorithms, 2016

Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension.
ACM Trans. Algorithms, 2016

Highway Dimension and Provably Efficient Shortest Path Algorithms.
J. ACM, 2016

An Oblivious RAM with Sub-logarithmic Bandwidth Blowup.
IACR Cryptol. ePrint Arch., 2016

Solidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus.
CoRR, 2016

Replex: A Scalable, Highly Available Multi-Index Data Store.
Proceedings of the 2016 USENIX Annual Technical Conference, 2016

On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

How Many Workers to Ask?: Adaptive Exploration for Collecting High Quality Labels.
Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

Virtualized Congestion Control.
Proceedings of the ACM SIGCOMM 2016 Conference, Florianopolis, Brazil, August 22-26, 2016, 2016

Silver: A Scalable, Distributed, Multi-versioning, Always Growing (Ag) File System.
Proceedings of the 8th USENIX Workshop on Hot Topics in Storage and File Systems, 2016

On Fully Dynamic Graph Sparsifiers.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Low-Distortion Inference of Latent Similarities from a Multiplex Social Network.
SIAM J. Comput., 2015

Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion.
SIAM J. Comput., 2015

Local Embeddings of Metric Spaces.
Algorithmica, 2015

Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Approximate Nearest Neighbor Search in Metrics of Planar Graphs.
Proceedings of the Approximation, 2015

2014
Volume in General Metric Spaces.
Discret. Comput. Geom., 2014

Distance Labels with Optimal Local Stretch.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Using Worker Quality Scores to Improve Stopping Rules.
Proceedings of the Seconf AAAI Conference on Human Computation and Crowdsourcing, 2014

Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier.
Proceedings of the Approximation, 2014

2013
Alternative routes in road networks.
ACM J. Exp. Algorithmics, 2013

Dynamic Decremental Approximate Distance Oracles with (1+ε, 2) stretch.
CoRR, 2013

Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem.
Proceedings of the COLT 2013, 2013

2012
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Combinatorial auctions with restricted complements.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

HLDB: location-based services in databases.
Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

Hierarchical Hub Labelings for Shortest Paths.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Distributed computing meets game theory: combining insights from two fields.
SIGACT News, 2011

A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

On Approximate Distance Labels and Routing Schemes with Affine Stretch.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

VC-Dimension and Shortest Path Algorithms.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Strong-Diameter Decompositions of Minor Free Graphs.
Theory Comput. Syst., 2010

Fast Asynchronous Consensus with Optimal Resilience.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Highway Dimension, Shortest Paths, and Provably Efficient Algorithms.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
Locality and efficiency in distributed computing (עם תקציר בעברית ושער נוסף: יעילות ולוקאליות במערכות מבוזרות.).
PhD thesis, 2009

Compact Multicast Routing.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

On low dimensional local embeddings.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008
Compact name-independent routing with minimum stretch.
ACM Trans. Algorithms, 2008

An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience
CoRR, 2008

Lower Bounds on Implementing Robust and Resilient Mediators.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Embedding metric spaces in their intrinsic dimension.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilience.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Nearly Tight Low Stretch Spanning Trees.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
Wait-free regular storage from Byzantine components.
Inf. Process. Lett., 2007

Reconstructing approximate tree metrics.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
Byzantine disk paxos: optimal resilience with byzantine shared memory.
Distributed Comput., 2006

Asynchronous resource discovery.
Comput. Networks, 2006

Advances in metric embedding theory.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

On space-stretch trade-offs: upper bounds.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

On space-stretch trade-offs: lower bounds.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Object location using path separators.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Routing in Networks with Low Doubling Dimension.
Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006

2005
Probabilistic quorums for dynamic systems.
Distributed Comput., 2005

Papillon: Greedy Routing in Rings.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Compact Routing for Graphs Excluding a Fixed Minor.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Name independent routing for growth bounded networks.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Skip B-Trees.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Practical Locality-Awareness for Large Scale Information Sharing.
Proceedings of the Peer-to-Peer Systems IV, 4th International Workshop, 2005

Metric Embeddings with Relaxed Guarantees.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Robust Locality-Aware Lookup Networks.
Proceedings of the Self-star Properties in Complex Information Systems, 2005

2004
Routing with Improved Communication-Space Trade-Off.
Proceedings of the Distributed Computing, 18th International Conference, 2004

LAND: stretch (1 + epsilon) locality-aware networks for DHTs.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Compact routing on euclidian metrics.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Optimal Resilience Asynchronous Approximate Agreement.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

LLS: a locality aware location service for mobile ad hoc networks.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2004

2003
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003


  Loading...