Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Breaking the circuit size barrier for secure computation under quasi-polynomial LPN |
scientific article; zbMATH DE number 7440629
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Breaking the circuit size barrier for secure computation under quasi-polynomial LPN |
scientific article; zbMATH DE number 7440629 |
Statements
Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (English)
0 references
8 December 2021
0 references
homomorphic secret sharing
0 references
multiparty computation
0 references
sublinear communication
0 references
learning parity with noise
0 references
pseudorandom correlation generators
0 references
0 references
0 references
0 references
