Publications

I publish on a wide range of topics, mainly related to applications of statistics, such as cryptography with weak randomness, random number generators, probabilistic algorithms, information theory, statistics and machine learning.

Machine Learning

Landowska, A., Robak, M., & Skorski, M. (2023). What twitter data tell us about the future? CoRR, abs/2308.02035. https://doi.org/10.48550/ARXIV.2308.02035
Skorski, M., & Temperoni, A. (2023). Exact non-oblivious performance of rademacher random embeddings. CoRR, abs/2303.11774. https://doi.org/10.48550/ARXIV.2303.11774
Skorski, M. (2022). Entropy matters: Understanding performance of sparse random embeddings. In S. W. Bae & H. Park (Eds.), 33rd international symposium on algorithms and computation, ISAAC 2022, december 19-21, 2022, seoul, korea (Vol. 248, pp. 18:1–18:18). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ISAAC.2022.18
Skorski, M., Temperoni, A., & Theobald, M. (2022). Robust and provable guarantees for sparse random embeddings. In J. Gama, T. Li, Y. Yu, E. Chen, Y. Zheng, & F. Teng (Eds.), Advances in knowledge discovery and data mining – 26th pacific-asia conference, PAKDD 2022, chengdu, china, may 16-19, 2022, proceedings, part II (Vol. 13281, pp. 211–223). Springer. https://doi.org/10.1007/978-3-031-05936-0\_17
Skorski, M. (2021). Johnson-lindenstrauss transforms with best confidence. In M. Belkin & S. Kpotufe (Eds.), Conference on learning theory, COLT 2021, 15-19 august 2021, boulder, colorado, USA (Vol. 134, pp. 3989–4007). PMLR. http://proceedings.mlr.press/v134/skorski21a.html
Skorski, M. (2021). Random embeddings with optimal accuracy. CoRR, abs/2101.00029. https://arxiv.org/abs/2101.00029
Skorski, M., Temperoni, A., & Theobald, M. (2021). Revisiting weight initialization of deep neural networks. In V. N. Balasubramanian & I. W. Tsang (Eds.), Asian conference on machine learning, ACML 2021, 17-19 november 2021, virtual event (Vol. 157, pp. 1192–1207). PMLR. https://proceedings.mlr.press/v157/skorski21a.html
Skorski, M. (2020). Efficient sampled softmax for tensorflow. CoRR, abs/2004.05244. https://arxiv.org/abs/2004.05244
Skorski, M. (2019). Bayesian root cause analysis by separable likelihoods. In B. Catania, R. Královic, J. R. Nawrocki, & G. Pighizzini (Eds.), SOFSEM 2019: Theory and practice of computer science – 45th international conference on current trends in theory and practice of computer science, nový smokovec, slovakia, january 27-30, 2019, proceedings (Vol. 11376, pp. 461–472). Springer. https://doi.org/10.1007/978-3-030-10801-4\_36
Skorski, M. (2019). On bayes factors for success rate A/B testing. In S. Hammoudi, C. Quix, & J. Bernardino (Eds.), Proceedings of the 8th international conference on data science, technology and applications, DATA 2019, prague, czech republic, july 26-28, 2019 (pp. 332–339). SciTePress. https://doi.org/10.5220/0007954503320339

Statistics

Skorski, M. (2023). Bernstein-type bounds for beta distribution. Modern Stochastics: Theory and Applications, 10(2), 211–228.
Breitner, J., & Skorski, M. (2020). Explicit renyi entropy for hidden markov models. IEEE International Symposium on Information Theory, ISIT 2020, Los Angeles, CA, USA, June 21-26, 2020, 2303–2308. https://doi.org/10.1109/ISIT44484.2020.9174390
Skorski, M. (2020). Revisiting concentration of missing mass. CoRR, abs/2005.10018. https://arxiv.org/abs/2005.10018
Skorski, M. (2019). Bounds on bayes factors for binomial A/B testing. CoRR, abs/1903.00049. http://arxiv.org/abs/1903.00049
Skorski, M. (2019). Kernel density estimation bias under minimal assumptions. CoRR, abs/1901.00331. http://arxiv.org/abs/1901.00331

Algorithms

Skorski, M. (2023). Towards more efficient rényi entropy estimation. Entropy, 25(2), 185. https://doi.org/10.3390/E25020185
Skorski, M. (2022). Tight chernoff-like bounds under limited independence. In A. Chakrabarti & C. Swamy (Eds.), Approximation, randomization, and combinatorial optimization. Algorithms and techniques, APPROX/RANDOM 2022, september 19-21, 2022, university of illinois, urbana-champaign, USA (virtual conference) (Vol. 245, pp. 15:1–15:14). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2022.15
Skorski, M. (2021). Concentration of the collision estimator. In E. Bampis & A. Pagourtzis (Eds.), Fundamentals of computation theory – 23rd international symposium, FCT 2021, athens, greece, september 12-15, 2021, proceedings (Vol. 12867, pp. 440–456). Springer. https://doi.org/10.1007/978-3-030-86593-1\_31
Skorski, M. (2021). Mean-squared accuracy of good-turing estimator. IEEE International Symposium on Information Theory, ISIT 2021, Melbourne, Australia, July 12-20, 2021, 2846–2851. https://doi.org/10.1109/ISIT45174.2021.9518169
Skorski, M. (2021). Modern analysis of hutchinson’s trace estimator. 55th Annual Conference on Information Sciences and Systems, CISS 2021, Baltimore, MD, USA, March 24-26, 2021, 1–5. https://doi.org/10.1109/CISS50987.2021.9400306
Obremski, M., & Skorski, M. (2020). Complexity of estimating rényi entropy of markov chains. IEEE International Symposium on Information Theory, ISIT 2020, Los Angeles, CA, USA, June 21-26, 2020, 2264–2269. https://doi.org/10.1109/ISIT44484.2020.9174261
Obremski, M., & Skorski, M. (2017). Renyi entropy estimation revisited. In K. Jansen, J. D. P. Rolim, D. Williamson, & S. S. Vempala (Eds.), Approximation, randomization, and combinatorial optimization. Algorithms and techniques, APPROX/RANDOM 2017, august 16-18, 2017, berkeley, CA, USA (Vol. 81, pp. 20:1–20:15). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2017.20
Pietrzak, K., & Skorski, M. (2017). Non-uniform attacks against pseudoentropy. In I. Chatzigiannakis, P. Indyk, F. Kuhn, & A. Muscholl (Eds.), 44th international colloquium on automata, languages, and programming, ICALP 2017, july 10-14, 2017, warsaw, poland (Vol. 80, pp. 39:1–39:13). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2017.39
Skorski, M. (2017). On the complexity of estimating rènyi divergences. 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, June 25-30, 2017, 256–260. https://doi.org/10.1109/ISIT.2017.8006529
Skórski, M. (2015). A new approximate min-max theorem with applications in cryptography. In K. M. Elbassioni & K. Makino (Eds.), Algorithms and computation – 26th international symposium, ISAAC 2015, nagoya, japan, december 9-11, 2015, proceedings (Vol. 9472, pp. 653–663). Springer. https://doi.org/10.1007/978-3-662-48971-0\_55

Cryptography

Fischer, V., Bernard, F., Bochard, N., Dallison, Q., & Skórski, M. (2023). Enhancing quality and security of the PLL-TRNG. IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023(4), 211–237. https://doi.org/10.46586/TCHES.V2023.I4.211-237
Brian, G., Faonio, A., Obremski, M., Ribeiro, J., Simkin, M., Skórski, M., & Venturi, D. (2022). The mother of all leakages: How to simulate noisy leakages via bounded leakage (almost) for free. IEEE Trans. Inf. Theory, 68(12), 8197–8227. https://doi.org/10.1109/TIT.2022.3193848
Brian, G., Faonio, A., Obremski, M., Ribeiro, J., Simkin, M., Skórski, M., & Venturi, D. (2021). The mother of all leakages: How to simulate noisy leakages via bounded leakage (almost) for free. In A. Canteaut & F.-X. Standaert (Eds.), Advances in cryptology – EUROCRYPT 2021 – 40th annual international conference on the theory and applications of cryptographic techniques, zagreb, croatia, october 17-21, 2021, proceedings, part II (Vol. 12697, pp. 408–437). Springer. https://doi.org/10.1007/978-3-030-77886-6\_14
Brian, G., Faonio, A., Obremski, M., Ribeiro, J., Simkin, M., Skórski, M., & Venturi, D. (2020). The mother of all leakages: How to simulate noisy leakages via bounded leakage (almost) for free. IACR Cryptol. ePrint Arch., 1246. https://eprint.iacr.org/2020/1246
Skórski, M. (2019). Strong chain rules for min-entropy under few bits spoiled. IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, July 7-12, 2019, 1122–1126. https://doi.org/10.1109/ISIT.2019.8849240
Allini, E. N., Skórski, M., Petura, O., Bernard, F., Laban, M., & Fischer, V. (2018). Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018(3), 214–242. https://doi.org/10.13154/TCHES.V2018.I3.214-242
Obremski, M., & Skorski, M. (2018). Inverted leftover hash lemma. 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, June 17-22, 2018, 1834–1838. https://doi.org/10.1109/ISIT.2018.8437654
Skorski, M. (2018). Pseudorandomness against mean and variance bounded attackers. IACR Cryptol. ePrint Arch., 984. https://eprint.iacr.org/2018/984
Pietrzak, K., & Skorski, M. (2017). Non-uniform attacks against pseudoentropy. CoRR, abs/1704.08678. http://arxiv.org/abs/1704.08678
Skorski, M. (2017). Lower bounds on key derivation for square-friendly applications. In H. Vollmer & B. Vallée (Eds.), 34th symposium on theoretical aspects of computer science, STACS 2017, march 8-11, 2017, hannover, germany (Vol. 66, pp. 57:1–57:12). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.STACS.2017.57
Skorski, M. (2017). Strong chain rules for min-entropy under few bits spoiled. CoRR, abs/1702.08476. http://arxiv.org/abs/1702.08476
Skórski, M. (2017). On the complexity of breaking pseudoentropy. In T. V. Gopal, G. Jäger, & S. Steila (Eds.), Theory and applications of models of computation – 14th annual conference, TAMC 2017, bern, switzerland, april 20-22, 2017, proceedings (Vol. 10185, pp. 600–613). https://doi.org/10.1007/978-3-319-55911-7\_43
Dziembowski, S., Faust, S., & Skórski, M. (2016). Optimal amplification of noisy leakages. In E. Kushilevitz & T. Malkin (Eds.), Theory of cryptography – 13th international conference, TCC 2016-a, tel aviv, israel, january 10-13, 2016, proceedings, part II (Vol. 9563, pp. 291–318). Springer. https://doi.org/10.1007/978-3-662-49099-0\_11
Pietrzak, K., & Skórski, M. (2016). Pseudoentropy: Lower-bounds for chain rules and transformations. In M. Hirt & A. D. Smith (Eds.), Theory of cryptography – 14th international conference, TCC 2016-b, beijing, china, october 31 – november 3, 2016, proceedings, part I (Vol. 9985, pp. 183–203). https://doi.org/10.1007/978-3-662-53641-4\_8
Skorski, M. (2016). Evaluating entropy for true random number generators: Efficient, robust and provably secure. In K. Chen, D. Lin, & M. Yung (Eds.), Information security and cryptology – 12th international conference, inscrypt 2016, beijing, china, november 4-6, 2016, revised selected papers (Vol. 10143, pp. 526–541). Springer. https://doi.org/10.1007/978-3-319-54705-3\_32
Skorski, M. (2016). How to smooth entropy? In R. M. Freivalds, G. Engels, & B. Catania (Eds.), SOFSEM 2016: Theory and practice of computer science – 42nd international conference on current trends in theory and practice of computer science, harrachov, czech republic, january 23-28, 2016, proceedings (Vol. 9587, pp. 392–403). Springer. https://doi.org/10.1007/978-3-662-49192-8\_32
Skorski, M. (2016). On pseudorandomness in stateless sources. In D. Choi & S. Guilley (Eds.), Information security applications – 17th international workshop, WISA 2016, jeju island, korea, august 25-27, 2016, revised selected papers (Vol. 10144, pp. 280–291). https://doi.org/10.1007/978-3-319-56549-1\_24
Skórski, M. (2016). A better chain rule for HILL pseudoentropy – beyond bounded leakage. In A. C. A. Nascimento & P. S. L. M. Barreto (Eds.), Information theoretic security – 9th international conference, ICITS 2016, tacoma, WA, USA, august 9-12, 2016, revised selected papers (Vol. 10015, pp. 279–299). https://doi.org/10.1007/978-3-319-49175-2\_14
Skórski, M. (2016). Evaluating entropy sources for true random number generators by collision counting. In L. Batten & G. Li (Eds.), Applications and techniques in information security – 6th international conference, ATIS 2016, cairns, QLD, australia, october 26-28, 2016, proceedings (Vol. 651, pp. 69–80). https://doi.org/10.1007/978-981-10-2741-3\_6
Skórski, M. (2016). Simulating auxiliary inputs, revisited. In M. Hirt & A. D. Smith (Eds.), Theory of cryptography – 14th international conference, TCC 2016-b, beijing, china, october 31 – november 3, 2016, proceedings, part I (Vol. 9985, pp. 159–179). https://doi.org/10.1007/978-3-662-53641-4\_7
Dziembowski, S., Faust, S., & Skorski, M. (2015). Noisy leakage revisited. In E. Oswald & M. Fischlin (Eds.), Advances in cryptology – EUROCRYPT 2015 – 34th annual international conference on the theory and applications of cryptographic techniques, sofia, bulgaria, april 26-30, 2015, proceedings, part II (Vol. 9057, pp. 159–188). Springer. https://doi.org/10.1007/978-3-662-46803-6\_6
Günlü, O., Kramer, G., & Skorski, M. (2015). Privacy and secrecy with multiple measurements of physical and biometric identifiers. 2015 IEEE Conference on Communications and Network Security, CNS 2015, Florence, Italy, September 28-30, 2015, 89–94. https://doi.org/10.1109/CNS.2015.7346815
Pietrzak, K., & Skorski, M. (2015). The chain rule for HILL pseudoentropy, revisited. In K. E. Lauter & F. Rodrı́guez-Henrı́quez (Eds.), Progress in cryptology – LATINCRYPT 2015 – 4th international conference on cryptology and information security in latin america, guadalajara, mexico, august 23-26, 2015, proceedings (Vol. 9230, pp. 81–98). Springer. https://doi.org/10.1007/978-3-319-22174-8\_5
Skorski, M. (2015). An improved transformation between HILL and metric conditional pseudoentropy. In G. F. Italiano, T. Margaria-Steffen, J. Pokorný, J.-J. Quisquater, R. Wattenhofer, R. Spanek, & M. Rimnac (Eds.), Proceedings of student research forum papers and posters at SOFSEM 2015, the 41st international conference on current trends in theory and practice of computer science (SOFSEM 2015) , pec pod snezkou, czech republic, january 24-29, 2015 (Vol. 1326, pp. 67–77). CEUR-WS.org. https://ceur-ws.org/Vol-1326/067-Skorski.pdf
Skorski, M. (2015). Efficiently simulating high min-entropy sources in the presence of side information. In A. Biryukov & V. Goyal (Eds.), Progress in cryptology – INDOCRYPT 2015 – 16th international conference on cryptology in india, bangalore, india, december 6-9, 2015, proceedings (Vol. 9462, pp. 312–325). Springer. https://doi.org/10.1007/978-3-319-26617-6\_17
Skorski, M. (2015). How much randomness can be extracted from memoryless shannon entropy sources? In H. Kim & D. Choi (Eds.), Information security applications – 16th international workshop, WISA 2015, jeju island, korea, august 20-22, 2015, revised selected papers (Vol. 9503, pp. 75–86). Springer. https://doi.org/10.1007/978-3-319-31875-2\_7
Skorski, M. (2015). Indistinguishability and unpredictability hardcore lemmas: New proofs with applications to pseudoentropy. In G. F. Italiano, T. Margaria-Steffen, J. Pokorný, J.-J. Quisquater, R. Wattenhofer, R. Spanek, & M. Rimnac (Eds.), Proceedings of student research forum papers and posters at SOFSEM 2015, the 41st international conference on current trends in theory and practice of computer science (SOFSEM 2015) , pec pod snezkou, czech republic, january 24-29, 2015 (Vol. 1326, pp. 78–89). CEUR-WS.org. https://ceur-ws.org/Vol-1326/078-Skorski.pdf
Skorski, M. (2015). Metric pseudoentropy: Characterizations and applications. In G. F. Italiano, T. Margaria-Steffen, J. Pokorný, J.-J. Quisquater, R. Wattenhofer, R. Spanek, & M. Rimnac (Eds.), Proceedings of student research forum papers and posters at SOFSEM 2015, the 41st international conference on current trends in theory and practice of computer science (SOFSEM 2015) , pec pod snezkou, czech republic, january 24-29, 2015 (Vol. 1326, pp. 90–102). CEUR-WS.org. https://ceur-ws.org/Vol-1326/090-Skorski.pdf
Skorski, M. (2015). Metric pseudoentropy: Characterizations, transformations and applications. In A. Lehmann & S. Wolf (Eds.), Information theoretic security – 8th international conference, ICITS 2015, lugano, switzerland, may 2-5, 2015. proceedings (Vol. 9063, pp. 105–122). Springer. https://doi.org/10.1007/978-3-319-17470-9\_7
Skorski, M. (2015). Nonuniform indistinguishability and unpredictability hardcore lemmas: New proofs and applications to pseudoentropy. In A. Lehmann & S. Wolf (Eds.), Information theoretic security – 8th international conference, ICITS 2015, lugano, switzerland, may 2-5, 2015. proceedings (Vol. 9063, pp. 123–140). Springer. https://doi.org/10.1007/978-3-319-17470-9\_8
Skorski, M. (2015). On provable security of wPRF-based leakage-resilient stream ciphers. In M. H. Au & A. Miyaji (Eds.), Provable security – 9th international conference, ProvSec 2015, kanazawa, japan, november 24-26, 2015, proceedings (Vol. 9451, pp. 391–411). Springer. https://doi.org/10.1007/978-3-319-26059-4\_22
Skorski, M. (2015). True random number generators secure in a changing environment: Improved security bounds. In G. F. Italiano, T. Margaria-Steffen, J. Pokorný, J.-J. Quisquater, & R. Wattenhofer (Eds.), SOFSEM 2015: Theory and practice of computer science – 41st international conference on current trends in theory and practice of computer science, pec pod sněžkou, czech republic, january 24-29, 2015. proceedings (Vol. 8939, pp. 590–602). Springer. https://doi.org/10.1007/978-3-662-46078-8\_49
Skorski, M., Golovnev, A., & Pietrzak, K. (2015). Condensed unpredictability. In M. M. Halldórsson, K. Iwama, N. Kobayashi, & B. Speckmann (Eds.), Automata, languages, and programming – 42nd international colloquium, ICALP 2015, kyoto, japan, july 6-10, 2015, proceedings, part I (Vol. 9134, pp. 1046–1057). Springer. https://doi.org/10.1007/978-3-662-47672-7\_85
Skórski, M. (2015). Shannon entropy versus renyi entropy from a cryptographic viewpoint. In J. Groth (Ed.), Cryptography and coding – 15th IMA international conference, IMACC 2015, oxford, UK, december 15-17, 2015. proceedings (Vol. 9496, pp. 257–274). Springer. https://doi.org/10.1007/978-3-319-27239-9\_16
Skórski, M. (2015). Time-advantage ratios under simple transformations: Applications in cryptography. In E. Pasalic & L. R. Knudsen (Eds.), Cryptography and information security in the balkans – second international conference, BalkanCryptSec 2015, koper, slovenia, september 3-4, 2015, revised selected papers (Vol. 9540, pp. 79–91). Springer. https://doi.org/10.1007/978-3-319-29172-7\_6
Skorski, M. (2014). On recent advances in key derivation via the leftover hash lemma. In R. Neykova & N. Ng (Eds.), 2014 imperial college computing student workshop, ICCSW 2014, september 25-26, 2014, london, united kingdom (Vol. 43, pp. 83–90). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/OASICS.ICCSW.2014.83
Skorski, M. (2013). Modulus computational entropy. In C. Padró (Ed.), Information theoretic security – 7th international conference, ICITS 2013, singapore, november 28-30, 2013, proceedings (Vol. 8317, pp. 179–199). Springer. https://doi.org/10.1007/978-3-319-04268-8\_11

Hardware Cryptography

Fischer, V., Bernard, F., Bochard, N., Dallison, Q., & Skórski, M. (2023). Enhancing quality and security of the PLL-TRNG. IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023(4), 211–237. https://doi.org/10.46586/TCHES.V2023.I4.211-237
Allini, E. N., Skórski, M., Petura, O., Bernard, F., Laban, M., & Fischer, V. (2018). Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018(3), 214–242. https://doi.org/10.13154/TCHES.V2018.I3.214-242
Skorski, M. (2015). True random number generators secure in a changing environment: Improved security bounds. In G. F. Italiano, T. Margaria-Steffen, J. Pokorný, J.-J. Quisquater, & R. Wattenhofer (Eds.), SOFSEM 2015: Theory and practice of computer science – 41st international conference on current trends in theory and practice of computer science, pec pod sněžkou, czech republic, january 24-29, 2015. proceedings (Vol. 8939, pp. 590–602). Springer. https://doi.org/10.1007/978-3-662-46078-8\_49