Multiple ramp schemes

A (t,k,n,S) ramp scheme is a protocol to distribute a secret s chosen in S among a set P of n participants in such a way that: (1) sets of participants of cardinality greater than or equal to k can reconstruct the secret s; (2) sets of participants of cardinality less than or equal to t have no information on s, whereas (3) sets of participants of cardinality greater than t and less than k might have "some" information on s. In this correspondence we analyze multiple ramp schemes, which are protocols to share many secrets among a set P of participants, using different ramp schemes. In particular, we prove a tight lower bound on the size of the shares held by each participant and on the dealer's randomness in multiple ramp schemes.

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

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

[3]  Keith M. Martin,et al.  Multisecret Threshold Schemes , 1994, CRYPTO.

[4]  Alfredo De Santis,et al.  On the Size of Shares for Secret Sharing Schemes , 1991, CRYPTO.

[5]  Keith M. Martin,et al.  A combinatorial interpretation of ramp schemes , 1996, Australas. J Comb..

[6]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

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

[8]  Andrew Chi-Chih Yao,et al.  The complexity of nonuniform random number generation , 1976 .

[9]  Barbara Masucci,et al.  Randomness in Multi-Secret Sharing Schemes , 1999, J. Univers. Comput. Sci..

[10]  Alfredo De Santis,et al.  Tight Bounds on the Information Rate of Secret Sharing Schemes , 1997, Des. Codes Cryptogr..

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

[12]  Alfredo De Santis,et al.  Randomness in Distribution Protocols , 1996, Inf. Comput..

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

[14]  Douglas R. Stinson,et al.  Cryptography: Theory and Practice , 1995 .

[15]  Catherine A. Meadows,et al.  Security of Ramp Schemes , 1985, CRYPTO.

[16]  Axthonv G. Oettinger,et al.  IEEE Transactions on Information Theory , 1998 .

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

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

[19]  Keith M. Martin,et al.  On Sharing Many Secrets (Extended Abstract) , 1994, ASIACRYPT.

[20]  Giovanni Di Crescenzo,et al.  Multi-Secret Sharing Schemes , 1994, CRYPTO.

[21]  Douglas R. Stinson,et al.  On the Dealer's Randomness Required in Secret Sharing Schemes , 1994, Des. Codes Cryptogr..

[22]  Herbert S. Wilf,et al.  Algorithms and Complexity , 1994, Lecture Notes in Computer Science.