Safe Serializable Secure Scheduling - Transactions and the Trade-Off Between Security and Consistency

Explore a conference talk that delves into the complex relationship between security and consistency in distributed systems. Examine the concept of Safe Serializable Secure Scheduling and its application to transactions. Learn about information flow control, system state, monotonicity, and the stage commit process. Discover real-world examples, including the Patsys and hospital scenarios, to understand the practical implications of these concepts. Witness an attack demonstration and analyze an example program to grasp the intricacies of transaction stages. Gain insights from Cornell researchers as they present their findings at the 23rd ACM Conference on Computer and Communications Security, addressing the critical trade-offs between security and consistency in modern computing environments.

Introduction
Security and Consistency
Background
Example
Counter Example
Information Flow Control
System State
Monotonicity
Patsys example
Stage Commit
Information Linkage
Hospital Example
Attack Demonstration
Example Program
Transaction Stage
Questions