Design and Verification of Byzantine Fault Tolerant CRDTs

Add to your list(s) Download to your calendar using vCal

• Liangrun Da, Technical University of Munich
• Friday 15 November 2024, 14:00-15:00
• Webinar & FW11, Computer Laboratory, William Gates Building..

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:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Security Seminar
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• School of Technology
• Security-related talks
• Trust & Technology Initiative - interesting events
• Webinar & FW11, Computer Laboratory, William Gates Building.
• bld31

Note that ex-directory lists are not shown.