Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
scientific article

    Statements

    Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (English)
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers