Secret sharing in a special linear group

Objectives. The problem of developing the mathematical foundations of modular secret sharing in a special linear group over the ring of integers is being solved. The relevance of the problem is reduced to the fact that a large number of requirements are imposed on secret sharing schemes. These include the ideality of the scheme, the possibility of verification, changing the threshold without the participation of the dealer, the implementation of a non-threshold access structure and some others. Every secret sharing scheme developed to date does not fully satisfy all these requirements. It only has a certain configuration of these properties. The development of a scheme on a new mathematical basis is intended to expand the list of these configurations, which creates more opportunities for the user in choosing the optimal option. Methods. Group theory, modular arithmetic and theory of secret sharing schemes are used. Results. A fundamental domain with respect to the action of the main congruence subgroup by right shifts in the special linear group of second-order matrices over the ring of integers is constructed. On this basis, methods for modular secret sharing and its threshold restoration are proposed. Conclusion. A rigorous mathematical justification is given for the correctness of the algorithms for generating partial secrets and restoring the main secret in the special linear group over the ring of integers. These results will be used to study the configuration of secret sharing properties in this group.

Authors

Institutions

Publication Details

Journal
Informatics
Published
2024-09-30
DOI
https://doi.org/10.37661/1816-0301-2024-21-3-39-47
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Secret sharing in a special linear group

V. I. Yanchevskiĭ, Gennadii V. Matveev, I. A. Havarushka
Informatics
Cryptography and Data Security
article

Secret sharing in a special linear group

V. I. Yanchevskiĭ, Gennadii V. Matveev, I. A. Havarushka
article en

Abstract

Objectives. The problem of developing the mathematical foundations of modular secret sharing in a special linear group over the ring of integers is being solved. The relevance of the problem is reduced to the fact that a large number of requirements are imposed on secret sharing schemes. These include the ideality of the scheme, the possibility of verification, changing the threshold without the participation of the dealer, the implementation of a non-threshold access structure and some others. Every secret sharing scheme developed to date does not fully satisfy all these requirements. It only has a certain configuration of these properties. The development of a scheme on a new mathematical basis is intended to expand the list of these configurations, which creates more opportunities for the user in choosing the optimal option. Methods. Group theory, modular arithmetic and theory of secret sharing schemes are used. Results. A fundamental domain with respect to the action of the main congruence subgroup by right shifts in the special linear group of second-order matrices over the ring of integers is constructed. On this basis, methods for modular secret sharing and its threshold restoration are proposed. Conclusion. A rigorous mathematical justification is given for the correctness of the algorithms for generating partial secrets and restoring the main secret in the special linear group over the ring of integers. These results will be used to study the configuration of secret sharing properties in this group.

InformaticsVol. 21(3)
National Academy of Sciences of Belarus (BY), Belarusian State University (BY), Institute of Mathematics (BY)
Openalex Percentile: Top 85%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.