| Publication | Date of Publication | Type |
|---|
| Entropy matters: understanding performance of sparse random embeddings | 2024-09-11 | Paper |
| Tight Chernoff-like bounds under limited independence | 2024-08-22 | Paper |
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
Bernstein-type bounds for beta distribution
Modern Stochastics. Theory and Applications | 2023-06-22 | Paper |
| Hypercontractivity via tensor calculus | 2023-03-30 | Paper |
| Tight Chernoff-Like Bounds Under Limited Independence | 2022-09-04 | Paper |
| Concentration of the collision estimator | 2022-05-20 | Paper |
| The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free | 2021-12-08 | Paper |
| Renyi entropy estimation revisited | 2021-07-28 | Paper |
| Random Embeddings with Optimal Accuracy | 2020-12-31 | Paper |
Bayesian root cause analysis by separable likelihoods
(available as arXiv preprint) | 2020-10-22 | Paper |
| Concentration Bounds for the Collision Estimator | 2020-06-12 | Paper |
Non-uniform attacks against pseudoentropy
(available as arXiv preprint) | 2020-05-27 | Paper |
| Revisiting Concentration of Missing Mass | 2020-05-19 | Paper |
| Missing Mass Concentration for Markov Chains | 2020-01-10 | Paper |
| scientific article; zbMATH DE number 7121810 (Why is no real title available?) | 2019-10-24 | Paper |
| scientific article; zbMATH DE number 6862149 (Why is no real title available?) | 2018-04-19 | Paper |
A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds
Lecture Notes in Computer Science | 2017-05-19 | Paper |
On the Complexity of Breaking Pseudoentropy
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Evaluating Entropy for True Random Number Generators: Efficient, Robust and Provably Secure
Information Security and Cryptology | 2017-05-05 | Paper |
A better chain rule for HILL pseudoentropy -- beyond bounded leakage
Lecture Notes in Computer Science | 2017-01-06 | Paper |
Pseudoentropy: lower-bounds for chain rules and transformations
Theory of Cryptography | 2016-12-21 | Paper |
Simulating auxiliary inputs, revisited
Theory of Cryptography | 2016-12-21 | Paper |
Time-advantage ratios under simple transformations: applications in cryptography
Cryptography and Information Security in the Balkans | 2016-04-26 | Paper |
Optimal amplification of noisy leakages
Theory of Cryptography | 2016-04-08 | Paper |
How to smooth entropy?
Lecture Notes in Computer Science | 2016-03-10 | Paper |
On Provable Security of wPRF-Based Leakage-Resilient Stream Ciphers
Provable Security | 2016-01-27 | Paper |
Efficiently simulating high min-entropy sources in the presence of side information
Progress in Cryptology -- INDOCRYPT 2015 | 2016-01-12 | Paper |
Shannon entropy versus Renyi entropy from a cryptographic viewpoint
Cryptography and Coding | 2016-01-12 | Paper |
A New Approximate Min-Max Theorem with Applications in Cryptography
Algorithms and Computation | 2016-01-11 | Paper |
Condensed Unpredictability
Automata, Languages, and Programming | 2015-10-27 | Paper |
Condensed Unpredictability
Automata, Languages, and Programming | 2015-10-27 | Paper |
Modulus computational entropy
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Noisy leakage revisited
Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
Metric pseudoentropy: characterizations, transformations and applications
Lecture Notes in Computer Science | 2015-09-24 | Paper |
Nonuniform indistinguishability and unpredictability hardcore lemmas: new proofs and applications to pseudoentropy
Lecture Notes in Computer Science | 2015-09-24 | Paper |
The chain rule for HILL pseudoentropy, revisited
Progress in Cryptology -- LATINCRYPT 2015 | 2015-09-17 | Paper |
| Lower bounds on $q$-wise independence tails and applications to min-entropy condensers | 2015-04-09 | Paper |
True random number generators secure in a changing environment: improved security bounds
Lecture Notes in Computer Science | 2015-02-20 | Paper |
