Timeline for Is pseudorandom function also a one-way function?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 27, 2016 at 21:49 | history | tweeted | twitter.com/StackCrypto/status/758419024296472576 | ||
| Jul 27, 2016 at 15:18 | history | edited | e-sushi | CC BY-SA 3.0 |
added 40 characters in body
|
| Oct 21, 2015 at 18:46 | comment | added | Dig | @SEJPM A small mistake: PRF security doesn't guarantee that you won't be able to find the input faster than brute-force. It simply state that there exists no polynomial-time algorithm that will be able to distinguish between the PRF and a random function. Note that there might be a subexponential algorithm (which will be much faster than brute-force) that might be able to distinguish and even retrieve the key, and the PRF will be considered secure nevertheless. | |
| Oct 21, 2015 at 9:34 | answer | added | kung_fu_coder | timeline score: 2 | |
| Oct 21, 2015 at 0:01 | answer | added | user991 | timeline score: 4 | |
| Oct 20, 2015 at 21:55 | comment | added | SEJPM | In this case you shouldn't be able to distinguish prf from a random function and you can't find the input faster than brute-force. | |
| Oct 20, 2015 at 21:53 | comment | added | cryptodog | No, you don't have the key $k$. | |
| Oct 20, 2015 at 21:21 | comment | added | SEJPM | are you given the key $k$ in the first one? The second one should hold. | |
| Oct 20, 2015 at 21:08 | history | asked | cryptodog | CC BY-SA 3.0 |