论文信息 - A secret sharing scheme based on Near-MDS codes

A secret sharing scheme based on Near-MDS codes

In this paper, we consider the application of Near-MDS codes in cryptography. Near-MDS codes have some important properties that can be used to construct secret sharing schemes. The proposed secret sharing schemes in this paper have good security properties such as cheating detection and cheaters identification when recovering the secret. In addition, the number of participants in our proposed scheme is more than previous results.

[1] Ehud D. Karnin,et al. On secret sharing systems , 1983, IEEE Trans. Inf. Theory.

[2] Tzong-Chen Wu,et al. Cheating detection and cheater identification in secret sharing schemes , 1995 .

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

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

[5] Xian-Mo Zhang,et al. Ideal Threshold Schemes from MDS Codes , 2002, ICISC.

[6] Erik Warren. How to Stop a Cheater: Secret Sharing with Dishonest Participation , 1993 .

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

[8] Erik W. Selberg,et al. How to Stop a Cheater: Secret Sharing with Dishonest Participation , 2001 .

[9] Steven Roman,et al. Coding and information theory , 1992 .

[10] J. Massey. Some Applications of Coding Theory in Cryptography , 1999 .

[11] S. Dodunekov,et al. On near-MDS codes , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[12] R. J. McEliece,et al. On sharing secrets and Reed-Solomon codes , 1981, CACM.

[13] JM Jeroen Doumen,et al. Some applications of coding theory in cryptography , 2003 .