Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation (Q5738765)
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 6729538
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation |
scientific article; zbMATH DE number 6729538 |
Statements
Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation (English)
0 references
13 June 2017
0 references
constrained pseudorandom functions
0 references
verifiable constrained pseudorandom function
0 references
key delegation
0 references
indistinguishability obfuscation
0 references
0 references
0 references
0.914186418056488
0 references
0.8560600280761719
0 references
0.8480168581008911
0 references
0.8435685634613037
0 references
0.836587131023407
0 references
