On the exact round complexity of best-of-both-worlds multi-party computation

DOI10.1007/978-3-030-64840-4_3OpenAlexW3090840443MaRDI QIDQ2691581

Divya Ravi, Swati Singla, Arpita Patra

Publication date: 29 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-64840-4_3

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68Mxx)

Related Items (1)

On the exact round complexity of best-of-both-worlds multi-party computation

Cites Work

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

This page was built for publication: On the exact round complexity of best-of-both-worlds multi-party computation