Bounds on the Threshold Gap in Secret Sharing and its Applications
暂无分享,去创建一个
[1] Douglas R. Stinson,et al. A simple combinatorial treatment of constructions and threshold gaps of ramp schemes , 2013, Cryptography and Communications.
[2] Kaoru Kurosawa,et al. Some Basic Properties of General Nonperfect Secret Sharing Schemes , 1998, J. Univers. Comput. Sci..
[3] G. R. Blakley,et al. Ideal perfect threshold schemes and MDS codes , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.
[4] Ueli Maurer,et al. General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.
[5] Ehud D. Karnin,et al. On secret sharing systems , 1983, IEEE Trans. Inf. Theory.
[6] Adi Shamir,et al. How to share a secret , 1979, CACM.
[7] G. R. Blakley,et al. Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[8] W. Cary Huffman,et al. Fundamentals of Error-Correcting Codes , 1975 .
[9] G. R. Blakley,et al. Secret Sharing Schemes , 2011, Encyclopedia of Cryptography and Security.
[10] Ignacio Cascudo,et al. The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing , 2011, CRYPTO.
[11] James L. Massey,et al. Minimal Codewords and Secret Sharing , 1999 .
[12] P. MuraliKrishna,et al. SECURE SCHEMES FOR SECRET SHARING AND KEY DISTRIBUTION USING PELL'S EQUATION , 2013 .
[13] Hao Chen,et al. Secure Computation from Random Error Correcting Codes , 2007, EUROCRYPT.
[14] Ronald Cramer,et al. Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups , 2002, CRYPTO.
[15] Amit Sahai,et al. On Perfect and Adaptive Security in Exposure-Resilient Cryptography , 2001, EUROCRYPT.
[16] Hao Chen,et al. Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields , 2006, CRYPTO.
[17] Avi Wigderson,et al. On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[18] James H. Griesmer,et al. A Bound for Error-Correcting Codes , 1960, IBM J. Res. Dev..
[19] Matthew K. Franklin,et al. Weakly-Private Secret Sharing Schemes , 2007, TCC.
[20] R. J. McEliece,et al. On sharing secrets and Reed-Solomon codes , 1981, CACM.
[21] K. Martin,et al. Perfect secret sharing schemes on five participants , 1996 .
[22] David J. Goodman,et al. Personal Communications , 1994, Mobile Communications.
[23] Ignacio Cascudo,et al. Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field , 2009, CRYPTO.
[24] Keith M. Martin,et al. A combinatorial interpretation of ramp schemes , 1996, Australas. J Comb..
[25] Alfredo De Santis,et al. Efficient Sharing of Many Secrets , 1993, STACS.