Timeline for Why a public key encryption scheme cannot be considered perfect according to Shannon?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 4, 2018 at 16:20 | comment | added | Luigi2405 | Of course it is fine ;) | |
| Jul 4, 2018 at 15:43 | comment | added | Geoffroy Couteau | You are interested in "another theorem"? You explicitly stated that you are looking for a proof that no PKE can be unconditionally secure. Which is exactly an immediate corollary of Shannon's theorem about perfect secrecy (Cédric essentially re-proved Shannon's theorem for the specific case of public-key encryption in his (good) answer below). It seems to me that you were looking for an explanation of Shannon's theorem in the specific case of PKE, not for a formal proof of Shannon's theorem - or are we not talking about the same theorem of Shannon? Anyway, if you got your answer, it's fine :) | |
| Jul 4, 2018 at 15:33 | comment | added | Luigi2405 | @GeoffroyCouteau 3 seconds? I've found it in just 2.. when I was looking for that. I'm interested in another theorem but luckly someone has understood me | |
| Jul 4, 2018 at 13:13 | answer | added | Cédric Van Rompay | timeline score: 2 | |
| Jul 4, 2018 at 12:09 | comment | added | Geoffroy Couteau | Do you know of a formal proof of Shannon's theorem? (You can find that anywhere with 3s of research, it's probably on Wikipedia). A formal proof of this theorem will in particular be a formal proof that no PKE scheme is unconditionnally secure. | |
| Jul 4, 2018 at 9:56 | review | Low quality posts | |||
| Jul 4, 2018 at 12:45 | |||||
| Jul 4, 2018 at 9:55 | comment | added | Luigi2405 | PKE schemes are not uncoditionally (or perfectly, or theoretically, or whatever you prefer) secure accroding to Shannon's Theorem. I'm looking for a formal proof | |
| Jul 4, 2018 at 9:43 | comment | added | mephisto | Just think about an attack. It can be terribly costly and have negligible success probability. However, if you find such an attack that proves that the scheme is not information-theoretically secure. If you can figure out a generic attack that works for all PKE schemes you are done. | |
| Jul 4, 2018 at 9:39 | history | asked | Luigi2405 | CC BY-SA 4.0 |