Timeline for Is $(a,g^{ab})$ computationally indistinguishable from $(a, g^c)$?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 4, 2015 at 9:24 | comment | added | phan | Thank you very much, @poncho and Ricky Demer. By the way, is there any real cryptographic protocols/schemes that uses this property? | |
| Jun 2, 2015 at 20:17 | comment | added | user991 | Agh, very good point, I just made that change. $\;$ | |
| Jun 2, 2015 at 20:16 | history | edited | user991 | CC BY-SA 3.0 |
fixed error
|
| Jun 2, 2015 at 19:47 | comment | added | poncho | Correction: if q has no small factors, then they are statistically indistinguishable. For example, if $q = 2r$ for large prime $r$, it's not smooth; however is $a$ is even and $c$ is odd, $g^{ab}$ and $g^c$ can be distinguished. | |
| Jun 2, 2015 at 3:48 | vote | accept | phan | ||
| Jun 2, 2015 at 3:40 | history | answered | user991 | CC BY-SA 3.0 |