International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Serge Fehr
Chen Yuan
Download:
Search ePrint
Search Google
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.
Video from TCC 2020
BibTeX
@article{tcc-2020-30596,
  title={Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries},
  booktitle={Theory of Cryptography},
  publisher={Springer},
  author={Serge Fehr and Chen Yuan},
  year=2020
}