Must the communication graph of MPC protocols be an expander? (Q775967)

From MaRDI portal
Revision as of 11:46, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Must the communication graph of MPC protocols be an expander?
scientific article

    Statements

    title
    Must the communication graph of MPC protocols be an expander? (English)
    0 references
    author
    Elette Boyle
    0 references
    Ran Cohen
    0 references
    Deepesh Data
    0 references
    Pavel Hubáček
    0 references
    publication date
    30 June 2020
    0 references
    Mathematics Subject Classification ID
    94A05
    0 references
    94A60
    0 references
    05C48
    0 references
    68P25
    0 references
    68M12
    0 references
    zbMATH DE Number
    7216149
    0 references
    zbMATH Keywords
    Secure multiparty computation on incomplete communication networks
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q775967&oldid=12702614"
    Powered by MediaWiki