Towards optimal robust secret sharing with security against a rushing adversary

Robust secret sharing enables the reconstruction of a secret-shared message in the presence of up to t (out of n) incorrect shares. The most challenging case is when $$n = 2t+1$$, which is the largest t for which the task is still possible, up to a small error probability $$2^{-\kappa }$$ and with some overhead in the share size.

[1]  Tal Rabin,et al.  Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.

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

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

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

[5]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[6]  Shubhangi Saraf,et al.  Improved Decoding of Folded Reed-Solomon and Multiplicity Codes , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

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

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

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

[10]  G. R. BLAKLEY Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

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

[12]  Anne Auger,et al.  Theory of Randomized Search Heuristics: Foundations and Recent Developments , 2011, Theory of Randomized Search Heuristics.

[13]  Venkatesan Guruswami,et al.  Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2008, IEEE Transactions on Information Theory.

[14]  Rafail Ostrovsky,et al.  Efficient robust secret sharing from expander graphs , 2017, Cryptography and Communications.

[15]  Mahdi Cheraghchi Nearly optimal robust secret sharing , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).