Perfectly-secure multiparty computation with linear communication complexity over any modulus (Q6965202)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8058682
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfectly-secure multiparty computation with linear communication complexity over any modulus |
scientific article; zbMATH DE number 8058682 |
Statements
Perfectly-secure multiparty computation with linear communication complexity over any modulus (English)
0 references
3 July 2025
0 references
reverse multiplication-friendly embeddings
0 references
sharing transformation
0 references
sparsely packed Shamir sharing
0 references
packed Beaver triples
0 references
0 references
0 references
