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

From MaRDI portal
Revision as of 14:31, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
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