Timeline for Is there a two-party multiplicative and additive secret sharing scheme ?
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 12, 2010 at 18:45 | vote | accept | Mohammad Alaggan | ||
| Aug 4, 2010 at 15:46 | comment | added | Loick | I do not know much about classical cryptography. The sketch of the proof I know: classical OT is not unconditionally secure because quantum OT is not. Quantum OT is equivalent to Quantum Bit-Commitment. Quantum Bit-Commitment is not unconditionally secure (First proof by Mayers [PRL 78, 3414] and Lo and Chau [PRL 78, 3410]. Most complete paper by d'Ariano et al.[arxiv 0905.3801]) Please note that classical OT and classical bit-commitment are NOT equivalent, bit-commitment is a weaker primitive. I guess there are direct proofs of these no-go result without going through all these reductions) | |
| Aug 3, 2010 at 17:52 | comment | added | Mohammad Alaggan | Do you have a reference for the impossibility of OT in both classical and quantum case ? | |
| Jul 30, 2010 at 2:44 | history | answered | Loick | CC BY-SA 2.5 |