### Essentially Optimal Robust Secret Sharing with Maximal Corruptions

暂无分享，去创建一个

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

[2] Robert Krauthgamer,et al. A polylogarithmic approximation of the minimum bisection , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

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

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

[5] Oded Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness , 1998, Algorithms and Combinatorics.

[6] Aravind Srinivasan,et al. Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..

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

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

[9] Alfonso Cevallos,et al. Reducing the Share Size in Robust Secret Sharing , 2011 .

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

[11] Harald Räcke. Optimal hierarchical decompositions for congestion minimization in networks , 2008, STOC '08.

[12] Reihaneh Safavi-Naini,et al. Unconditionally-Secure Robust Secret Sharing with Minimum Share Size , 2013, Financial Cryptography.

[13] Russell Impagliazzo,et al. Constructive Proofs of Concentration Bounds , 2010, APPROX-RANDOM.

[14] Carles Padró,et al. Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors , 2008, EUROCRYPT.

[15] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

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

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

[18] Alfredo De Santis,et al. Lower Bounds for Robust Secret Sharing Schemes , 1997, Inf. Process. Lett..

[19] Madhu Sudan. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

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

[21] G. R. Blakley,et al. Safeguarding cryptographic keys , 1899 .

[22] David S. Johnson,et al. Stockmeyer: some simplified np-complete graph problems , 1976 .

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