Timeline for How can homomorphic encryption be probabilistic while allowing for math to be conducted?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 24, 2018 at 20:50 | vote | accept | nick carraway | ||
| Jul 24, 2018 at 6:05 | history | tweeted | twitter.com/StackCrypto/status/1021637360847609856 | ||
| Jul 23, 2018 at 18:38 | comment | added | Luis Casillas | I can't answer your question fully, but I can spot one problem: your assumption that probabilistic encryption prepends a random string to the ciphertext is too strong. Rather, probabilistic encryption must produce outputs that are larger than the inputs; prepending a random string is just a special case of that which applies to some of the basic examples of probabilistic encryption (e.g., CBC mode). | |
| Jul 23, 2018 at 18:38 | answer | added | fgrieu♦ | timeline score: 6 | |
| Jul 23, 2018 at 17:25 | history | edited | nick carraway |
edited tags
|
|
| Jul 23, 2018 at 17:10 | history | edited | nick carraway | CC BY-SA 4.0 |
added 11 characters in body
|
| Jul 23, 2018 at 16:48 | history | edited | nick carraway | CC BY-SA 4.0 |
added 133 characters in body
|
| Jul 23, 2018 at 16:42 | history | asked | nick carraway | CC BY-SA 4.0 |