Breaking the $O(\sqrt{n})$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party.

Elette Boyle Ran Cohen Aarushi Goel

Published in: J. Cryptol. (2024)

Keyphrases

error correcting codes
s box
gray code
fault tolerant
relative error
block cipher
bit string
significant bit
lower bound
worst case
multi party
weighted majority
iris code
neural network
hamming distance
error correction
magnetic tape
least significant bit