138 citations · 211 across the 23 of their papers we have counts for
19 papers · 1 filter
On the Optimum Secrecy Outage Probability and Ergodic Secrecy Rate over Wireless Channels
Clement Leroy, Tarak Arbi, Benoit Geller +1
We study the secrecy of wireless channels in the presence of an eavesdropper, where the channels are random and the transmitter only has knowledge of the channel statistics. We inv…
What can Information Guess? Guessing Advantage vs. Rényi Entropy for Small Leakages
Julien Béguinot, Olivier Rioul
We leverage the Gibbs inequality and its natural generalization to Rényi entropies to derive closed-form parametric expressions of the optimal lower bounds of th-order guessing…
An information theoretic necessary condition for perfect reconstruction
Idris Delsol, Olivier Rioul, Julien Béguinot +2
A new information theoretic condition is presented for reconstructing a discrete random variable based on the knowledge of a set of discrete functions of . The reconstructio…
Maximal Leakage of Masked Implementations Using Mrs. Gerber's Lemma for Min-Entropy
Julien Béguinot, Yi Liu, Olivier Rioul +2
A common countermeasure against side-channel attacks on secret key cryptographic implementations is th-order masking, which splits each sensitive variable into random shar…
On Conditional -Information and its Application to Side-Channel Analysis
Yi Liu, Wei Cheng, Sylvain Guilley +1
A conditional version of Sibson's -information is defined using a simple closed-form "log-expectation" expression, which satisfies important properties such as consistency, unif…
Attacking Masked Cryptographic Implementations: Information-Theoretic Bounds
Wei Cheng, Yi Liu, Sylvain Guilley +1
Measuring the information leakage is critical for evaluating the practical security of cryptographic devices against side-channel analysis. Information-theoretic measures can be us…
Asymptotically Optimal Massey-Like Inequality on Guessing Entropy With Application to Side-Channel Attack Evaluations
Andrei Tănăsescu, Marios O. Choudary, Olivier Rioul +1
A Massey-like inequality is any useful lower bound on guessing entropy in terms of the computationally scalable Shannon entropy. The asymptotically optimal Massey-like inequality i…
Cumulant Expansion of Mutual Information for Quantifying Leakage of a Protected Secret
Olivier Rioul, Wei Cheng, Sylvain Guilley
The information leakage of a cryptographic implementation with a given degree of protection is evaluated in a typical situation when the signal-to-noise ratio is small. This is sol…
Variations on a Theme by Massey
Olivier Rioul
In 1994, Jim Massey proposed the guessing entropy as a measure of the difficulty that an attacker has to guess a secret used in a cryptographic system, and established a well-known…
Entropy Estimation of Physically Unclonable Functions via Chow Parameters
Alexander Schaub, Olivier Rioul, Joseph +1
A physically unclonable function (PUF) is an electronic circuit that produces an intrinsic identifier in response to a challenge. These identifiers depend on uncontrollable variati…
Rényi Entropy Power and Normal Transport
Olivier Rioul
A framework for deriving Rényi entropy-power inequalities (EPIs) is presented that uses linearization and an inequality of Dembo, Cover, and Thomas. Simple arguments are given to r…
Equality in the Matrix Entropy-Power Inequality and Blind Separation of Real and Complex sources
Olivier Rioul, Ram Zamir
The matrix version of the entropy-power inequality for real or complex coefficients and variables is proved using a transportation argument that easily settles the equality case. A…
Rényi Entropy Power Inequalities via Normal Transport and Rotation
Olivier Rioul
Following a recent proof of Shannon's entropy power inequality (EPI), a comprehensive framework for deriving various EPIs for the Rényi entropy is presented that uses transport arg…
Optimal Transportation to the Entropy-Power Inequality
Olivier Rioul
We present a simple proof of the entropy-power inequality using an optimal transportation argument which takes the form of a simple change of variables. The same argument yields a…
At Every Corner: Determining Corner Points of Two-User Gaussian Interference Channels
Olivier Rioul
The corner points of the capacity region of the two-user Gaussian interference channel under strong or weak interference are determined using the notions of almost Gaussian random…
Yet Another Proof of the Entropy Power Inequality
Olivier Rioul
Yet another simple proof of the entropy power inequality is given, which avoids both the integration over a path of Gaussian perturbation and the use of Young's inequality with sha…
A low-complexity 2D signal space diversity solution for future broadcasting systems
Jianxiao Yang, Wan Kai, Benoit Geller +3
-DVB-T2 was the first industrial standard deploying rotated and cyclic Q delayed (RCQD)modulation to improve performance over fading channels. This enablesimportantgains compared t…
Information Theoretic Proofs of Entropy Power Inequalities
Olivier Rioul
While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, up to now Shannon's entropy power inequality (EPI) i…
An Alternative to Huffman's Algorithm for Constructing Variable-Length Codes
Olivier Rioul
This paper has been withdrawn by the author.