An Authenticated Byzantine Generals Algorithm with Early Stopping

Abstract

A protocol that solves the authenticated Byzantine General's Problem is presented. It is proved correct and shown to exhibit early stopping under the condition that fewer than half the processes are faulty.