Information-theoretically secure MPC against mixed dynamic adversaries
From MaRDI portal
Publication:2695650
DOI10.1007/978-3-030-90459-3_20OpenAlexW3213938036MaRDI QIDQ2695650
Divya Ravi, Ivan B. Damgård, Daniel E. Escudero
Publication date: 31 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90459-3_20
Cites Work
- Unnamed Item
- Unnamed Item
- Security and composition of multiparty cryptographic protocols
- Guaranteed output delivery comes free in honest majority MPC
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- Graceful Degradation in Multi-Party Computation (Extended Abstract)
- MPC vs. SFE : Unconditional and Computational Security
- Perfectly secure message transmission
- MPC vs. SFE: Perfect Security in a Unified Corruption Model