A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity (Q2119064): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users 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-64378-2_23 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3118045199 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:18, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity |
scientific article |
Statements
A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity (English)
0 references
23 March 2022
0 references
secure multiparty computation protocol
0 references
honest majority
0 references
information-theoretical security
0 references
reverse multiplication friendly embeddings
0 references
