EDBT 2026 Demo / reviewers in the wild / expert
Wassim Yahyaoui
dblp:383/5355
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems › fault tolerance
byzantine fault tolerance |
0.8 | 1 | 2024 | Tolerating Disasters with Hierarchical Consensus · INFOCOM 2024 |
Distributed systems
consensus |
0.8 | 1 | 2024 | Tolerating Disasters with Hierarchical Consensus · INFOCOM 2024 |
Distributed systems › consensus
hierarchical consensus |
0.8 | 1 | 2024 | Tolerating Disasters with Hierarchical Consensus · INFOCOM 2024 |
Distributed systems › fault tolerance › failure recovery
disaster recovery |
0.2 | 1 | 2024 | Tolerating Disasters with Hierarchical Consensus · INFOCOM 2024 |
Distributed systems
fault tolerance |
0.2 | 1 | 2024 | Tolerating Disasters with Hierarchical Consensus · INFOCOM 2024 |
Methods — techniques the papers use, named apart from their topics
subgroup rotation · 0.8cluster confirmation · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Mitigating Front-Running Attacks through Fair and Resilient Transaction DisseminationabstractIn modern blockchains, efficient, fair, and fault-tolerant information dissemination is critical for performance and security. Several stages of the transaction lifecycle are affected, from the creation and dissemination of transactions to the dissemination of blocks in the consensus layer. Mempool protocols, such as LØ, already address some of modern blockchains’ security threats. However, others remain unless fairness is embedded most fundamentally in the dissemination layer used by these protocols to share transactions and blocks and to reconcile mempools. This paper introduces HERMES, a novel dissemination protocol for mempools that leverages robust minimal structures to optimize data propagation, balance load, and ensure fairness despite faults and Byzantine actors. Specifically, we address front-running attacks by randomizing the choice of an overlay structure while forcing nodes to prove adherence to the mempools’ dissemination policies and the random choice made. Experimental results show significant performance improvements compared to traditional broadcast protocols for both permissioned and permissionless blockchains. Wassim Yahyaoui, Joachim Bruneau-Queyreix, Jeremie Decouchant, Marcus Völp |
DSN | 1 |
| 2024 | Tolerating Disasters with Hierarchical ConsensusabstractGeo-replication provides disaster recovery after catastrophic accidental failures or attacks, such as fires, blackouts or denial-of-service attacks to a data center or region. Naturally distributed data structures, such as Blockchains, when well designed, are immune against such disruptions, but they also benefit from leveraging locality. In this work, we consolidate the performance of geo-replicated consensus by leveraging novel insights about hierarchical consensus and a construction methodology that allows creating novel protocols from existing building blocks. In particular we show that cluster confirmation, paired with subgroup rotation, allows protocols to safely operate through situations where all members of the global consensus group are Byzantine. We demonstrate our compositional construction by combining the recent HotStuff and Damysus protocols into a hierarchical geo-replicated blockchain with global durability guarantees. We present a compositionality proof and demonstrate the correctness of our protocol, including its ability to tolerate cluster crashes. Our protocol — Orion1— achieves a 20% higher throughput than GeoBFT, the latest hierarchical Byzantine Fault-Tolerant (BFT) protocol. Wassim Yahyaoui, Joachim Bruneau-Queyreix, Marcus Völp, Jeremie Decouchant |
INFOCOM | 1 |