Broadcast-optimal two-round MPC (Q2119034): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the round complexity of randomized Byzantine agreement / rank
 
Normal rank

Latest revision as of 12:13, 4 December 2024

scientific article
Language Label Description Also known as
English
Broadcast-optimal two-round MPC
scientific article

    Statements

    Broadcast-optimal two-round MPC (English)
    0 references
    0 references
    0 references
    0 references
    23 March 2022
    0 references
    secure multi-party computation
    0 references
    point-to-point rounds
    0 references
    maliciously secure MPC protocols
    0 references
    0 references
    0 references
    0 references

    Identifiers