#### Filter Results:

#### Publication Year

2009

2016

#### Co-author

#### Key Phrase

#### Publication Venue

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)

We present a case of a 40-year old woman diagnosed with a four-place spontaneous paraganglioma-pheochromocytoma syndrome, which was treated surgically. The presence of the succinate dehydrogenase complex subunit D (SDHD) mutation that causes the pheochromocytoma was confirmed but no mutations in the family members were found. After the excision of the… (More)

The authors present a case report of a patient with a large, hormonally silent tumour of the right adrenal gland. Due to the patient's numerous strains, the necessity of two gynaecological operations, and treatment of broken bones, adrenalectomy was contraindicated for 2 years. After that time, the size of the tumour reached 18 cm × 12 cm. The patient was… (More)

Hypercortisolaemia during pregnancy constitutes a serious threat to life of the mother and fetus and may be associated with adrenocortical carcinoma. The objective of this study is to present the usefulness of laparoscopic procedures in treating adrenal tumours in such cases. One 21-year-old woman, 24 weeks pregnant, with hypertension and Cushing's syndrome… (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)

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)