Timeline for How can I show RSA OAEP IND-CPA secure
Current License: CC BY-SA 4.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 21, 2022 at 23:55 | comment | added | Sam Ginrich | Think this question is not specific for RSA, nor for the security of textbook RSA or the encryption algorithm at all. It's a question of protocol and network topology. In any case, there is a time, when you decide to consider a message as authentic. Essential help is having two communication lines, which in the public area have no intersection, so an assumed "man in the middle" will miss at least one part of required messages of key exchange. | |
Jul 13, 2020 at 19:21 | history | edited | puzzlepalace | CC BY-SA 4.0 |
Fixed non-negligible to negligible.
|
Jul 13, 2020 at 8:09 | comment | added | jvdh | the adversary has negligible advantage, not non-negligible advantage | |
Dec 12, 2018 at 14:01 | vote | accept | Sam | ||
Dec 12, 2018 at 14:01 | |||||
May 9, 2016 at 21:35 | comment | added | puzzlepalace | You are correct, answer has been edited. | |
May 9, 2016 at 21:35 | history | undeleted | puzzlepalace | ||
May 9, 2016 at 21:35 | history | edited | puzzlepalace | CC BY-SA 3.0 |
added 1004 characters in body
|
May 9, 2016 at 20:51 | history | deleted | puzzlepalace | via Vote | |
May 9, 2016 at 20:43 | comment | added | SEJPM | Please note: textbook RSA by itself is deterministic (if you use it in a traditional sense as $m^e\bmod N$), thus it cannot be IND-CPA (also see theorem 11.4 of Katz/Lindell's Introduction to modern cryptography 2nd edition). However, OAEP does include randomness and this is the crucial part for IND-CPA here. | |
May 9, 2016 at 20:17 | history | answered | puzzlepalace | CC BY-SA 3.0 |