Skip to main content
SpringerLink
Log in

Sequential (t,n) multi secret sharing scheme for level-ordered access structure

  • Original Research
  • Published:
International Journal of Information Technology Aims and scope Submit manuscript

Abstract

A new access structure called the Level ordered Access Structure (LoAS) is introduced in Pattipati et al. (IJ Netw Secur 18(5):874–881, 2016) and proposed a sequential secret sharing scheme that realises this access structure. This is similar to multilevel access structure but enforces ordering among levels while reconstructing the secret. In this paper, we extended a secret sharing scheme for multiple secrets to realise LoAS. The construction uses public key primitives with Lagrange interpolation. In this scheme, multiple secrets are distributed one each among the levels. The scheme uses the concepts of quadratic residues and discrete logarithm problem. Reconstruction of the secrets is such that participants of different levels find their respective level secrets only after they get their immediate higher level permission. The novelty of the scheme is that, it achieves ordering concept. Performance and security analysis of the scheme is also discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Shamir A (1979) How to share a secret? Commun ACM 22(11):612–613

    Article  MathSciNet  Google Scholar 

  2. Blakley GR (1979) Safeguarding cryptographic keys. Proc Natl Comput Conf 48:313–317

    Google Scholar 

  3. Simmons GJ (1988) How to (really) share a secret. Conference on the Theory and Application of Cryptography. Springer, New York, pp 390–448

    Google Scholar 

  4. Tassa T (2007) Hierarchical threshold secret sharing. J Cryptol 20(2):237–264

    Article  MathSciNet  Google Scholar 

  5. Tassa T, Dyn N (2009) Multipartite secret sharing by bivariate interpolation. J Cryptol 22(2):227–258

    Article  MathSciNet  Google Scholar 

  6. Ghodosi H, Pieprzyk J, Safavi-Naini R (1998) Secret sharing in multilevel and compartmented groups. In: Australasian Conference on Information Security and Privacy, pp. 367–378. Springer, Berlin

  7. Tentu AN, Paul P, Venkaiah VC (2014) Computationally perfect compartmented secret sharing schemes based on MDS codes. Int J Trust Manag Comput Commun 2(4):353–378

    Article  Google Scholar 

  8. He J, Dawson E (1994) Multistage secret sharing based on one-way function. Electron Lett 30(19):1591–1592

    Article  Google Scholar 

  9. Harn L (1995) Comment on Multistage secret sharing based on one-way function. Electron Lett 31(4):262

    Article  Google Scholar 

  10. Chang TY, Hwang MS, Yang WP (2005) A new multi-stage secret sharing scheme using one-way function. ACM SIGOPS Oper Syst Rev 39(1):48–55

    Article  Google Scholar 

  11. Chanu OB, Tentu AN, Venkaiah VC (2015) Multi-Stage Multi-Secret Sharing Schemes Based on Chinese Remainder Theorem. In Proceedings of the 2015 International Conference on Advanced research in computer science engineering and technology (ICARCSET 2015), p 17. ACM, 2015

  12. Zhao J, Zhang J, Zhao R (2007) A practical verifiable multi-secret sharing scheme. Comput Stand Interfaces 29(1):138–141

    Article  Google Scholar 

  13. Tentu AN, Mahapatra B, Venkaiah VC, Kamakshi Prasad V (2015) New secret sharing scheme for multipartite access structures with threshold changeability. In: Advances in computing, communications and informatics (ICACCI), 2015 International Conference on, pp 1910–1916. IEEE

  14. Basit A, Kumar NC, Venkaiah VC, Moiz SA, Tentu AN, Naik W (2017) Multi-stage multi-secret sharing scheme for hierarchical access structure. In: Computing, communication and automation (ICCCA), 2017 International Conference on, pp 557–563. IEEE

  15. Pattipati DK, Tentu AN, Venkaiah VC, Rao AA (2016) Sequential secret sharing scheme based on level ordered access structure. IJ Netw Secur 18(5):874–881

    Google Scholar 

  16. Singh N, Tentu AN, Basit A, Venkaiah VC (2016) Sequential secret sharing scheme based on Chinese remainder theorem. In: Computational intelligence and computing research (ICCIC), 2016 IEEE International Conference on, pp 1–6. IEEE

  17. Kumar NC, Basit A, Singh P, Venkaiah VC, Rao YV (2017) Node Authentication Using BLS Signature in Distributed PKI Based MANETS. arXiv preprint arXiv:1708.08972

  18. Jackson WA, Martin KM, O’Keefe CM (1994) On sharing many secrets. International Conference on the theory and application of cryptology. Springer, Berlin, pp 42–54

    Google Scholar 

  19. Dong XD (2015) A multi-secret sharing scheme based on the CRT and RSA. Int J Electron Inf Eng 2(1):47–51

    Google Scholar 

  20. Yv SR, Bhagvati C (2014) CRT based threshold multi secret sharing scheme. Int J Netw Secur 16(3):194–200

    Google Scholar 

  21. Yang CC, Chang TY, Hwang MS (2004) A (t, n) multi-secret sharing scheme. Appl Math Comput 151(2):483–490

    MathSciNet  MATH  Google Scholar 

  22. Nojoumian M, Stinson DR (2015) Sequential secret sharing as a new hierarchical access structure. J Internet Serv Inf Secur 5(2):24–32

    Google Scholar 

  23. Lin C, Harn L, Yea D (2009) Ideal hierarchical (t, n) secret sharing schemes. In: Proceedings of the Fifth International Conference on Information Assurance and Security (IAS09), Xian, China

  24. Tentu AN, Basit A, Bhavani K, Venkaiah VC (2017) Multi-secret sharing scheme for level-ordered access structures. International Conference on number–theoretic methods in cryptology. Springer, Cham, pp 267–278

    Google Scholar 

  25. Harn L, Fuyou M (2014) Multilevel threshold secret sharing based on the Chinese Remainder Theorem. Inf Process Lett 114(9):504–509

    Article  MathSciNet  Google Scholar 

  26. Mashhadi S (2016) How to fairly share multiple secrets stage by stage. Wireless Pers Commun 90(1):93–107

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CR Rao Advanced Institute of Mathematics, Statistics, and Computer Science, University of Hyderabad Campus, Hyderabad, 500046, India

    Appala Naidu Tentu

  2. School of Computer and Information Science, University of Hyderabad, Hyderabad, 500046, India

    K. Bhavani, Abdul Basit & V. Ch. Venkaiah

Authors
  1. Appala Naidu Tentu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Bhavani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abdul Basit
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. V. Ch. Venkaiah
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Abdul Basit.

Additional information

A preliminary version of this paper accepted and presented in NuTMiC-2017 held at University of Warsaw, Poland.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tentu, A.N., Bhavani, K., Basit, A. et al. Sequential (t,n) multi secret sharing scheme for level-ordered access structure. Int. j. inf. tecnol. 13, 2265–2275 (2021). https://doi.org/10.1007/s41870-018-0179-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s41870-018-0179-z

Keywords

Search

Navigation