FE and iO for Turing machines from minimal assumptions (Q1631345)

From MaRDI portal
scientific article
Language Label Description Also known as
English
FE and iO for Turing machines from minimal assumptions
scientific article

    Statements

    FE and iO for Turing machines from minimal assumptions (English)
    0 references
    0 references
    0 references
    6 December 2018
    0 references
    indistinguishability obfuscation (iO)
    0 references
    functional encryption (FE) schemes
    0 references
    Turing machine model
    0 references
    0 references
    0 references
    0 references

    Identifiers