On the use of randomness extractors for practical committee selection
In this thesis, we look into the problem of forming and maintaining good committees that can represent a distributed network. The solution to this problem can be used as a sub-routine for Byzantine Agreement that only costs sub-quadratic message complexity. Most importantly, we make no cryptographic...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English en |
| Published: |
2020
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/11728 |