Information-theoretically secure MPC against mixed dynamic adversaries
From MaRDI portal
Recommendations
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
- MPC vs. SFE: Perfect Security in a Unified Corruption Model
- Best possible information-theoretic MPC
- Hybrid-secure MPC, trading information-theoretic robustness for computational privacy
- MPC vs. SFE : Unconditional and Computational Security
Cites work
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Graceful degradation in multi-party computation. (Extended abstract)
- Guaranteed output delivery comes free in honest majority MPC
- scientific article; zbMATH DE number 1302842 (Why is no real title available?)
- scientific article; zbMATH DE number 2086626 (Why is no real title available?)
- MPC vs. SFE : Unconditional and Computational Security
- MPC vs. SFE: Perfect Security in a Unified Corruption Model
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- Perfectly secure message transmission
- Security and composition of multiparty cryptographic protocols
Cited in
(6)- Best possible information-theoretic MPC
- Graceful degradation in multi-party computation. (Extended abstract)
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Efficient MPC with a Mixed Adversary
- Le Mans: dynamic and fluid MPC for dishonest majority
- Threshold-optimal MPC with friends and foes
This page was built for publication: Information-theoretically secure MPC against mixed dynamic adversaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695650)
