Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities
From MaRDI portal
Publication:2229260
DOI10.1007/978-3-030-57808-4_1OpenAlexW3082050468MaRDI QIDQ2229260
Antonin Leroux, Tancrède Lepoint, Karim Eldefrawy
Publication date: 23 February 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-57808-4_1
Related Items (4)
An efficient publicly verifiable and proactive secret sharing scheme ⋮ Perfect MPC over layered graphs ⋮ Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities ⋮ Communication-efficient proactive MPC for dynamic groups with dishonest majorities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multipartite secret sharing by bivariate interpolation
- Proactive secure multiparty computation with a dishonest majority
- Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities
- Using level-1 homomorphic encryption to improve threshold DSA signatures for Bitcoin wallet security
- Towards efficient private distributed computation on unbounded input streams
- Communication-Optimal Proactive Secret Sharing for Dynamic Groups
- Proactive Secret Sharing with a Dishonest Majority
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- How to withstand mobile virus attacks, revisited
- Proactive secure message transmission in asynchronous networks
- How to share a secret
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Scalable and Unconditionally Secure Multiparty Computation
- How to withstand mobile virus attacks (extended abstract)
- Perfectly-Secure MPC with Linear Communication Complexity
This page was built for publication: Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities
