Timeline for Is there a two-party multiplicative and additive secret sharing scheme ?
Current License: CC BY-SA 2.5
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 21, 2010 at 14:39 | comment | added | Mohammad Alaggan | Thanks for you answer. I am sorry that I forgot to note that I am aware of those schemes. Homomorphic encryption depend on hardness assumptions, while secret sharing is unconditionally secure (and thus provides much better cipher-text size and less computations (since there is no big integer exponentiations). | |
| Jul 21, 2010 at 14:32 | history | answered | falagar | CC BY-SA 2.5 |