Non-interactive delegation and batch NP verification from standard computational assumptions (Q4977995)
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: Non-interactive delegation and batch NP verification from standard computational assumptions |
scientific article; zbMATH DE number 6761831
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-interactive delegation and batch NP verification from standard computational assumptions |
scientific article; zbMATH DE number 6761831 |
Statements
Non-interactive delegation and batch NP verification from standard computational assumptions (English)
0 references
17 August 2017
0 references
batch arguments for NP
0 references
computational no-signaling
0 references
delegation of computation
0 references
private information retrieval
0 references
probabilistically checkable proofs
0 references
0.8324584364891052
0 references
0.8294907808303833
0 references
0.8201823234558105
0 references
0.7948499321937561
0 references
