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.






Similar content being viewed by others
REFERENCES
Shamir, A., How to share a secret, Commun. ACM, 1979, vol. 22, no. 11, pp. 612–613.
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.
Parvatov, N.G., Perfect secret sharing schemes, Prikl. Diskretnaya Mat., 2008, no. 2, pp. 50–57.
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.
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.
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.
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.
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.
Shenets, N.N., Ideal composite modular secret sharing schemes, Autom. Control Comput. Sci., 2015, vol. 49, no. 8, pp. 798–802.
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.
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.
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.
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.
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.
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
The authors declare that they have no conflicts of interest.
Additional information
Translated by A. Ivanov
About this article
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
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411620080076