Welcome to the resource topic for 2023/536
Title:
Lightweight Asynchronous Verifiable Secret Sharing with Optimal Resilience
Authors: Victor Shoup, Nigel P. Smart
Abstract:We present new protocols for Asynchronous Verifiable Secret Sharing for Shamir (i.e., threshold t< n/3 corruptions, where n is the total number of parties;
- Are complete, in the sense that they guarantee that if any honest party receives their share then all honest parties receive their shares;
- Employ batching techniques, whereby a dealer shares many secrets in parallel, and achieves an amortized communication complexity that is linear in n, at least on the “happy path”, where no party provably misbehaves.
ePrint: https://eprint.iacr.org/2023/536
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .