Beyond honest majority: the round complexity of fair and robust multi-party computation (Q2181890): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-3-030-34578-5_17 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2990232060 / rank | |||
Normal rank |
Latest revision as of 23:40, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Beyond honest majority: the round complexity of fair and robust multi-party computation |
scientific article |
Statements
Beyond honest majority: the round complexity of fair and robust multi-party computation (English)
0 references
20 May 2020
0 references
fairness
0 references
guaranteed output delivery
0 references
MPC
0 references
round complexity
0 references
dynamic
0 references
boundary
0 references