[Resource Topic] 2019/1182: Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries

[system]

Welcome to the resource topic for 2019/1182

Title:
Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries

Authors: Serge Fehr, Chen Yuan

Abstract:

We show a robust secret sharing scheme for a maximal threshold t < n/2 that features an optimal overhead in share size, offers security against a rushing adversary, and runs in polynomial time. Previous robust secret sharing schemes for t < n/2 either suffered from a suboptimal overhead, offered no (provable) security against a rushing adversary, or ran in superpolynomial time.

ePrint: https://eprint.iacr.org/2019/1182

Talk: https://www.youtube.com/watch?v=ByRJSGDBS4Q

Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries

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 .