Small Trusted Primitives for Dependable Systems Petros Maniatis Intel Labs Berkeley Byung-Gon Chun Intel Labs Berkeley ABSTRACT Secure, fault-tolerant distributed systems are di cult to build, to validate, and to operate. Conservative design for such systems dictates that their security and fault tolerance depend on a very small number of assumptions taken on faith; such assumptions are typically called the trusted computing base (TCB) of a system. However, a rich trade-o exists between larger TCBs and more secure, more faulttolerant, or more e cient systems. In our recent work, we have explored this trade-o by de ning small, generic trusted primitives for example, an attested, monotonically sequenced FIFO bu er of a few hundred machine words guaranteed to hold appended words until eviction and showing how such primitives can improve the performance, fault tolerance, and security of systems using them. In this article, we review our e orts in generating simple trusted primitives such as an attested circular bu er (called Attested Appendonly Memory), and an attested human activity detector. We describe the bene ts of using these primitives to increase the fault-tolerance of replicated systems and archival storage, and to improve the
/lp/association-for-computing-machinery/small-trusted-primitives-for-dependable-systems-OSutxsG5ia