Ideal and Perfect Hierarchical Secret Sharing Schemes based on MDS codes

An ideal conjunctive hierarchical secret sharing scheme, constructed based on the Maximum Distance Separable (MDS) codes, is proposed in this paper. The scheme, what we call, is computationally perfect. By computationally perfect, we mean, an authorized set can always reconstruct the secret in polynomial time whereas for an unauthorized set this is computationally hard. Also, in our scheme, the size of the ground eld is independent of the parameters of the access structure. Further, it is ecient

[1]  Germán Sáez,et al.  New Results on Multipartite Access Structures , 2006, IACR Cryptol. ePrint Arch..

[2]  Carles Padró,et al.  Ideal Hierarchical Secret Sharing Schemes , 2010, IEEE Transactions on Information Theory.

[3]  G. R. Blakley,et al.  Ideal perfect threshold schemes and MDS codes , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

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

[5]  Ferruh Özbudak,et al.  On Hierarchical Threshold Access Structures , 2010 .

[6]  Ferruh Özbudak,et al.  Secret Sharing Schemes and Linear Codes , 2012 .

[7]  Carles Padró,et al.  Ideal Multipartite Secret Sharing Schemes , 2007, Journal of Cryptology.

[8]  Albrecht Beutelspacher,et al.  Geometric Structures as Threshold Schemes , 1986, EUROCRYPT.

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

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

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

[12]  Svetla Nikova,et al.  Strongly Multiplicative Hierarchical Threshold Secret Sharing , 2009, ICITS.

[13]  Tamir Tassa,et al.  Characterizing Ideal Weighted Threshold Secret Sharing , 2008, SIAM J. Discret. Math..

[14]  Lein Harn,et al.  Ideal Perfect Multilevel Threshold Secret Sharing Scheme , 2009, 2009 Fifth International Conference on Information Assurance and Security.

[15]  Gustavus J. Simmons,et al.  Contemporary Cryptology: The Science of Information Integrity , 1994 .

[16]  Fabrizio Granelli,et al.  Hierarchical secret sharing in ad hoc networks through Birkhoff interpolation , 2007 .

[17]  Josef Pieprzyk,et al.  Secret Sharing in Multilevel and Compartmented Groups , 1998, ACISP.

[18]  James L. Massey,et al.  Minimal Codewords and Secret Sharing , 1999 .

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

[20]  Anne W. Ackerson,et al.  Ideal , 2008, Definitions.

[21]  Nira Dyn,et al.  Multipartite Secret Sharing by Bivariate Interpolation , 2008, Journal of Cryptology.

[22]  Tamir Tassa.  Hierarchical Threshold Secret Sharing , 2004, TCC.

[23]  Mira Belenkiy.  Disjunctive Multi-Level Secret Sharing , 2008, IACR Cryptol. ePrint Arch..

[24]  Suresh C. Kothari,et al.  Generalized Linear Threshold Scheme , 1985, CRYPTO.

[25]  Josef Pieprzyk,et al.  Secret sharing in hierarchical groups , 1997, ICICS.

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

[27]  Ed Dawson,et al.  The breadth of Shamir's secret-sharing scheme , 1994, Comput. Secur..