Timeline for Is there a public key semantically secure cryptosystem for which one can prove in zero knowledge the equivalence of two plaintexts?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 17, 2017 at 13:14 | history | edited | CommunityBot |
replaced http://security.stackexchange.com/ with https://security.stackexchange.com/
|
|
| Oct 17, 2012 at 17:38 | comment | added | user991 | Yes, but using the same 256-bit random number to get ciphertext B would mean that the 256-bit random number used to get ciphertext B was not fresh. $\:$ (And now a see that I'd accidentally typed "number" in my first comment, instead of "numbers".) $\;\;$ | |
| Oct 17, 2012 at 14:43 | comment | added | David Cary | @RickyDemer: I'm no poker expert, but I don't follow. If Alice wants to prove that message A (the ace of hearts with a freshly-generated 256-bit random number) is the same as message B (also the ace of hearts with the same 256-bit random number), can't she simply point out that X and Y are identical, without revealing the 256-bit random number or her private key or the fact that A represents the ace of hearts? | |
| Oct 16, 2012 at 19:14 | comment | added | user991 | Alas, if that is done, then it is no longer simple to prove -- without revealing the 256-bit random $\hspace{0.8 in}$ number or the private key -- that the cards represented are equal. $\:$ | |
| Oct 16, 2012 at 18:52 | history | answered | David Cary | CC BY-SA 3.0 |