Three halves make a whole? Beating the half-gates lower bound for garbled circuits (Q2120069)

From MaRDI portal
Revision as of 16:22, 31 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Three halves make a whole? Beating the half-gates lower bound for garbled circuits
scientific article

    Statements

    Three halves make a whole? Beating the half-gates lower bound for garbled circuits (English)
    0 references
    0 references
    0 references
    31 March 2022
    0 references
    garbling scheme for Boolean circuits
    0 references

    Identifiers