University of Cambridge > Talks.cam > Computer Laboratory Security Seminar > Design and Verification of Byzantine Fault Tolerant CRDTs

Design and Verification of Byzantine Fault Tolerant CRDTs

Download to your calendar using vCal

If you have a question about this talk, please contact Anna Talas .

Decentralized collaboration systems offer powerful solutions for various applications. For instance, Wikipedia currently requires significant operational costs to maintain its servers, but a decentralized alternative could run without such constraints. However, maintaining data consistency across peers remains challenging in such decentralized systems. While Conflict-free Replicated Data Types (СRDTs) can maintain consistency without central server, they lack resilience against Byzantine faults. This project introduces a framework for designing and verifying Byzantine Fault Tolerant (BFT) CRD Ts in Isabelle/HOL. It requires modest modifications to existing CRD Ts, and relies on minimal assumptions on the system.

This talk is part of the Computer Laboratory Security Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity