Timeline for Prove that a given encryption scheme is perfectly secret
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 7, 2017 at 12:45 | vote | accept | Matthew | ||
| S Mar 7, 2017 at 12:45 | history | suggested | user | CC BY-SA 3.0 |
Incorporate from comments
|
| Mar 7, 2017 at 12:26 | review | Suggested edits | |||
| S Mar 7, 2017 at 12:45 | |||||
| Mar 6, 2017 at 23:52 | answer | added | rodentrabies | timeline score: 3 | |
| Mar 6, 2017 at 23:12 | comment | added | Maarten Bodewes♦ | So? If you encrypt a message m=0 and you get ciphertext c=2 then what will you get if you encrypt m=1? What, for that matter, will happen if you encrypt a message valued 0 twice? | |
| Mar 6, 2017 at 19:42 | history | edited | SEJPM | CC BY-SA 3.0 |
fixed the functional correctness exercise
|
| Mar 6, 2017 at 19:33 | comment | added | Matthew | To be honest, I just don't know how to approach this problem. I understand what it means to be perfectly secret, but I don't know how to go about applying that to this question. | |
| Mar 6, 2017 at 19:33 | history | edited | Matthew | CC BY-SA 3.0 |
edited body
|
| Mar 6, 2017 at 16:51 | comment | added | SEJPM | Can you please tell us what you have tried and where exactly you got stuck in solving this problem? This will greatly help us to better help you. And welcome to Crypto.SE! :) | |
| Mar 6, 2017 at 16:50 | history | edited | SEJPM | CC BY-SA 3.0 |
introduced Latex, removed thanks, thank with upvotes and accepts, clarified the quote
|
| Mar 6, 2017 at 16:41 | review | First posts | |||
| Mar 6, 2017 at 17:53 | |||||
| Mar 6, 2017 at 16:41 | history | asked | Matthew | CC BY-SA 3.0 |