NDLI: Attested append-only memory:making adversaries stick to their word

Content Provider	ACM Digital Library
Author	Chun, Byung-Gon Shenker, Scott Maniatis, Petros Kubiatowicz, John
Abstract	Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limits to how much can be done with entirely untrusted components; for example, replicated state machines cannot tolerate more than a third of their replica population being Byzantine. In this paper, we investigate how minimal trusted abstractions can push through these hard limits in practical ways. We propose Attested Append-Only Memory (A2M), a trusted system facility that is small, easy to implement and easy to verify formally. A2M provides the programming abstraction of a trusted log, which leads to protocol designs immune to equivocation -- the ability of a faulty host to lie in different ways to different clients or servers -- which is a common source of Byzantine headaches. Using A2M, we improve upon the state of the art in Byzantine-fault tolerant replicated state machines, producing A2M-enabled protocols (variants of Castro and Liskov's PBFT) that remain correct (linearizable) and keep making progress (live) even when half the replicas are faulty, in contrast to the previous upper bound. We also present an A2M-enabled single-server shared storage protocol that guarantees linearizability despite server faults. We implement A2M and our protocols, evaluate them experimentally through micro- and macro-benchmarks, and argue that the improved fault tolerance is cost-effective for a broad range of uses, opening up new avenues for practical, more reliable services.
Ending Page	204
Page Count	16
Starting Page	189
File Format	PDF MP4 MP2 / MPA / MP3
ISSN	01635980
DOI	10.1145/1323293.1294280
Journal	ACM SIGOPS Operating Systems Review (OPSR)
Issue Number	6
Volume Number	41
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1975-04-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Attested append-only memory Shared storage Equivocation Replicated state machines Byzantine-fault tolerance
Content Type	Audio Text
Resource Type	Article
Subject	Computer Networks and Communications Hardware and Architecture Information Systems

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Attested append-only memory: making adversaries stick to their word

Attested append-only memory: Making adversaries stick to their word (2007)

Attested append-only memory: making adversaries stick to their word (2007)

Fault-scalable Byzantine fault-tolerant services

Low-overhead byzantine fault-tolerant storage

Zyzzyva:speculative byzantine fault tolerance

RBFT: Redundant Byzantine Fault Tolerance

Tolerating byzantine faults in transaction processing systems using commit barrier scheduling

Separating the WHEAT from the Chaff: An Empirical Design for Geo-Replicated State Machines

Attested append-only memory:making adversaries stick to their word

Similar Documents

Attested append-only memory: making adversaries stick to their word

Attested append-only memory: Making adversaries stick to their word (2007)

Attested append-only memory: making adversaries stick to their word (2007)

Fault-scalable Byzantine fault-tolerant services

Low-overhead byzantine fault-tolerant storage

Zyzzyva:speculative byzantine fault tolerance

RBFT: Redundant Byzantine Fault Tolerance

Tolerating byzantine faults in transaction processing systems using commit barrier scheduling

Separating the WHEAT from the Chaff: An Empirical Design for Geo-Replicated State Machines

Attested append-only memory:making adversaries stick to their word