---
res:
  bibo_abstract:
  - In this paper, we present the first Asynchronous Distributed Key Generation (ADKG)
    algorithm which is also the first distributed key generation algorithm that can
    generate cryptographic keys with a dual (f,2f+1)-threshold (where f is the number
    of faulty parties). As a result, using our ADKG we remove the trusted setup assumption
    that the most scalable consensus algorithms make. In order to create a DKG with
    a dual (f,2f+1)- threshold we first answer in the affirmative the open question
    posed by Cachin et al. [7] on how to create an Asynchronous Verifiable Secret
    Sharing (AVSS) protocol with a reconstruction threshold of f+1<k łe 2f+1, which
    is of independent interest. Our High-threshold-AVSS (HAVSS) uses an asymmetric
    bivariate polynomial to encode the secret. This enables the reconstruction of
    the secret only if a set of k nodes contribute while allowing an honest node that
    did not participate in the sharing phase to recover his share with the help of
    f+1 honest parties. Once we have HAVSS we can use it to bootstrap scalable partially
    synchronous consensus protocols, but the question on how to get a DKG in asynchrony
    remains as we need a way to produce common randomness. The solution comes from
    a novel Eventually Perfect Common Coin (EPCC) abstraction that enables the generation
    of a common coin from n concurrent HAVSS invocations. EPCC's key property is that
    it is eventually reliable, as it might fail to agree at most f times (even if
    invoked a polynomial number of times). Using EPCC we implement an Eventually Efficient
    Asynchronous Binary Agreement (EEABA) which is optimal when the EPCC agrees and
    protects safety when EPCC fails. Finally, using EEABA we construct the first ADKG
    which has the same overhead and expected runtime as the best partially-synchronous
    DKG (O(n4) words, O(f) rounds). As a corollary of our ADKG, we can also create
    the first Validated Asynchronous Byzantine Agreement (VABA) that does not need
    a trusted dealer to setup threshold signatures of degree n-f. Our VABA has an
    overhead of expected O(n2) words and O(1) time per instance, after an initial
    O(n4) words and O(f) time bootstrap via ADKG.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Eleftherios
      foaf_name: Kokoris Kogias, Eleftherios
      foaf_surname: Kokoris Kogias
      foaf_workInfoHomepage: http://www.librecat.org/personId=f5983044-d7ef-11ea-ac6d-fd1430a26d30
  - foaf_Person:
      foaf_givenName: Dahlia
      foaf_name: Malkhi, Dahlia
      foaf_surname: Malkhi
  - foaf_Person:
      foaf_givenName: Alexander
      foaf_name: Spiegelman, Alexander
      foaf_surname: Spiegelman
  bibo_doi: 10.1145/3372297.3423364
  dct_date: 2020^xs_gYear
  dct_identifier:
  - UT:000768470400104
  dct_isPartOf:
  - http://id.crossref.org/issn/978-1-4503-7089-9
  dct_language: eng
  dct_publisher: Association for Computing Machinery@
  dct_title: Asynchronous distributed key generation for computationally-secure randomness,
    consensus, and threshold signatures@
...