The permissioned blockchain system has recently become popular in a wide range of
scenarios, such as artificial intelligence, financial applications and the Internet of things, due …

Proof-of-work (PoW) is an algorithmic tool used to secure networks by imposing a
computational cost on participating devices. Unfortunately, traditional PoW schemes require …

Performing computation in the presence of faulty and malicious nodes is a central problem
in distributed computing. Over 35 years ago, Dwork, Peleg, Pippenger, and Upfal [STOC …

Motivated by the need for designing efficient and robust fully-distributed computation in
highly dynamic networks such as Peer-to-Peer (P2P) networks, we study distributed …

Dynamic Networks. Large real-world networks are inherently very dynamic: the participants
in peer-to-peer (P2P) networks change over time, mobile nodes in wireless networks move …

A Peer-to-Peer (P2P) network is a dynamic collection of nodes that connect with each other
via virtual overlay links built upon an underlying network (usually, the Internet). Typical P2P …

Proof-of-work puzzles and CAPTCHAS consume enormous amounts of energy and time.
These techniques are examples of resource burning: verifiable consumption of resources …

In this paper, we look at the problem of randomized leader election in synchronous
distributed networks with a special focus on the message complexity. We provide an …

Byzantine agreement is a fundamental problem in fault-tolerant distributed networks that has
been studied intensively for the last four decades. Most of these works designed protocols …

We consider the corner-stone broadcast task with an adaptive adversary that controls a fixed
number of $ t $ edges in the input communication graph. In this model, the adversary sees …