Master Thesis

Formalising Lockstep Protocols

In this work, we will look at the lockstep protocol [1] and formalise it. In a second step, we will explore the power of a lockstep functionality.

Prerequisites

Having an excellent understanding of the topics covered in the course “distributed algorithms” ([2]) and “cryptography” ([3]).

References

[1] Wiki-Entry

[2] Distributed Algorithms

[3]Cryptography

Contact David Lehnherr or François-Xavier Wicht for more information.

Nature of the project: Theory 100%