Name
Abstract | ||
|---|---|---|
In this paper we introduce very simple deterministic randomness extractors for Diffie-Hellman distributions. More specifically we show that the k most significant bits or the k least significant bits of a random element in a subgroup of $\mathbb Z^\star_p$ are indistinguishable from a random bit-string of the same length. This allows us to show that under the Decisional Diffie-Hellman assumption we can deterministically derive a uniformly random bit-string from a Diffie-Hellman exchange in the standard model. Then, we show that it can be used in key exchange or encryption scheme to avoid the leftover hash lemma and universal hash functions |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11787006_21 | ICALP (2) |
Keywords | Field | DocType |
universal hash function,decisional diffie-hellman assumption,key exchange,diffie-hellman exchange,diffie-hellman scheme,leftover hash lemma,random element,secret key,diffie-hellman distribution,encryption scheme,random bit-string,significant bit,diffie hellman,exponential sum,standard model,least significant bit,hash function | Random element,Discrete mathematics,Leftover hash lemma,Combinatorics,Encryption,Hash function,Mathematics,Least significant bit,Diffie–Hellman problem,Randomness,Diffie–Hellman key exchange | Conference |
Volume | ISSN | ISBN |
4052 | 0302-9743 | 3-540-35907-9 |
Citations | PageRank | References |
7 | 0.55 | 25 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pierre-Alain Fouque | 1 | 1762 | 107.22 |
| David Pointcheval | 2 | 781 | 33.25 |
| Jacques Stern | 3 | 173 | 12.81 |
| Sébastien Zimmer | 4 | 205 | 9.29 |