The hardness of LPN over any integer ring and field for PCG applications (Q6637566)
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 7943480
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The hardness of LPN over any integer ring and field for PCG applications |
scientific article; zbMATH DE number 7943480 |
Statements
The hardness of LPN over any integer ring and field for PCG applications (English)
0 references
13 November 2024
0 references
learning parity with noise
0 references
secure multi-party computation
0 references
zero-knowledge proofs
0 references
private set intersection
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8594560623168945
0 references
0.8223004341125488
0 references
0.8022968173027039
0 references
0.7953906655311584
0 references
