Beyond honest majority: the round complexity of fair and robust multi-party computation
From MaRDI portal
Publication:6109085
DOI10.1007/s00145-023-09468-0zbMath1518.94085OpenAlexW2979222292MaRDI QIDQ6109085
Publication date: 26 July 2023
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-023-09468-0
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- Round-optimal secure multiparty computation with honest majority
- Security and composition of multiparty cryptographic protocols
- Broadcast-optimal two-round MPC
- Degree 2 is complete for the round-complexity of malicious MPC
- Secure MPC: laziness leads to GOD
- Secure Protocol Transformations
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
- Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation
- On Achieving the “Best of Both Worlds” in Secure Multiparty Computation
- Graceful Degradation in Multi-Party Computation (Extended Abstract)
- How to share a secret
- Computational Verifiable Secret Sharing Revisited
- The Round Complexity of Verifiable Secret Sharing Revisited
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Secure Computation with Minimal Interaction, Revisited
- MPC vs. SFE : Unconditional and Computational Security
- Perfectly secure message transmission
- Foundations of Cryptography
- Foundations of Cryptography
- How to Simulate It – A Tutorial on the Simulation Proof Technique
- Hybrid-secure MPC
- Secure Computation on the Web: Computing without Simultaneous Interaction
- Advances in Cryptology - EUROCRYPT 2004
- MPC vs. SFE: Perfect Security in a Unified Corruption Model
- 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
This page was built for publication: Beyond honest majority: the round complexity of fair and robust multi-party computation
