English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We give a protocol for Asynchronous Distributed Key Generation (A-DKG) thatis optimally resilient (can withstand $f<\frac{n}{3}$ faulty parties), has aconstant expected number of rounds, has $\tilde{O}(n^3)$ expected communicationcomplexity, and assumes only the existence of a PKI. Prior to our work, thebest A-DKG protocols required $\Omega(n)$ expected number of rounds, and$\Omega(n^4)$ expected communication.  Our A-DKG protocol relies on several building blocks that are of independentinterest. We define and design a Proposal Election (PE) protocol that allowsparties to retrospectively agree on a valid proposal after enough proposalshave been sent from different parties. With constant probability the electedproposal was proposed by a non-faulty party. In building our PE protocol, wedesign a Verifiable Gather protocol which allows parties to communicate whichproposals they have and have not seen in a verifiable manner. The finalbuilding block to our A-DKG is a Validated Asynchronous Byzantine Agreement(VABA) protocol. We use our PE protocol to construct a VABA protocol that doesnot require leaders or an asynchronous DKG setup. Our VABA protocol can be usedmore generally when it is not possible to use threshold signatures.

Reaching Consensus for Asynchronous Distributed Key Generation