Pages that link to "Item:Q1796790"
From MaRDI portal
The following pages link to Proactive secure multiparty computation with a dishonest majority (Q1796790):
Displaying 15 items.
- Communication-efficient proactive MPC for dynamic groups with dishonest majorities (Q2096629) (← links)
- Communication-efficient (proactive) secure computation for dynamic general adversary structures and dynamic groups (Q2106634) (← links)
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles (Q2128556) (← links)
- Fluid MPC: secure multiparty computation with dynamic participants (Q2128557) (← links)
- Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities (Q2229260) (← links)
- Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation (Q2697852) (← links)
- Proactive Secret Sharing with a Dishonest Majority (Q2827737) (← links)
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation (Q2849397) (← links)
- THE PROPORTIONAL LOTTERY PROTOCOL IS STRONGLY β-PARTICIPATORY AND VNM-STRATEGY-PROOF (Q3606363) (← links)
- Multi-Party Computation with Omnipresent Adversary (Q3617520) (← links)
- Storing and Retrieving Secrets on a Blockchain (Q5087260) (← links)
- Multiparty computation secure against continual memory leakage (Q5415547) (← links)
- Le Mans: dynamic and fluid MPC for dishonest majority (Q6097268) (← links)
- Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) (← links)
- On Regenerating Codes and Proactive Secret Sharing: Relationships and Implications (Q6488447) (← links)