Lower bound for scalable Byzantine agreement
| dc.contributor.author | Holtby, Dan | |
| dc.contributor.supervisor | King, Valerie | |
| dc.date.accessioned | 2010-01-12T16:57:57Z | |
| dc.date.available | 2010-01-12T16:57:57Z | |
| dc.date.copyright | 2006 | en |
| dc.date.issued | 2010-01-12T16:57:57Z | |
| dc.degree.department | Department of Computer Science | |
| dc.degree.level | Master of Science M.Sc. | en |
| dc.description.abstract | We consider the problem of computing Byzantine Agreement in a synchronous network with n processors each with a private random string, where each pair of processors is connected by a private communication line. The adversary is malicious and non-adaptive, i.e., it must choose the processors to corrupt at the start of the algorithm. Byzantine Agreement is known to be computable in this model in an expected constant number of rounds. We consider a scalable model where in each round each uncorrupt processor can send to any set of log n other processors and listen to any set of log n processors. We define the loss of a computation to be the number of uncorrupt processors whose output, does not agree with the output of the majority of uncorrupt processors, We show that. if there are I corrupt processors, then any randomised protocol which has probability at least 1/2 -h 1/ log u of loss less than t 2/3 / 16fn1/3log5/3n requires at least f rounds. | en |
| dc.identifier.uri | http://hdl.handle.net/1828/2069 | |
| dc.language | English | eng |
| dc.language.iso | en | en |
| dc.rights | Available to the World Wide Web | en |
| dc.subject | fault-tolerant computing | en |
| dc.subject | electronic data processing | en |
| dc.subject | distributed processing | en |
| dc.subject.lcsh | UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science | en |
| dc.title | Lower bound for scalable Byzantine agreement | en |
| dc.type | Thesis | en |