On communication models and best-achievable security in two-round MPC (Q2697851): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Perfect secure computation in two rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree 2 is complete for the round-complexity of malicious MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcast-optimal two-round MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-round MPC: information-theoretic and black-box / 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: Q4409117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definitions and properties of zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The knowledge complexity of interactive proof-systems / 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: Cryptography in the Multi-string Model / 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: Secure Multi-Party Computation with Identifiable Abort / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact round complexity of secure three-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank

Latest revision as of 21:37, 31 July 2024

scientific article
Language Label Description Also known as
English
On communication models and best-achievable security in two-round MPC
scientific article

    Statements

    On communication models and best-achievable security in two-round MPC (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 April 2023
    0 references
    round-optimal secure multi-party computation
    0 references
    honest-majority MPC
    0 references

    Identifiers