Timeline for Lsb as hard core predicate in a sign-hash scheme
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 11, 2017 at 22:11 | comment | added | ckamath | The only claim I came across was that the LSB is a random bit (in Page 27), which it is. | |
| Apr 11, 2017 at 19:54 | comment | added | graphtheory92 | arxiv.org/pdf/1607.01341.pdf page 26 | |
| Apr 10, 2017 at 20:02 | comment | added | ckamath | Assuming that the one-way function here is $SIG_k(\cdot)$, the predicate defined is not hard-core: it is easy to compute $hc(x)$ given the value of $SIG_k(x)$ (as everyone has access to the oracle $H$). Could you provide links to the papers you mention? | |
| Apr 10, 2017 at 19:32 | history | asked | graphtheory92 | CC BY-SA 3.0 |