"Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog ..."

Elette Boyle, Ran Cohen, Aarushi Goel (2021)

> Home

Details and statistics

DOI: 10.1145/3465084.3467897

access: closed

type: Conference or Workshop Paper

metadata version: 2025-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/podc/BoyleCG21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/podc/BoyleCG21
Elette Boyle, Ran Cohen, Aarushi Goel:
Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. PODC 2021: 319-330

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.