Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
 Allison Bishop,et al. Robust Secret Sharing Schemes Against Local Adversaries , 2014, Public Key Cryptography.
 Ivan Damgård,et al. On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase , 2001, CRYPTO.
 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).
 Alfredo De Santis,et al. Size of Shares and Probability of Cheating in Threshold Schemes , 1993, EUROCRYPT.
 Allison Bishop,et al. Essentially Optimal Robust Secret Sharing with Maximal Corruptions , 2016, EUROCRYPT.
 Rafail Ostrovsky,et al. Unconditionally-Secure Robust Secret Sharing with Compact Shares , 2012, EUROCRYPT.
 Ivan Damgård,et al. Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions , 2015, EUROCRYPT.
 Anne Auger,et al. Theory of Randomized Search Heuristics: Foundations and Recent Developments , 2011, Theory of Randomized Search Heuristics.
 Venkatesan Guruswami,et al. Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2008, IEEE Transactions on Information Theory.
 Rafail Ostrovsky,et al. Efficient robust secret sharing from expander graphs , 2017, Cryptography and Communications.