Name
Abstract | ||
|---|---|---|
We present a randomized solution for the Byzantine Generals Problems. The solution works in the synchronous as well as the asynchronous case and produces Byzantine Agreement within a fixed small expected number of computational rounds, independent of the number n of processes and the bound t on the number of faulty processes. The solution uses A. Shamir's method for sharing secrets. It specializes to produce a simple solution for the Distributed Commit problem. |
Year | DOI | Venue |
|---|---|---|
1983 | 10.1109/SFCS.1983.48 | FOCS |
Keywords | Field | DocType |
byzantine generals problems,randomized byzantine general,asynchronous case,solution work,randomized solution,number n,simple solution,fixed small expected number,computational round,commit problem,byzantine agreement,force,byzantine generals problem,heart,digital signatures,upper bound,frequency modulation,protocols,helium,robustness,decision support systems,synchronization,public key,authentication | Discrete mathematics,Asynchronous communication,Synchronization,Commit,Upper and lower bounds,Computer science,Byzantine fault tolerance,Digital signature,Quantum Byzantine agreement,Public-key cryptography | Conference |
ISBN | Citations | PageRank |
0-8186-0508-1 | 188 | 67.18 |
References | Authors | |
4 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael O. Rabin | 1 | 3471 | 3060.62 |