| Noisy leakage revisited S Dziembowski, S Faust, M Skorski Annual International Conference on the Theory and Applications of …, 2015 | 40 | 2015 |
| Shannon entropy versus Renyi entropy from a cryptographic viewpoint M Skórski IMA International Conference on Cryptography and Coding, 257-274, 2015 | 23 | 2015 |
| Renyi entropy estimation revisited M Obremski, M Skorski Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017 | 21 | 2017 |
| Revisiting weight initialization of deep neural networks M Skorski, A Temperoni, M Theobald Asian Conference on Machine Learning, 1192-1207, 2021 | 20 | 2021 |
| Optimal amplification of noisy leakages S Dziembowski, S Faust, M Skórski Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv …, 2016 | 20 | 2016 |
| Bernstein-type bounds for beta distribution M Skorski Modern Stochastics: Theory and Applications 10 (2), 211-228, 2023 | 18 | 2023 |
| 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 (3), 2018 | 15 | 2018 |
| Metric pseudoentropy: Characterizations, transformations and applications M Skorski International Conference on Information Theoretic Security, 105-122, 2015 | 11 | 2015 |
| Modern analysis of hutchinson's trace estimator M Skorski 2021 55th Annual Conference on Information Sciences and Systems (CISS), 1-5, 2021 | 10 | 2021 |
| 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 | 10 | 2015 |
| Chain rules for Hessian and higher derivatives made easy by tensor calculus M Skorski arXiv preprint arXiv:1911.13292, 2019 | 9 | 2019 |
| Condensed unpredictability M Skorski, A Golovnev, K Pietrzak International Colloquium on Automata, Languages, and Programming, 1046-1057, 2015 | 8 | 2015 |
| A subgradient algorithm for computational distances and applications to cryptography M Skórski Cryptology ePrint Archive, 2016 | 7 | 2016 |
| Handy formulas for binomial moments M Skorski Modern Stochastics: Theory and Applications, 1-15, 2024 | 6 | 2024 |
| Simulating auxiliary inputs, revisited M Skórski Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016 | 6 | 2016 |
| Complexity of estimating Rényi entropy of Markov chains M Obremski, M Skorski 2020 IEEE International Symposium on Information Theory (ISIT), 2264-2269, 2020 | 5 | 2020 |
| Inverted leftover hash lemma M Obremski, M Skórski 2018 IEEE International Symposium on Information Theory (ISIT), 1834-1838, 2018 | 5 | 2018 |
| A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds M Skórski International Conference on Theory and Applications of Models of Computation …, 2017 | 5 | 2017 |
| Lower bounds on key derivation for square-friendly applications M Skorski 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), 2017 | 5* | 2017 |
| The chain rule for HILL pseudoentropy, revisited K Pietrzak, M Skórski International Conference on Cryptology and Information Security in Latin …, 2015 | 5 | 2015 |
