论文信息 - Robust Secret Sharing with Optimal Share Size and Security Against Rushing Adversaries

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

We show the first 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.

Serge Fehr | Chen Yuan

[1] Anne Auger,et al. Theory of Randomized Search Heuristics , 2012, Algorithmica.

[2] Allison Bishop,et al. Essentially Optimal Robust Secret Sharing with Maximal Corruptions , 2016, EUROCRYPT.

[3] Ivan Damgård,et al. Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions , 2015, EUROCRYPT.

[4] Ivan Damgård,et al. On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase , 2001, CRYPTO.

[5] Rafail Ostrovsky,et al. Unconditionally-Secure Robust Secret Sharing with Compact Shares , 2012, EUROCRYPT.

[6] Serge Fehr,et al. Towards optimal robust secret sharing with security against a rushing adversary , 2019, IACR Cryptol. ePrint Arch..

[7] Allison Bishop,et al. Robust Secret Sharing Schemes Against Local Adversaries , 2016, Public Key Cryptography.

[8] Alfredo De Santis,et al. Size of Shares and Probability of Cheating in Threshold Schemes , 1994, EUROCRYPT.