default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaciej Skorski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i54]Maciej Skórski:
Accurate Analysis of Sparse Random Projections. CoRR abs/2407.14518 (2024)- [i53]Alina Landowska, Maciej Skorski, Krzysztof Rajda:
Mapping the Technological Future: A Topic, Sentiment, and Emotion Analysis in Social Media Discourse. CoRR abs/2407.17522 (2024) - [i52]David Lubicz, Maciej Skorski:
Quantifying Jitter Transfer for Differential Measurement: Enhancing Security of Oscillator-Based TRNGs. CoRR abs/2410.08259 (2024) - 2023
- [j4]Maciej Skorski
:
Towards More Efficient Rényi Entropy Estimation. Entropy 25(2): 185 (2023) - [j3]Viktor Fischer, Florent Bernard, Nathalie Bochard, Quentin Dallison, Maciej Skórski:
Enhancing Quality and Security of the PLL-TRNG. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(4): 211-237 (2023) - [i51]Maciej Skorski, Alessandro Temperoni:
Exact Non-Oblivious Performance of Rademacher Random Embeddings. CoRR abs/2303.11774 (2023) - [i50]Alina Landowska, Marek Robak, Maciej Skorski:
What Twitter Data Tell Us about the Future? CoRR abs/2308.02035 (2023) - 2022
- [j2]Gianluca Brian, Antonio Faonio, Maciej Obremski, João Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi:
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. IEEE Trans. Inf. Theory 68(12): 8197-8227 (2022) - [c48]Maciej Skorski:
Tight Chernoff-Like Bounds Under Limited Independence. APPROX/RANDOM 2022: 15:1-15:14 - [c47]Maciej Skorski:
Entropy Matters: Understanding Performance of Sparse Random Embeddings. ISAAC 2022: 18:1-18:18 - [c46]Maciej Skorski, Alessandro Temperoni, Martin Theobald:
Robust and Provable Guarantees for Sparse Random Embeddings. PAKDD (2) 2022: 211-223 - [i49]Maciej Skorski, Alessandro Temperoni, Martin Theobald:
Robust and Provable Guarantees for Sparse Random Embeddings. CoRR abs/2202.10815 (2022) - [i48]Maciej Skorski:
Tight Chernoff-Like Bounds Under Limited Independence. CoRR abs/2209.01587 (2022) - 2021
- [c45]Maciej Skorski, Alessandro Temperoni, Martin Theobald:
Revisiting Weight Initialization of Deep Neural Networks. ACML 2021: 1192-1207 - [c44]Maciej Skorski:
Modern Analysis of Hutchinson's Trace Estimator. CISS 2021: 1-5 - [c43]Maciej Skorski:
Hypercontractivity via Tensor Calculus. COCOON 2021: 449-459 - [c42]Maciej Skorski:
Johnson-Lindenstrauss Transforms with Best Confidence. COLT 2021: 3989-4007 - [c41]Gianluca Brian, Antonio Faonio, Maciej Obremski, João Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi:
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. EUROCRYPT (2) 2021: 408-437 - [c40]Maciej Skorski:
Concentration of the Collision Estimator. FCT 2021: 440-456 - [c39]Maciej Skorski:
Mean-Squared Accuracy of Good-Turing Estimator. ISIT 2021: 2846-2851 - [i47]Maciej Skorski:
Random Embeddings with Optimal Accuracy. CoRR abs/2101.00029 (2021) - [i46]Maciej Skorski:
Confidence-Optimal Random Embeddings. CoRR abs/2104.05628 (2021) - [i45]Maciej Skorski:
On Missing Mass Variance. CoRR abs/2104.07028 (2021) - [i44]Maciej Skorski:
Mean-Squared Accuracy of Good-Turing Estimator. CoRR abs/2104.07029 (2021) - 2020
- [c38]Maciej Obremski, Maciej Skorski:
Complexity of Estimating Rényi Entropy of Markov Chains. ISIT 2020: 2264-2269 - [c37]Joachim Breitner, Maciej Skorski:
Explicit Renyi Entropy for Hidden Markov Models. ISIT 2020: 2303-2308 - [i43]Maciej Skórski:
Practical Estimation of Renyi Entropy. CoRR abs/2002.09264 (2020) - [i42]Maciej Skorski:
Efficient Sampled Softmax for Tensorflow. CoRR abs/2004.05244 (2020) - [i41]Maciej Skorski:
Revisiting Initialization of Neural Networks. CoRR abs/2004.09506 (2020) - [i40]Maciej Skorski:
Revisiting Concentration of Missing Mass. CoRR abs/2005.10018 (2020) - [i39]Maciej Skorski:
Concentration Bounds for the Collision Estimator. CoRR abs/2006.07366 (2020) - [i38]Maciej Skorski:
Simple Analysis of Johnson-Lindenstrauss Transform under Neuroscience Constraints. CoRR abs/2008.08857 (2020) - [i37]Maciej Skorski:
A Modern Analysis of Hutchinson's Trace Estimator. CoRR abs/2012.12895 (2020) - [i36]Gianluca Brian, Antonio Faonio, Maciej Obremski, João Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi:
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. IACR Cryptol. ePrint Arch. 2020: 1246 (2020)
2010 – 2019
- 2019
- [c36]Maciej Skorski:
On Bayes Factors for Success Rate A/B Testing. DATA 2019: 332-339 - [c35]Maciej Skórski:
Strong Chain Rules for Min-Entropy under Few Bits Spoiled. ISIT 2019: 1122-1126 - [c34]Maciej Skorski:
Bayesian Root Cause Analysis by Separable Likelihoods. SOFSEM 2019: 461-472 - [i35]Maciej Skorski:
Kernel Density Estimation Bias under Minimal Assumptions. CoRR abs/1901.00331 (2019) - [i34]Maciej Skorski:
Bounds on Bayes Factors for Binomial A/B Testing. CoRR abs/1903.00049 (2019) - [i33]Maciej Skorski:
Chain Rules for Hessian and Higher Derivatives Made Easy by Tensor Calculus. CoRR abs/1911.13292 (2019) - [i32]Maciej Obremski, Maciej Skorski:
Complexity of Estimating Renyi Entropy of Markov Chains. IACR Cryptol. ePrint Arch. 2019: 766 (2019) - 2018
- [j1]Elie Noumon Allini, Maciej Skórski, Oto Petura, Florent Bernard, Marek Laban, Viktor Fischer:
Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018(3): 214-242 (2018) - [c33]Maciej Obremski, Maciej Skorski:
Inverted Leftover Hash Lemma. ISIT 2018: 1834-1838 - [i31]Maciej Skorski:
Simple Root Cause Analysis by Separable Likelihoods. CoRR abs/1808.04302 (2018) - [i30]Maciej Skorski:
Pseudorandomness Against Mean and Variance Bounded Attackers. IACR Cryptol. ePrint Arch. 2018: 984 (2018) - 2017
- [c32]Maciej Obremski, Maciej Skorski:
Renyi Entropy Estimation Revisited. APPROX-RANDOM 2017: 20:1-20:15 - [c31]Krzysztof Pietrzak, Maciej Skorski:
Non-Uniform Attacks Against Pseudoentropy. ICALP 2017: 39:1-39:13 - [c30]Maciej Skorski:
On the complexity of estimating Rènyi divergences. ISIT 2017: 256-260 - [c29]Maciej Skorski:
Lower Bounds on Key Derivation for Square-Friendly Applications. STACS 2017: 57:1-57:12 - [c28]Maciej Skórski:
A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds. TAMC 2017: 586-599 - [c27]Maciej Skórski:
On the Complexity of Breaking Pseudoentropy. TAMC 2017: 600-613 - [i29]Maciej Skorski:
On the Complexity of Estimating Renyi Divergences. CoRR abs/1702.01666 (2017) - [i28]Maciej Skorski:
Strong Chain Rules for Min-Entropy under Few Bits Spoiled. CoRR abs/1702.08476 (2017) - [i27]Krzysztof Pietrzak, Maciej Skorski:
Non-Uniform Attacks Against Pseudoentropy. CoRR abs/1704.08678 (2017) - [i26]Maciej Skorski:
Entropy of Independent Experiments, Revisited. CoRR abs/1704.09007 (2017) - [i25]Joachim Breitner, Maciej Skorski:
Analytic Formulas for Renyi Entropy of Hidden Markov Models. CoRR abs/1709.09699 (2017) - [i24]Maciej Obremski, Maciej Skorski:
Inverted Leftover Hash Lemma. IACR Cryptol. ePrint Arch. 2017: 507 (2017) - [i23]Maciej Obremski, Maciej Skorski:
Renyi Entropy Estimation Revisited. IACR Cryptol. ePrint Arch. 2017: 588 (2017) - 2016
- [c26]Maciej Skórski:
Evaluating Entropy Sources for True Random Number Generators by Collision Counting. ATIS 2016: 69-80 - [c25]Maciej Skorski:
Evaluating Entropy for True Random Number Generators: Efficient, Robust and Provably Secure. Inscrypt 2016: 526-541 - [c24]Maciej Skórski:
A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage. ICITS 2016: 279-299 - [c23]Maciej Skorski:
How to Smooth Entropy? SOFSEM 2016: 392-403 - [c22]Maciej Skórski:
Simulating Auxiliary Inputs, Revisited. TCC (B1) 2016: 159-179 - [c21]Krzysztof Pietrzak, Maciej Skórski:
Pseudoentropy: Lower-Bounds for Chain Rules and Transformations. TCC (B1) 2016: 183-203 - [c20]Stefan Dziembowski, Sebastian Faust, Maciej Skórski:
Optimal Amplification of Noisy Leakages. TCC (A2) 2016: 291-318 - [c19]Maciej Skorski:
On Pseudorandomness in Stateless Sources. WISA 2016: 280-291 - [i22]Maciej Skorski:
Key Derivation for Squared-Friendly Applications: Lower Bounds. IACR Cryptol. ePrint Arch. 2016: 157 (2016) - [i21]Maciej Skórski:
A Subgradient Algorithm For Computational Distances and Applications to Cryptography. IACR Cryptol. ePrint Arch. 2016: 158 (2016) - [i20]Krzysztof Pietrzak, Maciej Skorski:
Pseudoentropy: Lower-bounds for Chain rules and Transformations. IACR Cryptol. ePrint Arch. 2016: 159 (2016) - [i19]Maciej Skorski:
Simulating Auxiliary Inputs, Revisited. IACR Cryptol. ePrint Arch. 2016: 808 (2016) - [i18]Maciej Skorski:
A Cryptographic Proof of Regularity Lemmas. IACR Cryptol. ePrint Arch. 2016: 965 (2016) - [i17]Maciej Skorski:
Improved Estimation of Collision Entropy in High and Low-Entropy Regimes and Applications to Anomaly Detection. IACR Cryptol. ePrint Arch. 2016: 1035 (2016) - [i16]Maciej Skorski:
Evaluating Entropy for TRNGs: Efficient, Robust and Provably Secure. IACR Cryptol. ePrint Arch. 2016: 1116 (2016) - [i15]Maciej Skorski:
On the Complexity of Breaking Pseudoentropy. IACR Cryptol. ePrint Arch. 2016: 1186 (2016) - 2015
- [c18]Maciej Skórski:
Time-Advantage Ratios Under Simple Transformations: Applications in Cryptography. BalkanCryptSec 2015: 79-91 - [c17]Onur Günlü, Gerhard Kramer, Maciej Skorski:
Privacy and secrecy with multiple measurements of physical and biometric identifiers. CNS 2015: 89-94 - [c16]Stefan Dziembowski, Sebastian Faust, Maciej Skorski:
Noisy Leakage Revisited. EUROCRYPT (2) 2015: 159-188 - [c15]Maciej Skorski, Alexander Golovnev, Krzysztof Pietrzak:
Condensed Unpredictability. ICALP (1) 2015: 1046-1057 - [c14]Maciej Skorski:
Metric Pseudoentropy: Characterizations, Transformations and Applications. ICITS 2015: 105-122 - [c13]Maciej Skorski:
Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy. ICITS 2015: 123-140 - [c12]Maciej Skórski:
Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint. IMACC 2015: 257-274 - [c11]Maciej Skorski:
Efficiently Simulating High Min-entropy Sources in the Presence of Side Information. INDOCRYPT 2015: 312-325 - [c10]Maciej Skórski:
A New Approximate Min-Max Theorem with Applications in Cryptography. ISAAC 2015: 653-663 - [c9]Krzysztof Pietrzak, Maciej Skorski:
The Chain Rule for HILL Pseudoentropy, Revisited. LATINCRYPT 2015: 81-98 - [c8]Maciej Skorski:
On Provable Security of wPRF-Based Leakage-Resilient Stream Ciphers. ProvSec 2015: 391-411 - [c7]Maciej Skorski:
An Improved Transformation between HILL and Metric Conditional Pseudoentropy. SOFSEM (Student Research Forum Papers / Posters) 2015: 67-77 - [c6]Maciej Skorski:
Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs with Applications to Pseudoentropy. SOFSEM (Student Research Forum Papers / Posters) 2015: 78-89 - [c5]Maciej Skorski:
Metric Pseudoentropy: Characterizations and Applications. SOFSEM (Student Research Forum Papers / Posters) 2015: 90-102 - [c4]Maciej Skorski:
True Random Number Generators Secure in a Changing Environment: Improved Security Bounds. SOFSEM 2015: 590-602 - [c3]Maciej Skorski:
How Much Randomness Can Be Extracted from Memoryless Shannon Entropy Sources? WISA 2015: 75-86 - [i14]Maciej Skorski:
Simulating Side Information: Better Provable Security for Leakage Resilient Stream Ciphers. CoRR abs/1503.00484 (2015) - [i13]Maciej Skorski:
Lower bounds on $q$-wise independence tails and applications to min-entropy condensers. CoRR abs/1504.02333 (2015) - [i12]Maciej Skorski, Alexander Golovnev, Krzysztof Pietrzak:
Condensed Unpredictability. CoRR abs/1504.07621 (2015) - [i11]Maciej Skorski:
A Time-Success Ratio Analysis of wPRF-based Leakage-Resilient Stream Ciphers. CoRR abs/1505.06765 (2015) - [i10]Maciej Skorski:
A New Approximate Min-Max Theorem with Applications in Cryptography. CoRR abs/1506.06633 (2015) - [i9]Maciej Skorski:
Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy. IACR Cryptol. ePrint Arch. 2015: 117 (2015) - [i8]Maciej Skorski, Alexander Golovnev, Krzysztof Pietrzak:
Condensed Unpredictability. IACR Cryptol. ePrint Arch. 2015: 384 (2015) - [i7]Maciej Skorski:
How much randomness can be extracted from memoryless Shannon entropy sources? IACR Cryptol. ePrint Arch. 2015: 591 (2015) - [i6]Krzysztof Pietrzak, Maciej Skorski:
The Chain Rule for HILL Pseudoentropy, Revisited. IACR Cryptol. ePrint Arch. 2015: 599 (2015) - 2014
- [c2]Maciej Skorski:
On Recent Advances in Key Derivation via the Leftover Hash Lemma. ICCSW 2014: 83-90 - [i5]Maciej Skorski:
An Improved Transformation between HILL and Metric Conditional Pseudoentropy. IACR Cryptol. ePrint Arch. 2014: 836 (2014) - [i4]Maciej Skorski:
True Random Number Generators Secure in a Changing Environment: Improved Security Bounds. IACR Cryptol. ePrint Arch. 2014: 837 (2014) - [i3]Maciej Skorski:
A Comprehensive Comparison of Shannon Entropy and Smooth Renyi Entropy. IACR Cryptol. ePrint Arch. 2014: 967 (2014) - 2013
- [c1]Maciej Skorski:
Modulus Computational Entropy. ICITS 2013: 179-199 - [i2]Maciej Skorski:
Modulus Computational Entropy. CoRR abs/1302.2128 (2013) - [i1]Maciej Skorski:
A Convex Analysis Approach to Computational Entropy. CoRR abs/1305.3288 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-19 21:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
