6 citations · 26 across the 32 of their papers we have counts for
5 papers · 2 filters
A New Approximate Min-Max Theorem with Applications in Cryptography
Maciej Skorski
We propose a novel proof technique that can be applied to attack a broad class of problems in computational complexity, when switching the order of universal and existential quanti…
A Time-Success Ratio Analysis of wPRF-based Leakage-Resilient Stream Ciphers
Maciej Skorski
Weak pseudorandom functions (wPRFs) found an important application as main building blocks for leakage-resilient ciphers (EUROCRYPT'09). Several security bounds, based on different…
Condensed Unpredictability
Maciej Skorski, Alexander Golovnev, Krzysztof Pietrzak
We consider the task of deriving a key with high HILL entropy from an unpredictable source. Previous to this work, the only known way to transform unpredictability into a key that…
Lower bounds on -wise independence tails and applications to min-entropy condensers
Maciej Skorski
We present novel and sharp lower bounds for higher load moments in the classical problem of mapping balls into bins by -universal hashing, specialized to the case when $…
Simulating Auxiliary Inputs, Revisited
Maciej Skorski
For any pair of correlated random variables we can think of as a randomized function of . Provided that is short, one can make this function computationally effi…