Augusta Mukam

Augusta Mukam

I hold a PhD in distributed systems applied to blockchain technology obtained at University of Bordeaux, Labri, Progress Team

Sitemap

A list of all the posts and pages found on the site. For you robots out there is an XML version available for digesting as well.

Pages

Protocole collaboratif pour echantillonnage de pairs tolerant aux fautes byzantines

Published in Compas, 2025

Les blockchains sont des systèmes distribués avec des contraintes propres à satisfaire. Il faut par exemple s’assurer que les nœuds du système aient un état à jour dans des délais opportun, mais aussi que l’intégrité voir de la confidentialité des données soit préservée. Read more

Poster presentation, held in Annecy, France

Recommended citation: Augusta Mukam, Joachim Bruneau-Queyreix, Laurent Réveillère. Protocole collaboratif pour echantillonnage de pairs tolerant aux fautes byzantines, juin 2025, Bordeaux, France.
Download Paper | Download Slides

Posts

publications

Utilisation de noeuds de confiance pour les protocoles d’échantillonage de pairs tolérants aux attaques byzantines

Published in Compas, 2023

Les blockchains sont des systèmes distribués avec des contraintes propres à satisfaire. Il faut par exemple s’assurer que les nœuds du système aient un état à jour dans des délais opportun, mais aussi que l’intégrité voir de la confidentialité des données soit préservée. Read more

Poster presentation, held in Annecy, France

Recommended citation: Augusta Mukam, Joachim Bruneau-Queyreix, Laurent Réveillère. Utilisation de noeuds de confiance pour les protocoles d’échantillonnage de pairs tolérants aux attaques byzantines, juillet 2023, Annecy, France.
Download Paper | Download Slides

AUPE: Collaborative Byzantine fault-tolerant peer-sampling

Published in NCA, 2024

Peer sampling is a crucial primitive in distributed systems, used to manage overlays and disseminate information in large-scale scenarios such as permissionless blockchain systems. Its purpose is to maintain and regularly update a local and partial snapshot, or view, of the complete system’s membership. These protocols are often targeted by malicious actors who aim to disrupt higher-level protocols. Typically, an adversary who controls a set of Byzantine nodes attempts to manipulate how legitimate nodes perceive the presence of Byzantine ones by increasing their representation in the view of honest nodes. Read more

Received Best Paper award during the conference

Held in Bertinoro, Italy

Recommended citation: A. Mukam, J. Bruneau-Queyreix and L. Réveillère, "AUPE: Collaborative Byzantine fault-tolerant peer-sampling," 2024 22nd International Symposium on Network Computing and Applications (NCA), Bertinoro, Italy, 2024, pp. 17-24, doi: 10.1109/NCA61908.2024.00015. keywords: {Fault tolerance;Protocols;Limiting;Fault tolerant systems;Collaboration;Peer-to-peer computing;Blockchains;Object recognition;Resilience;Gossip;Peer Sampling;Distributed System;Byzantine tolerance;Eclipse Attacks},
Download Paper | Download Slides

Byzantine-Resilient Peer Sampling for Large-Scale Distributed Systems

Published in University of Bordeaux, 2026

Peer sampling services are foundational primitives in large-scale distributed systems, providing each node with a continuously refreshed, near-uniform view of the system membership. Gossip-based implementations are particularly well-suited to this task owing to their scalability, self-healing properties, and robustness to churn. However, in open, adversarial environments such as public blockchain networks, Byzantine nodes can systematically bias view exchanges, corrupting the sampling distribution and enabling attacks such as eclipse attacks, denial-of-service attacks, and manipulation of consensus protocols. This thesis addresses the problem of Byzantine-resilient gossip-based peer sampling and focuses on proposing scalable, memory-efficient solutions. Read more

Recommended citation: Augusta Mukam. (2026). "Byzantine-Resilient Peer Sampling for Large-Scale Distributed Systems." PhD Thesis, University of Bordeaux.
Download Paper | Download Slides

talks

teaching

Teaching Assistant

Pratical courses, Bordeaux INP - Enseirb Matmeca, Telecom Department, 2023

Courses:

  • Imperative Programming
  • Introduction to Operating Systems (with integrated lessons)
  • Network Programming

Tutoring

Internship tutoring, Bordeaux INP - Enseirb Matmeca, Telecom Department, 2024

Missions: 2A and 3A internships examiner and reporter

Teaching Assistant

Pratical courses, Bordeaux INP - Enseirb Matmeca, Telecom Department, 2024

Courses:

  • Imperative Programming
  • Introduction to Operating Systems (with integrated lessons)
  • Network Programming

Fellow Teaching Assistant (Ater)

168 hours of computer science courses, UF Info, University of Bordeaux, 2026

Courses:

  • L3 : Compilation (32 hours)
  • L2 : Algorithms for Tree Data Structures (56 hours)
  • M1 : Programming Project (34 hours)