LIPIcs - Leibniz International Proceedings in Informatics. 35th International Symposium on Distributed Computing (DISC 2021)
Publication date
01/01/2021
Field of study
We initiate the study of auditable storage emulations, which provide the capability for an auditor to report the previously executed reads in a register. We define the notion of auditable register and its properties, and establish tight bounds and impossibility results for auditable storage emulations in the presence of faulty base storage objects. Our formulation considers registers that securely store data using information dispersal (each base object stores only a block of the written value) and supporting fast reads (that complete in one communication round-trip). In such a scenario, given a maximum number f of faulty storage objects and a minimum number ? of data blocks required to recover a stored value, we prove that (R1) auditability is impossible if ? ? 2f; (R2) implementing a weak form of auditability requires ? ? 3f+1; and (R3) a stronger form of auditability is impossible. We also show that (R4) signing read requests generically overcomes the lower bound of weak auditability, while (R5 and R6) totally ordering operations or using non-fast reads enables strong auditability. These results establish that practical storage emulations need f to 2f additional objects compared to their original lower bounds to support auditability
An auditable register extends the classical register with an audit operation
that returns information on the read operations performed on the register. In
this paper, we study Byzantine resilient auditable register implementations in
an asynchronous message-passing system. Existing solutions implement the
auditable register on top of at least 4f+1 servers, where at most f can be
Byzantine. We show that 4f+1 servers are necessary to implement auditability
without communication between servers, or implement does not implement strong
auditability when relaxing the constraint on the servers' communication,
letting them interact with each other. In this setting, it exists a solution
using 3f+1 servers to implement a simple auditable atomic register. In this
work, we implement strong auditable register using 3f+1 servers with server to
server communication, this result reinforced that with communication between
servers, auditability (event strong auditability) does not come with an
additional cost in terms of the number of servers.Comment: 11 page