Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626)
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 7096133
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation |
scientific article; zbMATH DE number 7096133 |
Statements
Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (English)
0 references
20 August 2019
0 references
constrained pseudorandom functions
0 references
verifiable constrained pseudorandom function
0 references
key delegation
0 references
Turing machines
0 references
indistinguishability obfuscation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.914186418056488
0 references
0.8416754603385925
0 references
0.8327627778053284
0 references
0.8310455083847046
0 references
0.8273036479949951
0 references
