In this article, we present a concise and efficient randomized DA protocol for asynchronous networks, which works for processors n > 5t, where n is the size of the network. The protocol has only a low communication complexity (Θ (log n) and does not require any cryptographic assumptions. The protocol belongs to the class of protocols that require a « trusted dealer » responsible for proper networking, and represents an improvement in the number of processors over the previous solutions presented in . . .
Randomized Distributed Agreement
dimanche, octobre 3, 2021