Dahlia Malkhi

Orcid: 0000-0002-7038-7250

Affiliations:
  • Microsoft Research


According to our database1, Dahlia Malkhi authored at least 171 papers between 1991 and 2023.

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

Awards

ACM Fellow

ACM Fellow 2011, "For contributions to fault-tolerant distributed computing.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Extended Abstract: HotStuff-2: Optimal Two-Phase Responsive BFT.
IACR Cryptol. ePrint Arch., 2023

Lumiere: Making Optimal BFT for Partial Synchrony Practical.
CoRR, 2023

BBCA-CHAIN: One-Message, Low Latency BFT Consensus on a DAG.
CoRR, 2023

BBCA-LEDGER: High Throughput Consensus meets Low Latency.
CoRR, 2023

Lessons from HotStuff.
CoRR, 2023

Block-STM: Scaling Blockchain Execution by Turning Ordering Curse to a Performance Blessing.
Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2023

Towards Practical Sleepy BFT.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

Invited Paper: Lessons from HotStuff.
Proceedings of the 5th workshop on Advanced tools, 2023

2022
Byzantine Consensus under Fully Fluctuating Participation.
IACR Cryptol. ePrint Arch., 2022

Maximal Extractable Value (MEV) Protection on a DAG.
Proceedings of the 4th International Conference on Blockchain Economics, 2022

Be Aware of Your Leaders.
Proceedings of the Financial Cryptography and Data Security, 2022

2021
Tech Transfer Stories and Takeaways (Invited Talk).
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Brief Announcement: Twins - BFT Systems Made Robust.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

RainBlock: Faster Transaction Processing in Public Blockchains.
Proceedings of the 2021 USENIX Annual Technical Conference, 2021

Twins: BFT Systems Made Robust.
Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Strengthened Fault Tolerance in Byzantine Fault Tolerant Replication.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

2020
Introduction to the Special Section on USENIX ATC 2019.
ACM Trans. Storage, 2020

Twins: White-Glove Approach for BFT Testing.
CoRR, 2020

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

ACE: Abstract Consensus Encapsulation for Liveness Boosting of State Machine Replication.
Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

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

Scalable and Efficient Data Authentication for Decentralized Systems.
CoRR, 2019

Lumière: Byzantine View Synchronization.
CoRR, 2019

Flexible BFT: Separating BFT Protocol Design from the Fault Model (Keynote Lecture).
Proceedings of the International Conference on Blockchain Economics, 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

FairLedger: A Fair Blockchain Protocol for Financial Institutions.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

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

Flexible Byzantine Fault Tolerance.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

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

Introduction.
Proceedings of the Concurrency: the Works of Leslie Lamport, 2019

2018
Introduction to the Special Issue on the Award Papers of USENIX ATC 2019.
ACM Trans. Comput. Syst., 2018

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

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

Asynchronous Verifiable Secret-Sharing Protocols on a Good Day.
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

State Machine Replication Is More Expensive Than Consensus.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Stable and Consistent Membership at Scale with Rapid.
Proceedings of the 2018 USENIX Annual Technical Conference, 2018

2017
Apache REEF: Retainable Evaluator Execution Framework.
ACM Trans. Comput. Syst., 2017

Revisiting the Paxos Foundations: A Look at Summer Internship Work at VMware Research.
ACM SIGOPS Oper. Syst. Rev., 2017

Consistent Clustered Applications with Corfu.
ACM SIGOPS Oper. Syst. Rev., 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

Dynamic Reconfiguration: Abstraction and Optimal Asynchronous Solution.
Proceedings of the 31st International Symposium on Distributed Computing, 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
Quorums.
Encyclopedia of Algorithms, 2016

Encyclopedia of Algorithms, 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

Flexible Paxos: Quorum Intersection Revisited.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 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

2015
Elastic Configuration Maintenance via a Parsimonious Speculating Snapshot Solution.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

REEF: Retainable Evaluator Execution Framework.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

Distributed Resource Discovery in Sub-Logarithmic Time.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Dynamic Reconfiguration: A Tutorial (Tutorial).
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

2014
Optimal gossip with direct addressing.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

2013
CORFU: A distributed shared log.
ACM Trans. Comput. Syst., 2013

Workshop report on LADIS 2012.
ACM SIGOPS Oper. Syst. Rev., 2013

Spanner's concurrency control.
SIGACT News, 2013

