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 this page instead for the normal view: The hardness of LPN over any integer ring and field for PCG applications |
scientific article; zbMATH DE number 7943480
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
