Communication-efficient proactive MPC for dynamic groups with dishonest majorities
From MaRDI portal
Publication:2096629
Recommendations
- Proactive secure multiparty computation with a dishonest majority
- Communication-optimal proactive secret sharing for dynamic groups
- Le Mans: dynamic and fluid MPC for dishonest majority
- Fast large-scale honest-majority MPC for malicious adversaries
- TinyKeys: a new approach to efficient multi-party computation
Cites work
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1031003 (Why is no real title available?)
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
- Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities
- Communication-optimal proactive secret sharing for dynamic groups
- How to withstand mobile virus attacks (extended abstract)
- How to withstand mobile virus attacks, revisited
- Proactive Secret Sharing with a Dishonest Majority
- Proactive secure multiparty computation with a dishonest majority
Cited in
(6)- On linear communication complexity for (maximally) fluid MPC
- Communication-optimal proactive secret sharing for dynamic groups
- Efficient secure multi-party computation for proof of custody in Ethereum sharding
- Le Mans: dynamic and fluid MPC for dishonest majority
- Honest majority MPC with abort with minimal online communication
- Sharing transformation and dishonest majority MPC with packed secret sharing
This page was built for publication: Communication-efficient proactive MPC for dynamic groups with dishonest majorities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096629)