Name
Abstract | ||
|---|---|---|
Secure Multiparty Computation protocols secure under the malicious model provide a strong guarantee of privacy and correctness. The semi-honest model provides what appears to be a much weaker guarantee, requiring parties to follow the protocol correctly. We show that for all but a small class of problems, those in the non-cooperatively computable class, the correctness guarantee of the malicious protocol effectively requires semi-honest parties as well. This suggests a wider utility than previously thought for semi-honest protocols. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-32430-8_4 | DECISION AND GAME THEORY FOR SECURITY |
Keywords | Field | DocType |
Secure multi party computation, Malicious and, semi-honest models, Incentive compatibility | Secure multi-party computation,Incentive compatibility,Computer security,Computer science,Correctness | Conference |
Volume | ISSN | Citations |
11836 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Radhika Bhargava | 1 | 1 | 0.68 |
| Chris Clifton | 2 | 3327 | 544.44 |