Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation (Q5738765)

From MaRDI portal
Revision as of 09:16, 2 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6729538
Language Label Description Also known as
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
    0 references
    0 references
    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

    Identifiers