Léo Robert
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Léo Robert has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Pascal Lafourcade
Université Clermont Auvergne
18 shared publications - Daiki Miyahara
The University of Electro-Communications
9 shared publications - Takaaki Mizuki
Tohoku University
7 shared publications - Charles Olivier-Anclin
LIFO, Université d’Orléans, INSA Centre Val de Loire, Inria
3 shared publications - Gael Marcadet
Université Clermont-Auvergne, CNRS, Clermont-Auvergne-INP, LIMOS, Clermont-Ferrand, France
3 shared publications Pascal Lafourcade
Université Clermont-Auvergne, CNRS, Mines de Saint-Étienne, LIMOS
3 shared publications
Latest Publications
- 23 October 2026
- Published by Zimbabwe Ezekiel Guti University Press in Ngenani: The Zimbabwe Ezekiel Guti Journal of Community Engagement and Societal Transformations
- p. 161-193
Understanding Barriers to Accessing Mental Health Services in Zimbabwe: A Qualitative Study at Parirenyatwa Psychiatric Hospital Annexe
Access to mental health services remains a major public health challenge in Zimbabwe despite the increasing burden of mental health disorders. This study explores barriers to accessing mental health services from the perspectives of patients and healthcare providers at Parirenyatwa Psychiatric Hospital Annexe in Harare, Zimbabwe. A qualitative case study, employing a phenomenological approach, was adopted to understand participants' lived experiences. Purposive sampling was used to recruit ten (10) participants comprising five (5) mental health patients and five (5) healthcare providers. Data were collected through semi-structured in-depth interviews and key informant interviews and analyzed using thematic analysis. The findings reveal that stigma and discrimination are the most significant barriers to accessing mental health services, discouraging individuals from seeking timely professional care. Financial constraints, including the high cost of transportation, consultation and medication, further limited service utilisation. Participants also highlighted inadequate mental health awareness, misconceptions regarding mental illness and the continued influence of cultural and traditional beliefs as major obstacles to accessing treatment. Healthcare providers reported systemic challenges, including shortages of trained mental health professionals, inadequate infrastructure and resources and weaknesses in mental health policy implementation, all of which compromised service delivery. Participants recommended increased investment in mental health services, strengthened public awareness campaigns, policy reforms, workforce development and greater integration of mental health into primary healthcare. The study concludes that improving access to mental health services in Zimbabwe requires coordinated interventions that address structural, socioeconomic and sociocultural barriers, while strengthening the capacity of the healthcare system. The findings provide evidence to inform mental health policy, social work practice and future interventions aimed at improving equitable access to quality mental healthcare in Zimbabwe.
- 23 October 2026
- Published by Zimbabwe Ezekiel Guti University Press in Ngenani: The Zimbabwe Ezekiel Guti Journal of Community Engagement and Societal Transformations
- p. 161-193
Understanding Barriers to Accessing Mental Health Services in Zimbabwe: A Qualitative Study at Parirenyatwa Psychiatric Hospital Annexe
Access to mental health services remains a major public health challenge in Zimbabwe despite the increasing burden of mental health disorders. This study explores barriers to accessing mental health services from the perspectives of patients and healthcare providers at Parirenyatwa Psychiatric Hospital Annexe in Harare, Zimbabwe. A qualitative case study, employing a phenomenological approach, was adopted to understand participants' lived experiences. Purposive sampling was used to recruit ten (10) participants comprising five (5) mental health patients and five (5) healthcare providers. Data were collected through semi-structured in-depth interviews and key informant interviews and analyzed using thematic analysis. The findings reveal that stigma and discrimination are the most significant barriers to accessing mental health services, discouraging individuals from seeking timely professional care. Financial constraints, including the high cost of transportation, consultation and medication, further limited service utilisation. Participants also highlighted inadequate mental health awareness, misconceptions regarding mental illness and the continued influence of cultural and traditional beliefs as major obstacles to accessing treatment. Healthcare providers reported systemic challenges, including shortages of trained mental health professionals, inadequate infrastructure and resources and weaknesses in mental health policy implementation, all of which compromised service delivery. Participants recommended increased investment in mental health services, strengthened public awareness campaigns, policy reforms, workforce development and greater integration of mental health into primary healthcare. The study concludes that improving access to mental health services in Zimbabwe requires coordinated interventions that address structural, socioeconomic and sociocultural barriers, while strengthening the capacity of the healthcare system. The findings provide evidence to inform mental health policy, social work practice and future interventions aimed at improving equitable access to quality mental healthcare in Zimbabwe.
- 7 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Design and analysis of provably secure protocols : Applications to messaging and attestation
Conceptions et analyses de protocoles en sécurité prouvable : applications aux messageries et à l'attestation: La Sécurité Après-Compromission (PCS pour Post-Compromise Security) est une propriété de sécurité concernant les schémas d'établissement de canal sécurisé. Elle vise à limiter les failles de sécurité que pourrait introduire un attaquant en compromettant un utilisateur. Le phénomène de guérison, qui est le résultat de la PCS, permet d'éjecter l'attaquant ce qui rend le canal à nouveau sécurisé. Cette propriété intéressante, surtout depuis les révélations d'Edward Snowden concernant la surveillance de masse, se retrouve dans la plupart des protocoles de messageries populaires, notamment Signal. Dans cette thèse, nous présentons dans un premier temps deux variantes de Signal; ces deux protocoles (MARSHAL et SAMURAI) sont construits pour améliorer la propriété de PCS. En faisant l'observation que la PCS n'est pas une propriété binaire mais plutôt un spectre de possibilités, nous proposons dans un second chapitre un modèle pour quantifier et comparer la PCS en fonction du type d'adversaire considéré. Nous détaillerons d'ailleurs tous les adversaires possibles pour notre contexte. La généralité et flexibilité de notre approche nous permet de modéliser une vaste diversité de protocoles, en particulier Signal mais aussi une nos variante décrite dans le premier chapitre, ainsi qu'une autre variante (SAID) de Signal mais basé sur l'identité. Un dernier cas est analysé, montrant l'expressivité de notre modèle, celui d'une série de procédure pour le réseau 5G nommée protocoles relais. L'étude de ce dernier cas nous amène à proposer une amélioration concernant la PCS pour un protocole de relais.La dernière partie de cette thèse se concentre sur un problème lié à la sécurité, l'attestation dans le contexte de virtualisation. L'attestation en profondeur, un type d'attestation, permet de vérifier l'intégrité d'une plateforme à l'aide d'un serveur de vérification à distance. Nous nous concentrons sur l'attestation d'hyperviseurs et de machines virtuelles. Il existe deux solutions standardisées, la première permet d'attester l'hyperviseur et la machine virtuelle en même temps alors que la deuxième permet d'attester indépendamment ces deux composants. Nous proposons une solution qui regroupe les avantages de ces deux alternatives (sécurisé et efficace) dans un modèle inédit. Le but est de formaliser un modèle de sécurité visant à prouver la sécurité de notre approche.
- 7 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Design and analysis of provably secure protocols : Applications to messaging and attestation
Conceptions et analyses de protocoles en sécurité prouvable : applications aux messageries et à l'attestation: La Sécurité Après-Compromission (PCS pour Post-Compromise Security) est une propriété de sécurité concernant les schémas d'établissement de canal sécurisé. Elle vise à limiter les failles de sécurité que pourrait introduire un attaquant en compromettant un utilisateur. Le phénomène de guérison, qui est le résultat de la PCS, permet d'éjecter l'attaquant ce qui rend le canal à nouveau sécurisé. Cette propriété intéressante, surtout depuis les révélations d'Edward Snowden concernant la surveillance de masse, se retrouve dans la plupart des protocoles de messageries populaires, notamment Signal. Dans cette thèse, nous présentons dans un premier temps deux variantes de Signal; ces deux protocoles (MARSHAL et SAMURAI) sont construits pour améliorer la propriété de PCS. En faisant l'observation que la PCS n'est pas une propriété binaire mais plutôt un spectre de possibilités, nous proposons dans un second chapitre un modèle pour quantifier et comparer la PCS en fonction du type d'adversaire considéré. Nous détaillerons d'ailleurs tous les adversaires possibles pour notre contexte. La généralité et flexibilité de notre approche nous permet de modéliser une vaste diversité de protocoles, en particulier Signal mais aussi une nos variante décrite dans le premier chapitre, ainsi qu'une autre variante (SAID) de Signal mais basé sur l'identité. Un dernier cas est analysé, montrant l'expressivité de notre modèle, celui d'une série de procédure pour le réseau 5G nommée protocoles relais. L'étude de ce dernier cas nous amène à proposer une amélioration concernant la PCS pour un protocole de relais.La dernière partie de cette thèse se concentre sur un problème lié à la sécurité, l'attestation dans le contexte de virtualisation. L'attestation en profondeur, un type d'attestation, permet de vérifier l'intégrité d'une plateforme à l'aide d'un serveur de vérification à distance. Nous nous concentrons sur l'attestation d'hyperviseurs et de machines virtuelles. Il existe deux solutions standardisées, la première permet d'attester l'hyperviseur et la machine virtuelle en même temps alors que la deuxième permet d'attester indépendamment ces deux composants. Nous proposons une solution qui regroupe les avantages de ces deux alternatives (sécurisé et efficace) dans un modèle inédit. Le but est de formaliser un modèle de sécurité visant à prouver la sécurité de notre approche.
- 1 November 2025
- Published by Springer Nature
- p. 103-117
Tilepaint and Aquarium Puzzles in Periodic Grids
- 1 November 2025
- Published by Springer Nature
- p. 103-117
Tilepaint and Aquarium Puzzles in Periodic Grids
- Open Access
- 24 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 231-247
Post-Compromise Security with Application-Level Key-Controls – with a comprehensive study of the 5G AKMA protocol
- 24 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 231-247
Open AccessPost-Compromise Security with Application-Level Key-Controls – with a comprehensive study of the 5G AKMA protocol
- 1 December 2024
- Published by Tsinghua University Press in Tsinghua Science and Technology
- Vol. 29 (6) , 1651-1666
ZKP Protocols for Usowan, Herugolf, and Five Cells
A Zero-Knowledge Proof (ZKP) protocol allows a participant to prove the knowledge of some secret without revealing any information about it. While such protocols are typically executed by computers, there exists a line of research proposing physical instances of ZKP protocols. Up to now, many card-based ZKP protocols for pen-and-pencil puzzles, like Sudoku, have been designed. Those games, mostly edited by Nikoli, have simple rules, yet designing them in card-based ZKP protocols is non-trivial. In this work, we propose a card-based ZKP protocol for Usowan, a Nikoli game. In Usowan, for each room of a puzzle instance, there is exactly one piece of false information. The goal of the game is to detect this wrong data amongst the correct data and also to satisfy the other rules. Designing a card-based ZKP protocol to deal with the property of detecting a liar has never been done. In some sense, we propose a physical ZKP for hiding of a liar. This work extends a previous paper appearing in Ref. [1]. In this extension, we propose two other protocols, for Herugolf and Five Cells. The puzzles are specifically chosen because each of those three puzzles shares a common constraint, connectivity. However, showing the connected configuration cannot be done with generic approach and brings new construction to the existing connectivity ZKP protocol. Indeed, in Herugolf, the connectivity is handled with a given length of cell which is decremental (i.e., the length of each connected cell decreases by one at each step). For Five Cells, there is an additional step in the setup allowing to encode all the information needed to ensure a valid ZKP protocol.
- 1 December 2024
- Published by Tsinghua University Press in Tsinghua Science and Technology
- Vol. 29 (6) , 1651-1666
ZKP Protocols for Usowan, Herugolf, and Five Cells
A Zero-Knowledge Proof (ZKP) protocol allows a participant to prove the knowledge of some secret without revealing any information about it. While such protocols are typically executed by computers, there exists a line of research proposing physical instances of ZKP protocols. Up to now, many card-based ZKP protocols for pen-and-pencil puzzles, like Sudoku, have been designed. Those games, mostly edited by Nikoli, have simple rules, yet designing them in card-based ZKP protocols is non-trivial. In this work, we propose a card-based ZKP protocol for Usowan, a Nikoli game. In Usowan, for each room of a puzzle instance, there is exactly one piece of false information. The goal of the game is to detect this wrong data amongst the correct data and also to satisfy the other rules. Designing a card-based ZKP protocol to deal with the property of detecting a liar has never been done. In some sense, we propose a physical ZKP for hiding of a liar. This work extends a previous paper appearing in Ref. [1]. In this extension, we propose two other protocols, for Herugolf and Five Cells. The puzzles are specifically chosen because each of those three puzzles shares a common constraint, connectivity. However, showing the connected configuration cannot be done with generic approach and brings new construction to the existing connectivity ZKP protocol. Indeed, in Herugolf, the connectivity is handled with a given length of cell which is decremental (i.e., the length of each connected cell decreases by one at each step). For Five Cells, there is an additional step in the setup allowing to encode all the information needed to ensure a valid ZKP protocol.
- Open Access
- 19 August 2024
- Published by Springer Nature in New Generation Computing
- Vol. 42 (3) , 449-477
Efficient Card-Based ZKP for Single Loop Condition and Its Application to Moon-or-Sun
A zero-knowledge proof (ZKP) allows a prover to prove to a verifier that it knows some secret, such as a solution to a difficult puzzle, without revealing any information about it. In recent years, ZKP protocols using only a deck of playing cards for solutions to various pencil puzzles have been proposed. The previous work of Lafourcade et al. deals with a famous puzzle called Slitherlink. Their proposed protocol can verify that a solution forms a single loop without revealing anything about the solution, except this fact. Their protocol guarantees that the solution satisfies the single-loop condition, by interactively constructing a solution starting from a state that holds a simple single loop, and proceeding via steps that preserve the invariant of encoding a single loop, until the proper solution is reached. A drawback of their protocol is that it requires additional verifications to guarantee a single loop. In this study, we propose a more efficient ZKP protocol for such a puzzle with fewer additional verifications. For this, we employ the previous work of Robert et al., which addressed the connectivity property in a puzzle. That is, we verify that a solution is connected but not split, to be a single loop. Applying our proposal, we construct a card-based ZKP protocol for Moon-or-Sun, which has its specific rule of alternating pattern in addition to the single-loop condition.
- 19 August 2024
- Published by Springer Nature in New Generation Computing
- Vol. 42 (3) , 449-477
Open AccessEfficient Card-Based ZKP for Single Loop Condition and Its Application to Moon-or-Sun
A zero-knowledge proof (ZKP) allows a prover to prove to a verifier that it knows some secret, such as a solution to a difficult puzzle, without revealing any information about it. In recent years, ZKP protocols using only a deck of playing cards for solutions to various pencil puzzles have been proposed. The previous work of Lafourcade et al. deals with a famous puzzle called Slitherlink. Their proposed protocol can verify that a solution forms a single loop without revealing anything about the solution, except this fact. Their protocol guarantees that the solution satisfies the single-loop condition, by interactively constructing a solution starting from a state that holds a simple single loop, and proceeding via steps that preserve the invariant of encoding a single loop, until the proper solution is reached. A drawback of their protocol is that it requires additional verifications to guarantee a single loop. In this study, we propose a more efficient ZKP protocol for such a puzzle with fewer additional verifications. For this, we employ the previous work of Robert et al., which addressed the connectivity property in a puzzle. That is, we verify that a solution is connected but not split, to be a single loop. Applying our proposal, we construct a card-based ZKP protocol for Moon-or-Sun, which has its specific rule of alternating pattern in addition to the single-loop condition.
- 3 July 2024
- Published by Springer Nature
- p. 174-198
iUC-Secure Distributed File Transfer from Standard Attribute-Based Encryption
- 3 July 2024
- Published by Springer Nature
- p. 174-198
iUC-Secure Distributed File Transfer from Standard Attribute-Based Encryption
- 24 August 2023
- Published by Springer Nature
- p. 255-272
Check Alternating Patterns: A Physical Zero-Knowledge Proof for Moon-or-Sun
- 24 August 2023
- Published by Springer Nature
- p. 255-272
Check Alternating Patterns: A Physical Zero-Knowledge Proof for Moon-or-Sun