Timeline for Homomorphic Modular Reduction for Secure Storage
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 2, 2019 at 17:14 | comment | added | kelalaka | @Jeremy'Chu Please look at this answer Representing a function as FHE circuit you will find what you need. | |
| Dec 2, 2019 at 14:30 | comment | added | Jeremy' Chu | Thanks @kelalaka, it seems work, but I have another question here. In the last procedure, the Server $S$ should compare $R$ and $E_{0}$, to decide whether to add $N$ again. Does it mean the $Server$ possess the ciphertext of number $0$, if so, the $Server$ can compare any two values, and it is not secure. | |
| Nov 28, 2019 at 17:56 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Nov 28, 2019 at 16:42 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Nov 28, 2019 at 7:57 | history | answered | kelalaka | CC BY-SA 4.0 |