Beyond block I/O: implementing a distributed shared log in hardware.
Proceedings of the 6th Annual International Systems and Storage Conference, 2013

Tango: distributed data structures over a shared log.
Proceedings of the ACM SIGOPS 24th Symposium on Operating Systems Principles, 2013

2012
From paxos to CORFU: a flash-speed shared log.
ACM SIGOPS Oper. Syst. Rev., 2012

Announcing the 2012 Edsger W. Dijkstra prize in distributed computing.
SIGARCH Comput. Archit. News, 2012

Efficient distributed approximation algorithms via probabilistic tree embeddings.
Distributed Comput., 2012

Dynamic Reconfiguration of Primary/Backup Clusters.
Proceedings of the 2012 USENIX Annual Technical Conference, 2012

CORFU: A Shared Log Design for Flash Clusters.
Proceedings of the 9th USENIX Symposium on Networked Systems Design and Implementation, 2012

Systems Architecture, Design, Engineering, and Verification - The Practice in Research and Research in Practice.
Proceedings of the ACM Turing Centenary Celebration, 2012

2011
Dynamic atomic storage without consensus.
J. ACM, 2011

DISC 2011 Invited Lecture by Dahlia Malkhi: Going beyond Paxos.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

2010
Differential RAID: Rethinking RAID for SSD reliability.
ACM Trans. Storage, 2010

Reconfiguring a state machine.
SIGACT News, 2010

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

Reconfiguring Replicated Atomic Storage: A Tutorial.
Bull. EATCS, 2010

Brief Announcement: Flash-Log - A High Throughput Log.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

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

Data-centric reconfiguration with network-attached disks.
Proceedings of the 4th International Workshop on Large Scale Distributed Systems and Middleware, 2010

2009
Chasing the Weakest System Model for Implementing Ω and Consensus.
IEEE Trans. Dependable Secur. Comput., 2009

Virtual Ring Routing Trends.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

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

On the treeness of internet latency and bandwidth.
Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems, 2009

Vertical paxos and primary-backup replication.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

RPC Chains: Efficient Client-Server Communication in Geodistributed Systems.
Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, 2009

2008
Quorums.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

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

A unifying framework of rating users and data items in peer-to-peer and social networks.
Peer-to-Peer Netw. Appl., 2008

On spreading recommendations via social gossip.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

2007
P2P replica synchronization with vector sets.
ACM SIGOPS Oper. Syst. Rev., 2007

On collaborative content distribution using multi-message gossip.
J. Parallel Distributed Comput., 2007

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

Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213].
Inf. Comput., 2007

Concise version vectors in WinFS.
Distributed Comput., 2007

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

Peer-to-Peer Rating.
Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007), 2007

2006
Light-Weight Leases for Storage-Centric Coordination.
Int. J. Parallel Program., 2006

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

Brief Announcement: Chasing the Weakest System Model for Implementing <i>Omega</i> and Consensus.
Proceedings of the Stabilization, 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

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

2005
Active Disk Paxos with infinitely many processes.
Distributed Comput., 2005

Probabilistic quorums for dynamic systems.
Distributed Comput., 2005

<i>Omega</i> Meets Paxos: Leader Election and Stability Without Eventual Timely Links.
Proceedings of the Distributed Computing, 19th International Conference, 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

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

The Julia Content Distribution Network.
Proceedings of the Second USENIX Workshop on Real, Large Distributed Systems, 2005

Hold Your Sessions: An Attack on Java Session-Id Generation.
Proceedings of the Topics in Cryptology, 2005

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

2004
Locality-Aware Network Solutions - A survey (Column: Distributed Computing).
Bull. EATCS, 2004

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

Fairplay - Secure Two-Party Computation System.
Proceedings of the 13th USENIX Security Symposium, August 9-13, 2004, San Diego, CA, USA, 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

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
Diffusion without false rumors: on propagating updates in a Byzantine environment.
Theor. Comput. Sci., 2003

Estimating network size from local information.
Inf. Process. Lett., 2003

Objects shared by Byzantine processes.
Distributed Comput., 2003

Aquarius: A Data-Centric Approach to CORBA Fault-Tolerance.
Proceedings of the On The Move to Meaningful Internet Systems 2003: OTM 2003 Workshops, 2003

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

Dynamic Lookup Networks.
Proceedings of the Future Directions in Distributed Computing, 2003

A Data-Centric Approach for Scalable State Machine Replication.
Proceedings of the Future Directions in Distributed Computing, 2003

