Providing Anonymity in Unconditionally Secure Secret Sharing Schemes

We discuss the concept of anonymity in an unconditionally secure secret sharing scheme, proposing several types of anonymity and situations in which they might arise. We present a foundational framework and provide a range of general constructions of unconditionally secure secret sharing schemes offering various degrees of anonymity.

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

[2]  Douglas R. Stinson,et al.  Anonymous Secret Sharing Schemes , 1997, Discret. Appl. Math..

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

[4]  Marten van Dijk.  A Linear Construction of Secret Sharing Schemes , 1997, Des. Codes Cryptogr..

[5]  Christian Gehrmann.  Topics in Authentication Theory , 1997 .

[6]  Gustavus J. Simmons,et al.  How to (Really) Share a Secret , 1988, CRYPTO.

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

[8]  Ernest F. Brickell,et al.  Some Ideal Secret Sharing Schemes , 1990, EUROCRYPT.

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

[10]  Keith M. Martin,et al.  Combinatorial models for perfect secret sharing schemes , 1998 .