![]() |
Volumn , Issue , 2008, Pages 405-414
|
An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience
|
Author keywords
Byzantine agreement; Distributed computing; Secret sharing
|
Indexed keywords
POLYNOMIALS;
ASYNCHRONOUS SYSTEM;
BYZANTINE AGREEMENT;
MEMORY CONSUMPTION;
NON-FAULTY PROCESS;
OPTIMAL RESILIENCE;
PRIVATE CHANNELS;
SECRET SHARING;
VERIFIABLE SECRET SHARING;
DISTRIBUTED COMPUTER SYSTEMS;
|
EID: 57549095453
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/1400751.1400804 Document Type: Conference Paper |
Times cited : (70)
|
References (14)
|