Olivier Rioul
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
Olivier Rioul has a total of 92 co-authors. Here are the top co-authors by number of shared publications:
- Sylvain Guilley
Secure-IC S.A.S. and Télécom Paris
13 shared publications Sylvain Guilley
Institut Mines-Télécom, Télécom ParisTech, CNRS LTCI Department Comelec
9 shared publicationsP. Duhamel
8 shared publicationsAnnelie Heuser
CNRS, IRISA
7 shared publicationsJean-Luc Danger
LTCI, CNRS, Tlcom ParisTech, Universit Paris-Saclay, 75 013, France
6 shared publicationsYves Guiard
Université Paris-Saclay, Paris, France
6 shared publications
Latest Publications
- 20 October 2025
- Published by Springer Nature
- p. 280-289
A Historical Perspective on the Schützenberger-van Trees Inequality: A Posterior Uncertainty Principle
- 20 October 2025
- Published by Springer Nature
- p. 280-289
A Historical Perspective on the Schützenberger-van Trees Inequality: A Posterior Uncertainty Principle
- 5 May 2025
- Published by Elsevier in Information Processing Letters
- Vol. 190
An information theoretic proof of the Chernoff-Hoeffding inequality
- 5 May 2025
- Published by Elsevier in Information Processing Letters
- Vol. 190
An information theoretic proof of the Chernoff-Hoeffding inequality
- 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:
- 30 May 2024
- Published by Springer Nature in Information Geometry
- Vol. 7 (S2) , 737-779
A historical perspective on Schützenberger-Pinsker inequalities (extended version)
- 30 May 2024
- Published by Springer Nature in Information Geometry
- Vol. 7 (S2) , 737-779
A historical perspective on Schützenberger-Pinsker inequalities (extended version)
- 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. - 1 August 2023
- Published by Springer Nature
- p. 291-306
A Historical Perspective on Schützenberger-Pinsker Inequalities
- 1 August 2023
- Published by Springer Nature
- p. 291-306
A Historical Perspective on Schützenberger-Pinsker Inequalities
- Open Access
The Interplay between Error, Total Variation, Alpha-Entropy and Guessing: Fano and Pinsker Direct and Reverse Inequalities
Using majorization theory via “Robin Hood” elementary operations, optimal lower and upper bounds are derived on Rényi and guessing entropies with respect to either error probability (yielding reverse-Fano and Fano inequalities) or total variation distance to the uniform (yielding reverse-Pinsker and Pinsker inequalities). This gives a general picture of how the notion of randomness can be measured in many areas of computer science.
Open AccessThe Interplay between Error, Total Variation, Alpha-Entropy and Guessing: Fano and Pinsker Direct and Reverse Inequalities
Using majorization theory via “Robin Hood” elementary operations, optimal lower and upper bounds are derived on Rényi and guessing entropies with respect to either error probability (yielding reverse-Fano and Fano inequalities) or total variation distance to the uniform (yielding reverse-Pinsker and Pinsker inequalities). This gives a general picture of how the notion of randomness can be measured in many areas of computer science.
- 29 January 2023
- Published by Springer Nature
- p. 69-81
A Nearly Tight Proof of Duc et al.’s Conjectured Security Bound for Masked Implementations
- 29 January 2023
- Published by Springer Nature
- p. 69-81
A Nearly Tight Proof of Duc et al.’s Conjectured Security Bound for Masked Implementations