Broadcast-optimal two round MPC with an honest majority (Q2128559): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ivan B. Damgård / rank
Normal rank
 
Property / author
 
Property / author: Ivan B. Damgård / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3096450998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-optimal secure multiparty computation with honest majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two round information-theoretic MPC with malicious security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcast-optimal two-round MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authenticated Algorithms for Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the time to assure interactive consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: The round complexity of verifiable secret sharing and secure multicast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round MPC with Fairness and Guarantee of Output Delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-round multiparty secure computation from minimal assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Computation with Minimal Interaction, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Multiparty Computation with Minimal Interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact round complexity of secure three-party computation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:36, 28 July 2024

scientific article
Language Label Description Also known as
English
Broadcast-optimal two round MPC with an honest majority
scientific article

    Statements

    Broadcast-optimal two round MPC with an honest majority (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 April 2022
    0 references
    0 references
    selective abort
    0 references
    honest majority setting
    0 references
    0 references