Non-interactive delegation and batch NP verification from standard computational assumptions (Q4977995): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/3055399.3055497 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2625723895 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:03, 19 March 2024
scientific article; zbMATH DE number 6761831
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
