Thumbnail
Access Restriction
Open

Author Dodis, Yevgeniy ♦ Samanta, Scribe Abhishek
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Entropy Loss Lecturer ♦ Key Derivation ♦ Important Special Class ♦ Important Result ♦ Underlying Application ♦ Uniform Random M-bit Key ♦ Imperfect Source ♦ Key Derivation Function ♦ Last Lecture ♦ Uniformly Random ♦ Important Definition ♦ Perfect Source ♦ Usable M-bit Cryptographic Key ♦ Last Class ♦ Effcient Function Cond ♦ Technical Detail ♦ New Area ♦ H2 Condenser ♦ Today Class ♦ Real Life Application
Abstract In reality, perfect source of randomness is hard to find. So, for real life applications, an imperfect source X of min-entropy k is converted into usable m-bit cryptographic key for some underlying application P. If P has security δ (against some class of attackes) with uniform random m-bit key, our goal is to design a key derivation function (KDF) h that allows us to use R = h(x) as the key for P and results in comparable δ ′ ≈ δ. This lower bound is known to be tight in general. In todays class we explore new areas to design KDFs with less waste for important special classes of sources of X and applications P. 1 Last Class Before delving into technical details, let us refresh our memory with some important definitions and few important results we proved in last lecture. Definition 1 (H2 Condenser) We say that an effcient function Cond: {0, 1} n × {0, 1} v → {0, 1} m is a ( k n m−d m)2-condenser if for H2(X) ≥ k and uniformly random S we have H2(Cond(X; S) S) ≥ m − d.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Publisher Date 2013-01-01