1 citations · 2 across the 11 of their papers we have counts for
12 papers
Seamless Reconfiguration for DAG-BFT
Michael Yiqing Hu, Leander Jehl, Paul Franke-Bergmann +2
Byzantine Atomic Broadcast in Asynchronous networks has been studied extensively for decades. The FLP impossibility result rules out deterministic consensus in a fully asynchronous…
zkToken: Empowering Holders to Limit Revocation Checks for Verifiable Credentials
Praveensankar Manimaran, Mayank Raikwar, Thiago Garrett +3
Systems managing Verifiable Credentials are becoming increasingly popular. Unfortunately, their support for revoking previously issued credentials allows verifiers to effectively m…
Balancing incentives in committee-based blockchains
Arian Baloochestani, Leander Jehl
Blockchain protocols incentivize participation through monetary rewards, assuming rational actors behave honestly to maximize their gains. However, attackers may attempt to harm ot…
OptiLog: Assigning Roles in Byzantine Consensus
Hanish Gogada, Christian Berger, Leander Jehl +2
Byzantine Fault-Tolerant (BFT) protocols play an important role in blockchains. As the deployment of such systems extends to wide-area networks, the scalability of BFT protocols be…
Iniva: Inclusive and Incentive-compatible Vote Aggregation
Arian Baloochestani, Hanish Gogada, Leander Jehl +1
Many blockchain platforms use committee-based consensus for scalability, finality, and security. In this consensus scheme, a committee decides which blocks get appended to the chai…
Tit-for-Token: Understanding Fairness when Forwarding Data by Incentivized Peers in Decentralized Storage Networks
Vahid Heidaripour Lakhani, Arman Babaei, Leander Jehl +2
Decentralized storage networks offer services with intriguing possibilities to reduce inequalities in an extremely centralized market. The challenge is to conceive incentives that…
SoK: Scalability Techniques for BFT Consensus
Christian Berger, Signe Schwarz-Rüsch, Arne Vogel +4
With the advancement of blockchain systems, many recent research works have proposed distributed ledger technology~(DLT) that employs Byzantine fault-tolerant~(BFT) consensus proto…
Fair Incentivization of Bandwidth Sharing in Decentralized Storage Networks
Vahid Heidaripour Lakhani, Leander Jehl, Rinke Hendriksen +1
Peer-to-peer (p2p) networks are not independent of their peers, and the network efficiency depends on peers contributing resources. Because shared resources are not free, this cont…
SplitBFT: Improving Byzantine Fault Tolerance Safety Using Trusted Compartments
Ines Messadi, Markus Horst Becker, Kai Bleeke +3
Byzantine fault-tolerant agreement (BFT) in a partially synchronous system usually requires 3f + 1 nodes to tolerate f faulty replicas. Due to their high throughput and finality pr…
A Tree-based Construction for Verifiable Diplomas with Issuer Transparency
Rodrigo Q. Saramago, Leander Jehl, Hein Meling +1
Still to this day, academic credentials are primarily paper-based, and the process to verify the authenticity of such documents is costly, time-consuming, and prone to human error…
[Invited talk] Building a Disaster-resilient Storage Layer for Next Generation Networks: The Role of Redundancy
Vero Estrada-Galinanes, Racin Nygaard, Viktor Tron +3
Blockchain is the driving force behind a myriad of decentralized applications (dapps) that promise to transform the Internet. The next generation Internet, or web3, introduces a "u…
Reliable Probabilistic Gossip over Large-Scale Random Topologies
Ruijing Hu, Leander Jehl
This paper studies reliability of probabilistic neighbor-aware gossip algorithms over three well- known large-scale random topologies, namely Bernoulli (or Erdős-Rényi) graph, the…