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

摘要

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.