Name
Abstract | ||
|---|---|---|
It is a long-standing open problem to prove the existence of deterministic hard-core predicates for the Computational Diffie-Hellman CDH problem over finite fields, without resorting to the generic approaches for any one-way functions e.g., the Goldreich-Levin hard-core predicates. Fazio et al. FGPS, Crypto﾿'13 made important progress on this problem by defining a weaker Computational Diffie-Hellman problem over﾿$$\\mathbb {F}_{p^2}$$Fp2, i.e., Partial-CDH problem, and proving, when allowing changing field representations, the unpredictability of every single bit of one of the coordinates of the secret Diffie-Hellman value. In this paper, we show that all the individual bits of the CDH problem over $$\\mathbb {F}_{p^2}$$Fp2 and almost all the individual bits of the CDH problem over $$\\mathbb {F}_{p^t}$$Fpt for﾿$$t>2$$t>2 are hard-core. |
Year | Venue | DocType |
|---|---|---|
2015 | SAC | Conference |
Citations | PageRank | References |
1 | 0.36 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mingqiang Wang | 1 | 7 | 10.35 |
| Tao Zhan | 2 | 63 | 8.51 |
| Haibin Zhang | 3 | 118 | 18.58 |