Bounds on information exchange for Byzantine agreement

Paper: [1]

• They show that \(\Omega(nt)\) is a lower bound for the number of signatures for any algorithm using authentication.
• For the number of messages in the authenticated case we prove the lower bound \(\Omega(n + t^{2})\).