2002
Scalable Secure Storage When Half the System Is Faulty.
Inf. Comput., 2002

From Byzantine Agreement to Practical Survivability.
Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS 2002), 2002

K-clustering in wireless ad hoc networks.
Proceedings of the 2002 Workshop on Principles of Mobile Computing, 2002

Viceroy: a scalable and dynamic emulation of the butterfly.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Atomic Data Access in Distributed Hash Tables.
Proceedings of the Peer-to-Peer Systems, First International Workshop, 2002

E-Voting Without 'Cryptography'.
Proceedings of the Financial Cryptography, 6th International Conference, 2002

2001
On k-Set Consensus Problems in Asynchronous Systems.
IEEE Trans. Parallel Distributed Syst., 2001

Fault Detection for Byzantine Quorum Systems.
IEEE Trans. Parallel Distributed Syst., 2001

Probabilistic Quorum Systems.
Inf. Comput., 2001

Optimal Unconditional Information Diffusion.
Proceedings of the Distributed Computing, 15th International Conference, 2001

Efficient Update Diffusion in Byzantine Environments.
Proceedings of the 20th Symposium on Reliable Distributed Systems (SRDS 2001), 2001

Backoff Protocols for Distributed Mutual Exclusion and Ordering.
Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS 2001), 2001

Anonymity without 'Cryptography'.
Proceedings of the Financial Cryptography, 2001

2000
Secure Execution of Java Applets Using a Remote Playground.
IEEE Trans. Software Eng., 2000

An Architecture for Survivable Coordination in Large Distributed Systems.
IEEE Trans. Knowl. Data Eng., 2000

The Load and Availability of Byzantine Quorum Systems.
SIAM J. Comput., 2000

Secure Reliable Multicast Protocols in a WAN.
Distributed Comput., 2000

Dynamic Byzantine Quorum Systems.
Proceedings of the 2000 International Conference on Dependable Systems and Networks (DSN 2000) (formerly FTCS-30 and DCCA-8), 2000

1999
On Propagating Updates in a Byzantine Environment
CoRR, 1999

Secure Multicast in a WAN
CoRR, 1999

On Diffusing Updates in a Byzantine Environment.
Proceedings of the Eighteenth Symposium on Reliable Distributed Systems, 1999

On <i>k</i>-Set Consensus Problems in Asynchronous Systems.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998
Auditable Metering with Lightweight Security.
J. Comput. Secur., 1998

Byzantine Quorum Systems.
Distributed Comput., 1998

Survivable Consensus Objects.
Proceedings of the Seventeenth Symposium on Reliable Distributed Systems, 1998

Secure and Scalable Replication in Phalanx.
Proceedings of the Seventeenth Symposium on Reliable Distributed Systems, 1998

Secure Execution of Java Applets using a Remote Playground.
Proceedings of the Security and Privacy, 1998

Probabilistic Byzantine Quorum Systems.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997
A High-Throughput Secure Reliable Multicast Protocol.
J. Comput. Secur., 1997

Probabilistic Quorum Systems.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Failure Detectors in Omission Failure Environments.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Unreliable Intrusion Detection in Distributed Computations.
Proceedings of the 10th Computer Security Foundations Workshop (CSFW '97), 1997

1996
The Transis Approach to High Availability Cluster Communication.
Commun. ACM, 1996

A Framework for Partitionable Membership Service (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1994
Multicast communication for high availability (ניצול תקשורת מרובת-יעדים להגברת הזמינות במערכת מבוזרת.; נצול תקשרת מרבת-יעדים להגברת הזמינות במערכת מבזרת).
PhD thesis, 1994

Uniform Actions in Asynchronous Distributed Systems (Extended Abstract).
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

The Design of the Transis System.
Proceedings of the Theory and Practice in Distributed Systems, International Workshop, 1994

1993
On Distributed Algorithms in a Broadcast Domain.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

Early Delivery Totally Ordered Multicast in Asynchronous Environments.
Proceedings of the Digest of Papers: FTCS-23, 1993

1992
Using Visualization Tools to Understand Concurrency.
IEEE Softw., 1992

Membership Algorithms for Multicast Communication Groups.
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Transis: A Communication Subsystem for High Availability.
Proceedings of the Digest of Papers: FTCS-22, 1992

1991
The parallel C (pC) programming language.
IBM J. Res. Dev., 1991


  Loading...