Practical asynchronous distributed key generation
Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems
without a trusted third party and is a building block to decentralized protocols such as …
without a trusted third party and is a building block to decentralized protocols such as …
Asynchronous consensus without trusted setup or public-key cryptography
Byzantine consensus is a fundamental building block in distributed cryptographic problems.
Despite decades of research, most existing asynchronous consensus protocols require a …
Despite decades of research, most existing asynchronous consensus protocols require a …
Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling
Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems
without a trusted party. DKG is an essential building block to many decentralized protocols …
without a trusted party. DKG is an essential building block to many decentralized protocols …
Lightweight asynchronous verifiable secret sharing with optimal resilience
We present new protocols for Asynchronous Verifiable Secret Sharing for Shamir (ie,
threshold t< n) sharing of secrets. Our protocols: Use only “lightweight” cryptographic …
threshold t< n) sharing of secrets. Our protocols: Use only “lightweight” cryptographic …
Long live the honey badger: Robust asynchronous {DPSS} and its applications
Secret sharing is an essential tool for many distributed applications, including distributed key
generation and multiparty computation. For many practical applications, we would like to …
generation and multiparty computation. For many practical applications, we would like to …
Balanced byzantine reliable broadcast with near-optimal communication and improved computation
This paper studies Byzantine reliable broadcast (BRB) under asynchronous networks, and
improves the state-of-the-art protocols from the following aspects. Near-optimal …
improves the state-of-the-art protocols from the following aspects. Near-optimal …
Non-interactive VSS using Class Groups and Application to DKG
We put forward a non-interactive verifiable secret sharing (NI-VSS) scheme using class
groups-we call it cgVSS. Our construction follows the standard framework of encrypting the …
groups-we call it cgVSS. Our construction follows the standard framework of encrypting the …
[PDF][PDF] Bingo: Adaptively Secure Packed Asynchronous Verifiable Secret Sharing and Asynchronous Distributed Key Generation.
In this work we present Bingo, an adaptively secure and optimally resilient packed
asynchronous verifiable secret sharing (PAVSS) protocol that allows a dealer to share f+ 1 …
asynchronous verifiable secret sharing (PAVSS) protocol that allows a dealer to share f+ 1 …
Sok: Decentralized randomness beacon protocols
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 …
has been thriving recently. Partially that interest is due to the success of the disruptive …
Bingo: Adaptivity and asynchrony in verifiable secret sharing and distributed key generation
We present Bingo, an adaptively secure and optimally resilient packed asynchronous
verifiable secret sharing (PAVSS) protocol that allows a dealer to share f+ 1 secrets with a …
verifiable secret sharing (PAVSS) protocol that allows a dealer to share f+ 1 secrets with a …