论文信息 - A perfect threshold secret sharing scheme to identify cheaters

A perfect threshold secret sharing scheme to identify cheaters

In this paper we consider the problem of identifying cheaters in secret sharing schemes. Rabin and Ben-Or presented a perfect and unconditionally secure secret sharing scheme in which the honest participants are able to identify the cheaters. We present a similar scheme, but one in which the information distributed to each participant is smaller.

MARCO CARPENTIERI

[1] Ernest F. Brickell,et al. The Detection of Cheaters in Threshold Schemes , 1990, SIAM J. Discret. Math..

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

[3] J. D. Lipson. Elements of algebra and algebraic computing , 1981 .

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

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

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

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

[8] Dorothy E. Denning,et al. Cryptography and Data Security , 1982 .

[9] A. Beimel,et al. Lower bounds for monotone span programs , 2005, computational complexity.

[10] Douglas R. Stinson,et al. An explication of secret sharing schemes , 1992, Des. Codes Cryptogr..