Pages that link to "Item:Q5918346"

The following pages link to Round-optimal secure multi-party computation (Q5918346):

Displaying 24 items.

• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits (Q1648849) (← links)
• A new approach to round-optimal secure multiparty computation (Q1675737) (← links)
• Four round secure computation without setup (Q1690211) (← links)
• Round optimal concurrent MPC via strong simulation (Q1690214) (← links)
• Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
• Round-optimal secure multiparty computation with honest majority (Q1784101) (← links)
• Towards round-optimal secure multiparty computations: multikey FHE without a CRS (Q1784443) (← links)
• Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
• One-round secure fair meeting location determination based on homomorphic encryption (Q2282275) (← links)
• Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
• Constant-Round Multi-party Private Set Union Using Reversed Laurent Series (Q2900231) (← links)
• Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security (Q3102211) (← links)
• (Q3500748) (← links)
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography (Q3563850) (← links)
• Round-Optimal Contributory Conference Key Agreement (Q4414705) (← links)
• (Q4535073) (← links)
• Secure Multi-Party Computation for Elliptic Curves (Q5253630) (← links)
• Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma (Q5261632) (← links)
• Advances in Cryptology – CRYPTO 2004 (Q5311543) (← links)
• Round Efficient Unconditionally Secure Multiparty Computation Protocol (Q5504622) (← links)
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
• Constant-round linear-broadcast secure computation with penalties (Q6041674) (← links)
• Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) (Q6114266) (← links)
• Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)