#### Filter Results:

#### Publication Year

2013

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

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,. .. , Z ℓ correlated with X, obtains some further information Z ℓ+1 about X. Analogously to the information-theoretic case, one… (More)

We consider the task of deriving a key with high HILL entropy (i.e., being computationally indistinguishable from a key with high min-entropy) from an unpredictable source. Previous to this work, the only known way to transform unpredictability into a key that was indistinguishable from having min-entropy was via pseudorandomness, for example by… (More)

- Eduard Jorswieck, Derrick Wing Kwan Ng, Yan Sun Friedrich-Alexander, Carsten Janda, Janis Noetzel, Holger Boche +12 others
- CNS
- 2015

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)

We provide a new inequality that links two important en-tropy notions: Shannon Entropy H1 and collision entropy H2. Our formula gives the worst possible amount of collision entropy in a probability distribution, when its Shannon Entropy is fixed. While in practice it is easier to evaluate Shannon entropy than other entropy notions, it is well known in… (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)

Weak pseudorandom functions (wPRFs) found an important application as main building blocks for leakage-resilient ciphers (EURO-CRYPT'09). Several security bounds, based on different techniques, were given to these stream ciphers. The security loss in these reduction-based proofs is always polynomial, but has not been studied in detail. The aim of this paper… (More)