Applying consensus and replication securely with FLAQR
Paper i proceeding, 2022

Availability is crucial to the security of distributed systems, but guaranteeing availability is hard, especially when participants in the system may act maliciously. Quorum replication protocols provide both integrity and availability: data and computation is replicated at multiple independent hosts, and a quorum of these hosts must agree on the output of all operations applied to the data. Unfortunately, these protocols have high overhead and can be difficult to calibrate for a specific application's needs. Ideally, developers could use high-level abstractions for consensus and replication to write fault-tolerant code by that is secure by construction. This paper presents Flow-Limited Authorization for Quorum Replication (FLAQR), a core calculus for building distributed applications with heterogeneous quorum replication protocols while enforcing end-to-end information security. Our type system ensures that well-typed FLAQR programs cannot fail (experience an unrecoverable error) in ways that violate their type-level specifications. We present noninterference theorems that characterize FLAQR's confidentiality, integrity, and availability in the presence of consensus, replication, and failures, as well as a liveness theorem for the class of majority quorum protocols under a bounded number of faults.

replication

consensus

fault tolerance

type system

information flow

Författare

Priyanka Mondal

University of California

Maximilian Algehed

Chalmers, Data- och informationsteknik, Funktionell programmering

Owen Arden

University of California

Proceedings - IEEE Computer Security Foundations Symposium

19401434 (ISSN)

Vol. 2022-August 163-178
9781665484176 (ISBN)

35th IEEE Computer Security Foundations Symposium, CSF 2022
Haifa, Israel,

Ämneskategorier

Datorteknik

Inbäddad systemteknik

Datorsystem

DOI

10.1109/CSF54842.2022.9919637

Mer information

Senast uppdaterat

2023-11-24