Reducing the Share Size in Robust Secret Sharing

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

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

[3]  Carles Padró,et al.  Secret Sharing Schemes with Detection of Cheaters for a General Access Structure , 2002, Des. Codes Cryptogr..

[4]  Douglas R. Stinson Cryptography - theory and practice , 1995, Discrete mathematics and its applications series.

[5]  Thomas Johansson,et al.  On the Relation between A-Codes and Codes Correcting Independent Errors , 1993, EUROCRYPT.

[6]  Richard Taylor An Integrity Check Value Algorithm for Stream Ciphers , 1993, CRYPTO.

[7]  Bert den Boer A Simple and Key-Economical Unconditional Authentication Scheme , 1993, J. Comput. Secur..

[8]  Madhu Sudan,et al.  Highly Resilient Correctors for Polynomials , 1992, Inf. Process. Lett..

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

[10]  Gustavus J. Simmons How to insure that data acquired to verify treaty compliance are trustworthy , 1988 .

[11]  J. H. van Lint,et al.  Introduction to Coding Theory , 1982 .

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

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

[14]  W. W. Peterson,et al.  Encoding and error-correction procedures for the Bose-Chaudhuri codes , 1960, IRE Trans. Inf. Theory.

[15]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .