Maciej Skorski

  • Citations Per Year
Learn More
The so-called leakage-chain rule is a very important tool used in many security proofs. It gives an upper bound on the entropy loss of a random variable X in case the adversary who having already learned some random variables Z1, . . . , Zl correlated with X, obtains some further information Zl+1 aboutX. Analogously to the information-theoretic case, one(More)
Hardcore lemmas are results in complexity theory which state that average-case hardness must have a very hard “kernel”, that is a subset of instances where the given problem is extremely hard. They find important applications in hardness amplification. In this paper we revisit the following two fundamental results: (a) The hardcore lemma for(More)
Hardcore lemmas are results in complexity theory which state that average-case hardness must have a very hard “kernel”, that is a subset of instances where the problem is extremely hard. Such results find important applications in hardness amplification. In this paper we revisit two classical results: (a) The hardcore lemma for unpredictability, proved(More)
Multiple measurements of a physical or biometric identifier are used at the decoder of a secrecy system to improve the secret-key vs. privacy-leakage capacity region of the single-measurement case. The capacity regions of doubly symmetric binary sources with multiple measurements are derived by applying Mrs. Gerber's lemma to mixtures of binary channels.
We revisit the problem of estimating entropy of discrete distributions from independent samples, studied recently by Acharya, Orlitsky, Suresh and Tyagi (SODA 2015), improving their upper and lower bounds on the necessary sample size n. For estimating Renyi entropy of order α, up to constant accuracy and error probability, we show the following Upper bounds(More)