Skip to main content
SpringerLink
Log in

Hierarchical Scheme for Secret Separation Based on Computable Access Labels

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

In this paper, we propose a threshold scheme for sharing a secret between tree-like graph nodes. Nodes whose descendants cover the entire set of leaf nodes can recover the secret. Otherwise, the nodes do not receive any information about the secret. The scheme is based on the construction of a polynomial with the coefficients determined by the graph structure.

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.
Fig. 4.
Fig. 5.
Fig. 6.

Similar content being viewed by others

REFERENCES

  1. Shamir, A., How to share a secret, Commun. ACM, 1979, vol. 22, no. 11, pp. 612–613.

    Article  MathSciNet  Google Scholar 

  2. Nojoumian, M. and Stinson, D.R., Sequential secret sharing as a new hierarchical access structure, J. Internet Serv. Inf. Secur., 2015, vol. 5, pp. 24–32.

    Google Scholar 

  3. Parvatov, N.G., Perfect secret sharing schemes, Prikl. Diskretnaya Mat., 2008, no. 2, pp. 50–57.

  4. Aleksandrova, E.B., Shkorkina, E.N., and Kalinin, M.O., Organization of the quantum cryptographic keys distribution system for transportation infrastructure users, Autom. Control Comput. Sci., 2019, vol. 53, no. 8, pp. 969–971.

    Article  Google Scholar 

  5. Aleksandrova, E.B., Yarmak, A.V., and Kalinin, M.O., Analysis of approaches to group authentication in large-scale industrial systems, Autom. Control Comput. Sci., 2019, vol. 53, no. 8, pp. 879–882.

    Article  Google Scholar 

  6. Aleksandrova, E.B., Vasilev, P.N., and Rezedinova, E.U., Extended dynamic revocable BBS group signature scheme, Nonlinear Phenom. Complex Syst. (Dordrecht, Neth.), 2014, vol. 17, no. 2, pp. 194–202.

  7. Beimel, A., Farràs, O., Mintz, Y., and Peter, N., Linear secret-sharing schemes for forbidden graph access structures, Theory of Cryptography Conference; Lect. Notes Comput. Sci., 2017, vol. 10678, pp. 394–423.

  8. Shenets, N.N., Multi-factor one-way authentication and key retrieval based on ideal threshold secret sharing, Nonlinear Phenom. Complex Syst. (Dordrecht, Neth.), 2020, vol. 23, no. 1, pp. 54-65.

  9. Shenets, N.N., Ideal composite modular secret sharing schemes, Autom. Control Comput. Sci., 2015, vol. 49, no. 8, pp. 798–802.

    Article  Google Scholar 

  10. Shenets, N.N., Authentication in dynamic peer-to-peer networks based on homomorphic secret sharing, Autom. Control Comput. Sci., 2017, vol. 51, no. 8, pp. 936–946.

    Article  Google Scholar 

  11. Shenets, N.N., Security infrastructure of FANET based on secret sharing and authenticated encryption, Autom. Control Comput. Sci., 2019, vol. 53, no. 8, pp. 857–864.

    Article  Google Scholar 

  12. Belim, S.V. and Bogachenko, N.F., Distribution of cryptographic keys in systems with a hierarchy of objects, Autom. Control Comput. Sci., 2016, vol. 50, pp. 777–786.

    Article  Google Scholar 

  13. Belim, S.V. and Belim, S.Yu., Implementation of mandatory access control in distributed systems, Autom. Control Comput. Sci., 2018, vol. 52, pp. 1124–1126.

    Article  Google Scholar 

  14. Belim, S.V. and Belim, S.Yu., Modification of preliminary Blom’s key distribution scheme taking into account simplex channels, Autom. Control Comput. Sci., 2018, vol. 52, pp. 1134–1137.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dostoevsky Omsk State University, 644053, Omsk, Russia

    S. V. Belim & N. F. Bogachenko

  2. Omsk State Technical University, 644050, Omsk, Russia

    S. V. Belim & N. F. Bogachenko

Authors
  1. S. V. Belim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. F. Bogachenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to S. V. Belim or N. F. Bogachenko.

Ethics declarations

The authors declare that they have no conflicts of interest.

Additional information

Translated by A. Ivanov

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Belim, S.V., Bogachenko, N.F. Hierarchical Scheme for Secret Separation Based on Computable Access Labels. Aut. Control Comp. Sci. 54, 773–778 (2020). https://doi.org/10.3103/S0146411620080076

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411620080076

Keywords:

Search

Navigation