Communication-efficient proactive MPC for dynamic groups with dishonest majorities

DOI10.1007/978-3-031-09234-3_28OpenAlexW3214757571MaRDI QIDQ2096629FDOQ2096629

Authors: Karim Eldefrawy, Tancrède Lepoint, Antonin Leroux 

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-09234-3_28

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

zbMATH Keywords

secure multiparty computationPMPC protocol for dynamic groups

Mathematics Subject Classification ID

Cryptography (94A60) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• How to withstand mobile virus attacks (extended abstract)
• Communication-Optimal Proactive Secret Sharing for Dynamic Groups
• Proactive secure multiparty computation with a dishonest majority
• Proactive Secret Sharing with a Dishonest Majority
• Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities
• A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
• How to withstand mobile virus attacks, revisited

Cited In (3)

• Sharing transformation and dishonest majority MPC with packed secret sharing
• Le Mans: dynamic and fluid MPC for dishonest majority
• Honest majority MPC with abort with minimal online communication

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)