Secret Sharing Schemes with Veto Capabilities

A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret, but any non-qualified subset has absolutely no information on the secret.

[1]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[2]  Dilip V. Sarwate.  On the complexity of decoding Goppa codes (Corresp.) , 1977, IEEE Trans. Inf. Theory.

[3]  Dilip V. Sarwate.  On the complexity of decoding goppa codes , 1977 .

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

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

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

[7]  John Bloom,et al.  A modular approach to key safeguarding , 1983, IEEE Trans. Inf. Theory.

[8]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[9]  Douglas R. Stinson,et al.  A Combinatorial Approach to Threshold Schemes , 1987, SIAM J. Discret. Math..

[10]  Josh Benaloh,et al.  Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.

[11]  Mitsuru Ito,et al.  Secret sharing scheme realizing general access structure , 1989 .

[12]  Albrecht Beutelspacher.  How to Say "No" , 1989, EUROCRYPT.

[13]  Gustavus J. Simmons,et al.  Prepositioned Shared Secret and/or Shared Control Schemes , 1990, EUROCRYPT.

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

[15]  Gustavus J. Simmons,et al.  A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutualy Trusted Party , 1991, EUROCRYPT.

[16]  Shafi Goldwasser,et al.  Advances in Cryptology — CRYPTO’ 88: Proceedings , 1990, Lecture Notes in Computer Science.

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

[18]  Douglas R. Stinson,et al.  New General Lower Bounds on the Information Rate of Secret Sharing Schemes , 1992, CRYPTO.

[19]  Alfredo De Santis,et al.  On the Information Rate of Secret Sharing Schemes (Extended Abstract) , 1992, CRYPTO.

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

[21]  Alfredo De Santis,et al.  Fully Dynamic Secret Sharing Schemes , 1993, Theor. Comput. Sci..

[22]  Alfredo De Santis,et al.  Efficient Sharing of Many Secrets , 1993, STACS.

[23]  Alfredo De Santis,et al.  New bounds on the information rate of secret sharing schemes , 1995, IEEE Trans. Inf. Theory.

[24]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .