Maciej Skorski

According to our database1, Maciej Skorski authored at least 70 papers between 2013 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
On Missing Mass Variance.
CoRR, 2021

Confidence-Optimal Random Embeddings.
CoRR, 2021

Random Embeddings with Optimal Accuracy.
CoRR, 2021

Mean-Squared Accuracy of Good-Turing Estimator.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Concentration of the Collision Estimator.
Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

Johnson-Lindenstrauss Transforms with Best Confidence.
Proceedings of the Conference on Learning Theory, 2021

Modern Analysis of Hutchinson's Trace Estimator.
Proceedings of the 55th Annual Conference on Information Sciences and Systems, 2021

2020
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free.
IACR Cryptol. ePrint Arch., 2020

Simple Analysis of Johnson-Lindenstrauss Transform under Neuroscience Constraints.
CoRR, 2020

Concentration Bounds for the Collision Estimator.
CoRR, 2020

Revisiting Concentration of Missing Mass.
CoRR, 2020

Revisiting Initialization of Neural Networks.
CoRR, 2020

Efficient Sampled Softmax for Tensorflow.
CoRR, 2020

Practical Estimation of Renyi Entropy.
CoRR, 2020

Explicit Renyi Entropy for Hidden Markov Models.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Complexity of Estimating Renyi Entropy of Markov Chains.
IACR Cryptol. ePrint Arch., 2019

Chain Rules for Hessian and Higher Derivatives Made Easy by Tensor Calculus.
CoRR, 2019

Bounds on Bayes Factors for Binomial A/B Testing.
CoRR, 2019

Kernel Density Estimation Bias under Minimal Assumptions.
CoRR, 2019

Bayesian Root Cause Analysis by Separable Likelihoods.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Strong Chain Rules for Min-Entropy under Few Bits Spoiled.
Proceedings of the IEEE International Symposium on Information Theory, 2019

On Bayes Factors for Success Rate A/B Testing.
Proceedings of the 8th International Conference on Data Science, 2019

2018
Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018

Pseudorandomness Against Mean and Variance Bounded Attackers.
IACR Cryptol. ePrint Arch., 2018

Simple Root Cause Analysis by Separable Likelihoods.
CoRR, 2018

2017
Renyi Entropy Estimation Revisited.
IACR Cryptol. ePrint Arch., 2017

Inverted Leftover Hash Lemma.
IACR Cryptol. ePrint Arch., 2017

Analytic Formulas for Renyi Entropy of Hidden Markov Models.
CoRR, 2017

Entropy of Independent Experiments, Revisited.
CoRR, 2017

A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds.
Proceedings of the Theory and Applications of Models of Computation, 2017

Lower Bounds on Key Derivation for Square-Friendly Applications.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

On the complexity of estimating Rènyi divergences.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Non-Uniform Attacks Against Pseudoentropy.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
On the Complexity of Breaking Pseudoentropy.
IACR Cryptol. ePrint Arch., 2016

Evaluating Entropy for TRNGs: Efficient, Robust and Provably Secure.
IACR Cryptol. ePrint Arch., 2016

Improved Estimation of Collision Entropy in High and Low-Entropy Regimes and Applications to Anomaly Detection.
IACR Cryptol. ePrint Arch., 2016

A Cryptographic Proof of Regularity Lemmas.
IACR Cryptol. ePrint Arch., 2016

Simulating Auxiliary Inputs, Revisited.
IACR Cryptol. ePrint Arch., 2016

A Subgradient Algorithm For Computational Distances and Applications to Cryptography.
IACR Cryptol. ePrint Arch., 2016

Key Derivation for Squared-Friendly Applications: Lower Bounds.
IACR Cryptol. ePrint Arch., 2016

Pseudoentropy: Lower-bounds for Chain rules and Transformations.
IACR Cryptol. ePrint Arch., 2016

On Pseudorandomness in Stateless Sources.
Proceedings of the Information Security Applications - 17th International Workshop, 2016

Optimal Amplification of Noisy Leakages.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

How to Smooth Entropy?
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage.
Proceedings of the Information Theoretic Security - 9th International Conference, 2016

Evaluating Entropy for True Random Number Generators: Efficient, Robust and Provably Secure.
Proceedings of the Information Security and Cryptology - 12th International Conference, 2016

Evaluating Entropy Sources for True Random Number Generators by Collision Counting.
Proceedings of the Applications and Techniques in Information Security, 2016

2015
Condensed Unpredictability.
IACR Cryptol. ePrint Arch., 2015

How much randomness can be extracted from memoryless Shannon entropy sources?
IACR Cryptol. ePrint Arch., 2015

Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy.
IACR Cryptol. ePrint Arch., 2015

The Chain Rule for HILL Pseudoentropy, Revisited.
IACR Cryptol. ePrint Arch., 2015

A Time-Success Ratio Analysis of wPRF-based Leakage-Resilient Stream Ciphers.
CoRR, 2015

Lower bounds on $q$-wise independence tails and applications to min-entropy condensers.
CoRR, 2015

Simulating Side Information: Better Provable Security for Leakage Resilient Stream Ciphers.
CoRR, 2015

Metric Pseudoentropy: Characterizations and Applications.
Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, 2015

Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs with Applications to Pseudoentropy.
Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, 2015

On Provable Security of wPRF-Based Leakage-Resilient Stream Ciphers.
Proceedings of the Provable Security, 2015

A New Approximate Min-Max Theorem with Applications in Cryptography.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Efficiently Simulating High Min-entropy Sources in the Presence of Side Information.
Proceedings of the Progress in Cryptology - INDOCRYPT 2015, 2015

Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint.
Proceedings of the Cryptography and Coding - 15th IMA International Conference, 2015

Metric Pseudoentropy: Characterizations, Transformations and Applications.
Proceedings of the Information Theoretic Security - 8th International Conference, 2015

Noisy Leakage Revisited.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Privacy and secrecy with multiple measurements of physical and biometric identifiers.
Proceedings of the 2015 IEEE Conference on Communications and Network Security, 2015

Time-Advantage Ratios Under Simple Transformations: Applications in Cryptography.
Proceedings of the Cryptography and Information Security in the Balkans, 2015

2014
A Comprehensive Comparison of Shannon Entropy and Smooth Renyi Entropy.
IACR Cryptol. ePrint Arch., 2014

True Random Number Generators Secure in a Changing Environment: Improved Security Bounds.
IACR Cryptol. ePrint Arch., 2014

An Improved Transformation between HILL and Metric Conditional Pseudoentropy.
IACR Cryptol. ePrint Arch., 2014

On Recent Advances in Key Derivation via the Leftover Hash Lemma.
Proceedings of the 2014 Imperial College Computing Student Workshop, 2014

2013
A Convex Analysis Approach to Computational Entropy
CoRR, 2013

Modulus Computational Entropy.
Proceedings of the Information Theoretic Security - 7th International Conference, 2013


  Loading...