🤖 AI Summary
Byzantine fault-tolerant (BFT) systems lack write-authentication and non-repudiation guarantees for single-writer multi-reader (SWMR) registers. Method: This paper proposes verifiable SWMR and sticky registers—achieving register-level signature semantics without cryptographic digital signatures—under the assumption (n > 3f). It constructs these primitives via a distributed protocol built atop standard SWMR registers, leveraging consensus and verification mechanisms in the message-passing model, together with state-machine replication principles. Contribution/Results: The design ensures write immutability, public verifiability, and value relaying; introduces the “sticky” property to prevent Byzantine writers from denying or overwriting committed values; and provides a rigorous proof of optimal fault tolerance. This work establishes novel primitives for trusted storage and identity binding in BFT environments.
📝 Abstract
We define and show how to implement SWMR registers that provide properties of unforgeable digital signatures - without actually using such signatures - in systems with Byzantine processes. More precisely, we first define SWMR verifiable registers. Intuitively, processes can use these registers to write values as if they are ``signed'', such that these ``signed values'' can be ``verified'' by any process and ``relayed'' to any process. We give a signature-free implementation of such registers from plain SWMR registers in systems with $n>3f$ processes, $f$ of which can be Byzantine. We also give a signature-free implementation of SWMR sticky registers from SWMR registers in systems with $n>3f$ processes. Once the writer $p$ writes a value $v$ into a SWMR sticky register $R$, the register never changes its value. Note that the value $v$ can be considered ``signed'' by $p$: once $p$ writes $v$ in $R$, $p$ cannot change the value in $R$ or deny that it wrote $v$ in $R$, and every reader can verify that $p$ wrote $v$ just by reading $R$. This holds even if the writer $p$ of $R$ is Byzantine. We prove that our implementations are optimal in the number of Byzantine processes they can tolerate. Since SWMR registers can be implemented in message-passing systems with Byzantine processes and $n>3f$ [9], the results in this paper also show that one can implement verifiable registers and sticky registers in such systems.