Julien Béguinot
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Julien Béguinot has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Olivier Rioul
LTCI, Télécom Paris, Institut Polytechnique de Paris
4 shared publications - Antoine Souloumiac
CEA-List, Université Paris-Saclay, 91120 Palaiseau, France
2 shared publications - Sylvain Guilley
Secure-IC S.A.S. and Télécom Paris
2 shared publications - Wei Cheng
LTCI, Télécom Paris, Institut Polytechnique de Paris, Palaiseau, France
2 shared publications Idris Delsol
LTCI Télécom Paris Institut Polytechnique de Paris 91120 Palaiseau France
1 shared publication- Idris Delsol
Laboratoire de Traitement et Communication de l’Information, Télécom Paris, Institut Polytechnique de Paris, 91120 Palaiseau, France
1 shared publication
Latest Publications
- 9 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Evaluation of Information Leakage in Side Channels
Évaluation de fuites d'information sur les canaux adjacents: Un algorithme de chiffrement symétrique est considéré comme robuste face à la cryptanalyse lorsqu'on le voit comme une fonction qui associe une clé secrète et un message en clair à un chiffré. Cependant, le calcul de cette fonction peut révéler des informations sensibles sur la clé secrète manipulée par le circuit matériel sous-jacent. Les attaques correspondantes sont dévastatrices si aucune contre-mesure appropriée n'est mise en œuvre. Des contre-mesures doivent être implé-mentées et les fuites d'une implémentation doivent être évaluées par un laboratoire de certification avant son déploiement. Le masquage consiste à faire un secret sharing sur les fils du circuit. L'objectif de ma thèse est d'exploiter des outils de théorie de l'information afin d'améliorer le processus de certification des fuites d'une implémentation masquée.Premièrement, j'obtiens des bornes informationnelles sur plusieurs mesures opérationnelles du succès d'un adversaire (typiquement le taux de succès et l'entropie de divination). Pour ceci j'utilise des variantes de l'inégalité de Fano et de l'inégalité de Gibbs.Deuxièmement, j'obtiens des bornes sur la fuite d'une variable sensible à partir des mesures de fuites de chacune de ses parts secrètes. Cette approche équivaut à obtenir des variantes du lemme de Mrs Gerber.Troisièmement, j'obtiens une borne de sécurité en présence de calculs, en particulier en présence de multiplications. Pour cela j'utilise le coefficient de Doeblin pour réduire les canaux auxiliaires à des canaux à effacement beaucoup plus simples.En reliant les trois contributions ci-dessus, j'obtiens une méthode d'évaluation plus rapidepour les laboratoires.Bien que cette thèse soit motivée par des problèmes concrets, elle repose essentiellementsur la théorie de l'information. Les fuites d'information sont mesurées par l'α-information de Sibson. Jeprête attention aux propriétés mathématiques souhaitables d'une mesure de fuites telles que les inégalités de traitement de données, la tensorisation, l'inégalité de Gibbs et le lemme de Mrs Gerber.
- 9 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Evaluation of Information Leakage in Side Channels
Évaluation de fuites d'information sur les canaux adjacents: Un algorithme de chiffrement symétrique est considéré comme robuste face à la cryptanalyse lorsqu'on le voit comme une fonction qui associe une clé secrète et un message en clair à un chiffré. Cependant, le calcul de cette fonction peut révéler des informations sensibles sur la clé secrète manipulée par le circuit matériel sous-jacent. Les attaques correspondantes sont dévastatrices si aucune contre-mesure appropriée n'est mise en œuvre. Des contre-mesures doivent être implé-mentées et les fuites d'une implémentation doivent être évaluées par un laboratoire de certification avant son déploiement. Le masquage consiste à faire un secret sharing sur les fils du circuit. L'objectif de ma thèse est d'exploiter des outils de théorie de l'information afin d'améliorer le processus de certification des fuites d'une implémentation masquée.Premièrement, j'obtiens des bornes informationnelles sur plusieurs mesures opérationnelles du succès d'un adversaire (typiquement le taux de succès et l'entropie de divination). Pour ceci j'utilise des variantes de l'inégalité de Fano et de l'inégalité de Gibbs.Deuxièmement, j'obtiens des bornes sur la fuite d'une variable sensible à partir des mesures de fuites de chacune de ses parts secrètes. Cette approche équivaut à obtenir des variantes du lemme de Mrs Gerber.Troisièmement, j'obtiens une borne de sécurité en présence de calculs, en particulier en présence de multiplications. Pour cela j'utilise le coefficient de Doeblin pour réduire les canaux auxiliaires à des canaux à effacement beaucoup plus simples.En reliant les trois contributions ci-dessus, j'obtiens une méthode d'évaluation plus rapidepour les laboratoires.Bien que cette thèse soit motivée par des problèmes concrets, elle repose essentiellementsur la théorie de l'information. Les fuites d'information sont mesurées par l'α-information de Sibson. Jeprête attention aux propriétés mathématiques souhaitables d'une mesure de fuites telles que les inégalités de traitement de données, la tensorisation, l'inégalité de Gibbs et le lemme de Mrs Gerber.
- Open Access
- 5 June 2025
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Cryptographic Hardware and Embedded Systems
- Vol. 2025 (3) , 32-55
On the Average Random Probing Model
Masking is one of the main countermeasures against side-channel analysis since it relies on provable security. In this context, “provable” means that a security bound can be exhibited for the masked implementation through a theoretical analysis in a given threat model. The main goal in this line of research is therefore to provide the tightest security bound, in the most realistic model, in the most generic way. Yet, all of these objectives cannot be reached together. That is why the masking literature has introduced a large spectrum of threat models and reductions between them, depending on the desired trade-off with respect to these three goals. In this paper, we focus on three threat models, namely the noisy-leakage model (realistic yet hard to work with), the random probing (unrealistic yet easy to work with), and more particularly a third intermediate model called average random probing. Average random probing has been introduced by Dziembowski et al. at Eurocrypt 2015, in order to exhibit a tight reduction between noisy-leakage and random probing models, recently proven by Brian et al. at Eurocrypt 2024. This milestone has strong practical consequences, since otherwise the reduction from the noisy leakage model to the random probing model introduces a prohibitively high constant factor in the security bound, preventing security evaluators to use it in practice. However, we exhibit a gap between the average random probing definitions of Dziembowski et al. (denoted hereafter by DFS-ARP) and Brian et al. (simply denoted by ARP). Whereas any noisy leakage can be tightly reduced to DFS-ARP, we show in this paper that it cannot be tightly reduced to ARP, unless requiring extra assumptions, e.g., if the noisy leakage is deterministic. Our proof techniques do not involve more tools than the one used so far in such reductions, namely basic probability facts, and known properties of the total variation distance. As a consequence, the reduction from the noisy leakage to the random probing — without high constant factor — remains unproven. This stresses the need to clarify the practical relevance of analyzing the security of masking in the random probing model since most of the current efforts towards improving the constructions and their security proofs in the random probing model might be hindered by potentially unavoidable loss in the reduction from more realistic but currently less investigated leakage models.
- 5 June 2025
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Cryptographic Hardware and Embedded Systems
- Vol. 2025 (3) , 32-55
Open AccessOn the Average Random Probing Model
Masking is one of the main countermeasures against side-channel analysis since it relies on provable security. In this context, “provable” means that a security bound can be exhibited for the masked implementation through a theoretical analysis in a given threat model. The main goal in this line of research is therefore to provide the tightest security bound, in the most realistic model, in the most generic way. Yet, all of these objectives cannot be reached together. That is why the masking literature has introduced a large spectrum of threat models and reductions between them, depending on the desired trade-off with respect to these three goals. In this paper, we focus on three threat models, namely the noisy-leakage model (realistic yet hard to work with), the random probing (unrealistic yet easy to work with), and more particularly a third intermediate model called average random probing. Average random probing has been introduced by Dziembowski et al. at Eurocrypt 2015, in order to exhibit a tight reduction between noisy-leakage and random probing models, recently proven by Brian et al. at Eurocrypt 2024. This milestone has strong practical consequences, since otherwise the reduction from the noisy leakage model to the random probing model introduces a prohibitively high constant factor in the security bound, preventing security evaluators to use it in practice. However, we exhibit a gap between the average random probing definitions of Dziembowski et al. (denoted hereafter by DFS-ARP) and Brian et al. (simply denoted by ARP). Whereas any noisy leakage can be tightly reduced to DFS-ARP, we show in this paper that it cannot be tightly reduced to ARP, unless requiring extra assumptions, e.g., if the noisy leakage is deterministic. Our proof techniques do not involve more tools than the one used so far in such reductions, namely basic probability facts, and known properties of the total variation distance. As a consequence, the reduction from the noisy leakage to the random probing — without high constant factor — remains unproven. This stresses the need to clarify the practical relevance of analyzing the security of masking in the random probing model since most of the current efforts towards improving the constructions and their security proofs in the random probing model might be hindered by potentially unavoidable loss in the reduction from more realistic but currently less investigated leakage models.
- 17 August 2024
- Published by Springer Nature
- p. 389-426
Formal Security Proofs via Doeblin Coefficients:
- 17 August 2024
- Published by Springer Nature
- p. 389-426
Formal Security Proofs via Doeblin Coefficients:
- Open Access
An Information Theoretic Condition for Perfect Reconstruction
A new information theoretic condition is presented for reconstructing a discrete random variable X based on the knowledge of a set of discrete functions of X. The reconstruction condition is derived from Shannon’s 1953 lattice theory with two entropic metrics of Shannon and Rajski. Because such a theoretical material is relatively unknown and appears quite dispersed in different references, we first provide a synthetic description (with complete proofs) of its concepts, such as total, common, and complementary information. The definitions and properties of the two entropic metrics are also fully detailed and shown to be compatible with the lattice structure. A new geometric interpretation of such a lattice structure is then investigated, which leads to a necessary (and sometimes sufficient) condition for reconstructing the discrete random variable X given a set of elements in the lattice generated by X. Intuitively, the components of the original source of information X should not be globally “too far away” from X in the entropic distance in order that X is reconstructable. In other words, these components should not overall have too low of a dependence on X; otherwise, reconstruction is impossible. These geometric considerations constitute a starting point for a possible novel “perfect reconstruction theory”, which needs to be further investigated and improved along these lines. Finally, this condition is illustrated in five specific examples of perfect reconstruction problems: the reconstruction of a symmetric random variable from the knowledge of its sign and absolute value, the reconstruction of a word from a set of linear combinations, the reconstruction of an integer from its prime signature (fundamental theorem of arithmetic) and from its remainders modulo a set of coprime integers (Chinese remainder theorem), and the reconstruction of the sorting permutation of a list from a minimal set of pairwise comparisons.Open AccessAn Information Theoretic Condition for Perfect Reconstruction
A new information theoretic condition is presented for reconstructing a discrete random variable X based on the knowledge of a set of discrete functions of X. The reconstruction condition is derived from Shannon’s 1953 lattice theory with two entropic metrics of Shannon and Rajski. Because such a theoretical material is relatively unknown and appears quite dispersed in different references, we first provide a synthetic description (with complete proofs) of its concepts, such as total, common, and complementary information. The definitions and properties of the two entropic metrics are also fully detailed and shown to be compatible with the lattice structure. A new geometric interpretation of such a lattice structure is then investigated, which leads to a necessary (and sometimes sufficient) condition for reconstructing the discrete random variable X given a set of elements in the lattice generated by X. Intuitively, the components of the original source of information X should not be globally “too far away” from X in the entropic distance in order that X is reconstructable. In other words, these components should not overall have too low of a dependence on X; otherwise, reconstruction is impossible. These geometric considerations constitute a starting point for a possible novel “perfect reconstruction theory”, which needs to be further investigated and improved along these lines. Finally, this condition is illustrated in five specific examples of perfect reconstruction problems: the reconstruction of a symmetric random variable from the knowledge of its sign and absolute value, the reconstruction of a word from a set of linear combinations, the reconstruction of an integer from its prime signature (fundamental theorem of arithmetic) and from its remainders modulo a set of coprime integers (Chinese remainder theorem), and the reconstruction of the sorting permutation of a list from a minimal set of pairwise comparisons. - 24 August 2023
- Published by Springer Nature
- p. 36-56
Reliability of Ring Oscillator PUFs with Reduced Helper Data
- 24 August 2023
- Published by Springer Nature
- p. 36-56
Reliability of Ring Oscillator PUFs with Reduced Helper Data
- Open Access
An information theoretic necessary condition for perfect reconstruction
A new information theoretic condition is presented for reconstructing a discrete random variable $X$ based on the knowledge of a set of discrete functions of $X$. The reconstruction condition is derived from Shannon's 1953 lattice theory with two entropic metrics of Shannon and Rajski. Because such a theoretical material is relatively unknown and appears quite dispersed in different references, we first provide a synthetic description (with complete proofs) of its concepts, such as total, common and complementary informations. Definitions and properties of the two entropic metrics are also fully detailed and shown compatible with the lattice structure. A new geometric interpretation of such a lattice structure is then investigated that leads to a necessary (and sometimes sufficient) condition for reconstructing the discrete random variable $X$ given a set $\{ X_1,\ldots,X_{n} \}$ of elements in the lattice generated by $X$. Finally, this condition is illustrated in five specific examples of perfect reconstruction problems: reconstruction of a symmetric random variable from the knowledge of its sign and absolute value, reconstruction of a word from a set of linear combinations, reconstruction of an integer from its prime signature (fundamental theorem of arithmetic) and from its remainders modulo a set of coprime integers (Chinese remainder theorem), and reconstruction of the sorting permutation of a list from a minimal set of pairwise comparisons.Open AccessAn information theoretic necessary condition for perfect reconstruction
A new information theoretic condition is presented for reconstructing a discrete random variable $X$ based on the knowledge of a set of discrete functions of $X$. The reconstruction condition is derived from Shannon's 1953 lattice theory with two entropic metrics of Shannon and Rajski. Because such a theoretical material is relatively unknown and appears quite dispersed in different references, we first provide a synthetic description (with complete proofs) of its concepts, such as total, common and complementary informations. Definitions and properties of the two entropic metrics are also fully detailed and shown compatible with the lattice structure. A new geometric interpretation of such a lattice structure is then investigated that leads to a necessary (and sometimes sufficient) condition for reconstructing the discrete random variable $X$ given a set $\{ X_1,\ldots,X_{n} \}$ of elements in the lattice generated by $X$. Finally, this condition is illustrated in five specific examples of perfect reconstruction problems: reconstruction of a symmetric random variable from the knowledge of its sign and absolute value, reconstruction of a word from a set of linear combinations, reconstruction of an integer from its prime signature (fundamental theorem of arithmetic) and from its remainders modulo a set of coprime integers (Chinese remainder theorem), and reconstruction of the sorting permutation of a list from a minimal set of pairwise comparisons.