Maciej Skórski
Maciej Skórski
University of Luxembourg
Verified email at mimuw.edu.pl - Homepage
Title
Cited by
Cited by
Year
Noisy leakage revisited
S Dziembowski, S Faust, M Skorski
Annual International Conference on the Theory and Applications of …, 2015
282015
Rényi entropy estimation revisited
M Obremski, M Skorski
182017
Shannon entropy versus renyi entropy from a cryptographic viewpoint
M Skórski
IMA International Conference on Cryptography and Coding, 257-274, 2015
132015
Metric pseudoentropy: Characterizations, transformations and applications
M Skorski
International Conference on Information Theoretic Security, 105-122, 2015
122015
Condensed unpredictability
M Skorski, A Golovnev, K Pietrzak
International Colloquium on Automata, Languages, and Programming, 1046-1057, 2015
92015
Privacy and secrecy with multiple measurements of physical and biometric identifiers
O Günlü, G Kramer, M Skórski
2015 IEEE Conference on Communications and Network Security (CNS), 89-94, 2015
82015
Optimal amplification of noisy leakages
S Dziembowski, S Faust, M Skórski
Theory of Cryptography Conference, 291-318, 2016
72016
The chain rule for HILL pseudoentropy, revisited
K Pietrzak, M Skórski
International Conference on Cryptology and Information Security in Latin …, 2015
52015
Modulus computational entropy
M Skorski
International Conference on Information Theoretic Security, 179-199, 2013
52013
A Subgradient Algorithm For Computational Distances and Applications to Cryptography.
M Skórski
IACR Cryptol. ePrint Arch. 2016, 158, 2016
42016
Evaluation and monitoring of free running oscillators serving as source of randomness
EN Allini, M Skórski, O Petura, F Bernard, M Laban, V Fischer
IACR Transactions on Cryptographic Hardware and Embedded Systems 2018, 214-242., 2018
32018
Analytic formulas for renyi entropy of hidden markov models
J Breitner, M Skorski
arXiv preprint arXiv:1709.09699, 2017
32017
Simulating auxiliary inputs, revisited
M Skorski
Theory of Cryptography Conference, 159-179, 2016
32016
Key Derivation for Squared-Friendly Applications: Lower Bounds.
M Skorski
IACR Cryptol. ePrint Arch. 2016, 157, 2016
32016
How much randomness can be extracted from memoryless Shannon entropy sources?
M Skorski
International Workshop on Information Security Applications, 75-86, 2015
32015
True random number generators secure in a changing environment: Improved security bounds
M Skorski
International Conference on Current Trends in Theory and Practice of …, 2015
32015
Handy formulas for binomial moments
M Skorski
arXiv preprint arXiv:2012.06270, 2020
22020
Missing Mass Concentration for Markov Chains
M Skorski
arXiv preprint arXiv:2001.03603, 2020
22020
Chain rules for hessian and higher derivatives made easy by tensor calculus
M Skorski
arXiv preprint arXiv:1911.13292, 2019
22019
Kernel Density Estimation Bias under Minimal Assumptions
M Skorski
arXiv preprint arXiv:1901.00331, 2019
22019
The system can't perform the operation now. Try again later.
Articles 1–20