Timeline for Importance of round complexity in determining the efficiency of an MPC protocol
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 24, 2016 at 9:12 | vote | accept | sun | ||
| Jun 24, 2016 at 9:12 | vote | accept | sun | ||
| Jun 24, 2016 at 9:12 | |||||
| Jun 23, 2016 at 19:16 | history | tweeted | twitter.com/StackCrypto/status/746059483378520064 | ||
| Jun 23, 2016 at 12:45 | answer | added | Geoffroy Couteau | timeline score: 2 | |
| Jun 23, 2016 at 9:08 | vote | accept | sun | ||
| Jun 24, 2016 at 9:12 | |||||
| Jun 22, 2016 at 14:11 | answer | added | Yehuda Lindell | timeline score: 9 | |
| Jun 22, 2016 at 14:06 | comment | added | Dragos | With BMR you can achieve any functionality in a constant number of rounds even with dishonest majority - see eprint.iacr.org/2015/523 | |
| Jun 22, 2016 at 12:53 | history | edited | mikeazo | CC BY-SA 3.0 |
added 22 characters in body
|
| Jun 22, 2016 at 12:45 | history | asked | sun | CC BY-SA 3.0 |