Perfectly-Secure MPC with Linear Communication Complexity (Q5445508)

From MaRDI portal
Revision as of 11:40, 27 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 5242856
Language Label Description Also known as
English
Perfectly-Secure MPC with Linear Communication Complexity
scientific article; zbMATH DE number 5242856

    Statements

    Perfectly-Secure MPC with Linear Communication Complexity (English)
    0 references
    5 March 2008
    0 references
    Multi-party computation
    0 references
    efficiency
    0 references
    perfect security
    0 references
    hyper-invertible matrix
    0 references

    Identifiers