Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party
- Award ID(s):
- 1942789
- PAR ID:
- 10337534
- Date Published:
- Journal Name:
- PODC 2021
- Page Range / eLocation ID:
- 319 to 330
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
An official website of the United States government

