Cryptographic limitations on polynomial-time posteriori query learning (Q1671013)
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: Cryptographic limitations on polynomial-time posteriori query learning |
scientific article; zbMATH DE number 6932711
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cryptographic limitations on polynomial-time posteriori query learning |
scientific article; zbMATH DE number 6932711 |
Statements
Cryptographic limitations on polynomial-time posteriori query learning (English)
0 references
6 September 2018
0 references
computational learning theory
0 references
PAC learning
0 references
query learning
0 references
cryptography
0 references
encryption
0 references
signature
0 references
0.8068949580192566
0 references
0.8068949580192566
0 references
0.7955694198608398
0 references
