Timeline for Statistical closeness implies computational indistinguishability
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 14, 2022 at 15:29 | comment | added | killertoge | With my way of proof I also get the answer that it does not matter how strong the distinguisher is, as long as the ensembles are statistically close then the advantage stays negligible. | |
| Sep 25, 2019 at 7:21 | comment | added | Marc Ilunga | @Hilder indeed in this case, I did not restrict the distinguisher to a particular class(PPT) of di to make the argument. An naturally more interesting case would to try an workout the advantage for a particular class, which in most case is generally not easy. | |
| Sep 20, 2019 at 8:17 | comment | added | Hilder Vitor Lima Pereira | So, does it not matter if the distinguisher runs in polynomial or exponential time? | |
| Sep 7, 2019 at 9:55 | history | edited | Marc Ilunga | CC BY-SA 4.0 | edited body |
| Sep 7, 2019 at 9:49 | history | edited | Marc Ilunga | CC BY-SA 4.0 | Removed involuntary bragging.... |
| Sep 6, 2019 at 20:35 | history | answered | Marc Ilunga | CC BY-SA 4.0 |