On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3826475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable and Unconditionally Secure Multiparty Computation / 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: Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Round Secure MPC from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four round secure computation without setup / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to round-optimal secure multiparty computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-optimal secure multi-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Promise zero knowledge and its applications to round optimal MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Achieving the “Best of Both Worlds” in Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Secure Comparison for On-Line Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds / 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: \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Computation on the Web: Computing without Simultaneous Interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Exact Round Complexity of Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Round Multiparty Computation via Multi-key FHE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409117 / 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: Secure Computation with Minimal Interaction, Revisited / 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: Beyond honest majority: the round complexity of fair and robust multi-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Multiparty Computation with Minimal Interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Efficient and Composable Oblivious Transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Protocol Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Cheaters without an Honest Majority / 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: Round-optimal fully black-box zero-knowledge arguments from one-way permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact round complexity of best-of-both-worlds multi-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: MPC vs. SFE : Unconditional and Computational Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best possible information-theoretic MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graceful Degradation in Multi-Party Computation (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Passive Corruption in Statistical Multi-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best of both worlds in secure computation, with low communication overhead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Founding Cryptography on Tamper-Proof Hardware Tokens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Physically Uncloneable Functions in the Universal Composition Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcast-optimal two-round MPC / rank
 
Normal rank

Latest revision as of 20:13, 31 July 2024

scientific article
Language Label Description Also known as
English
On the exact round complexity of best-of-both-worlds multi-party computation
scientific article

    Statements

    On the exact round complexity of best-of-both-worlds multi-party computation (English)
    0 references
    0 references
    0 references
    0 references
    29 March 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references