Sequential Secret Sharing Scheme Based on Level Ordered Access Structure

In Software Industry an application can be released to production only after it has gone through Unit testing, followed by Integration testing, then System testing and finally Acceptance testing. Note here that without the completion of unit testing, integration testing cannot be started and similarly without the completion of integration testing, system testing cannot be started and so on. That is the ordering is important. To realize this or similar kind of activity we need a hierarchial access structure that has in built ordering among the levels. Existing access structures fail to realize this scenario as they are short of enforcing the required ordering. The purpose of this pa- per is to propose an access structure that caters to this kind of scenarios and come up with schemes that realize this access structure. We call this new access structure as Level Ordered Access Structure (LOAS) and the schemes that realize this access structure as Level Ordered Secret Sharing (LOSS) schemes.

[1]  Mihir Bellare,et al.  Robust computational secret sharing and a unified account of classical secret-sharing goals , 2007, CCS '07.

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

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

[4]  Xian-Mo Zhang,et al.  Ideal Secret Sharing Schemes from Permutations , 2006, Int. J. Netw. Secur..

[5]  Ed Dawson,et al.  Multistage secret sharing based on one-way function , 1994 .

[6]  Martin Tompa,et al.  How to share a secret with cheaters , 1988, Journal of Cryptology.

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

[8]  Hung-Yu Chien,et al.  A Practical ( t , n ) Multi-Secret Sharing Scheme , 2000 .

[9]  Indranil Sengupta,et al.  Cryptosystem for Secret Sharing Scheme with Hierarchical Groups , 2013, Int. J. Netw. Secur..

[10]  Ken Martin.  Discrete Structures in the Theory of Secret Sharing , 1991 .

[11]  Tamir Tassa,et al.  Hierarchical Threshold Secret Sharing , 2004, Journal of Cryptology.

[12]  Min-Shiang Hwang,et al.  A (t, n) multi-secret sharing scheme , 2004, Appl. Math. Comput..

[13]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

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

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

[16]  Josh Benaloh,et al.  Secret Sharing Homomorphisms: Keeping Shares of A Secret Sharing , 1986, CRYPTO.

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

[18]  L. Harn,et al.  Comment on "Multistage secret sharing based on one-way function" , 1995 .