Timeline for Is the reduction from left-or-right IND-CPA to real-or-random IND-CPA tight?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 8, 2015 at 1:56 | comment | added | pxdnr | Your answer is correct, but I went with the other one because it gave more explanation. | |
| Jun 7, 2015 at 7:25 | comment | added | user991 | I believe I fixed that problem. $\:$ Now, in the lor case, the adversary can learn which one $\hspace{1.21 in}$ it was when the ciphertext's initial bit is a $1$. $\;\;\;\;$ | |
| Jun 7, 2015 at 7:22 | history | edited | user991 | CC BY-SA 3.0 |
gave hopefully correct construction
|
| Jun 7, 2015 at 5:13 | comment | added | pxdnr | Do I understand your response correctly in that it should be a construction for which the lor advantage is nearly double the ror advantage? If so, could you perhaps provide some computations, because the adversaries I come up with don't show this gap in advantage. | |
| Mar 5, 2015 at 21:15 | history | edited | user991 | CC BY-SA 3.0 |
inserted length requirement
|
| Mar 4, 2015 at 12:18 | history | answered | user991 | CC BY-SA 3.0 |