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

Serge Fehr; Chen Yuan

Paper 2019/1182 Original: eprint.iacr.org/2019/1182 ↗

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

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.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint.
History: 2020-09-23: last updated; 2019-10-10: published
Short URL: https://ia.cr/2019/1182
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2019/1182,
      author = {Serge Fehr and Chen Yuan},
      title = {Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries},
      howpublished = {Cryptology {ePrint} Archive, Paper 2019/1182},
      year = {2019},
      url = {https://eprint.iacr.org/2019/1182}
}