Timeline for Functional Encryption (for Non Experts)
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 17, 2014 at 18:10 | vote | accept | user47368 | ||
| Mar 7, 2014 at 21:20 | comment | added | user991 | Another possibility is security against adversaries that can choose the Turing $\hspace{1.46 in}$ machines after seeing the challenge ciphertext. $\;$ | |
| Mar 7, 2014 at 20:57 | history | edited | Daniel Apon | CC BY-SA 3.0 |
added 182 characters in body
|
| Mar 7, 2014 at 20:51 | review | First posts | |||
| Mar 7, 2014 at 21:45 | |||||
| Mar 7, 2014 at 20:46 | history | edited | Daniel Apon | CC BY-SA 3.0 |
added 22 characters in body
|
| Mar 7, 2014 at 20:43 | comment | added | Daniel Apon | One last comment: Note that the ciphertexts in the paper you linked are asymptotically much larger than O(secparam)-bits. More recent schemes have this property (and this will essentially be a necessary property for a practical scheme); see e.g. Garg, et al for a succinct-ciphertext FE scheme | |
| Mar 7, 2014 at 20:39 | comment | added | Daniel Apon | Note: Some very recent papers tackle parts of these problems, and others that I'm not mentioning here. | |
| Mar 7, 2014 at 20:36 | history | answered | Daniel Apon | CC BY-SA 3.0 |