Sharding is the prevalent approach to breaking the trilemma of simultaneously achieving
decentralization, security, and scalability in traditional blockchain systems, which are …

Motivated and inspired by the emergence of blockchains, many new protocols have recently
been proposed for generating publicly verifiable randomness in a distributed yet secure …

Having shared access to high-quality random numbers is essential in many important
applications. Yet, existing constructions of distributed random beacons still have limitations …

We introduce the first practical protocols for fully decentralized sealed-bid auctions using
timed commitments. Timed commitments ensure that the auction is finalized fairly even if all …

A random beacon provides a continuous public source of randomness and its applications
range from public lotteries to zero-knowledge proofs. Existing random beacon protocols …

Timed commitments Boneh and Naor, CRYPTO 2000 are the timed analogue of standard
commitments, where the commitment can be non-interactively opened after a pre-specified …

The scientific interest in the area of Decentralized Randomness Beacon (DRB) protocols
has been thriving recently. Partially that interest is due to the success of the disruptive …

In the data communication system, the real-time information interaction of communication
device increases the risk of privacy sensitive data being tampered with. Therefore …

Public random beacons publish random numbers at regular intervals, which anyone can
obtain and verify. The design of public distributed random beacons has been an exciting …

We introduce the short-lived proof, a non-interactive proof of knowledge with a novel feature:
after a specified period of time, the proof is no longer convincing. This time-delayed loss of …