Secret sharing in a special linear group
https://doi.org/10.37661/1816-0301-2024-21-3-39-47
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.
About the Authors
V. I. Yanchevskiĭ
Institute of Mathematics of the National Academy of Sciences of Belarus
Belarus
Belarus
Vyacheslav I. Yanchevskiĭ, D. Sc. (Phys.-Math.), Acad. of the National Academy of Sciences of Belarus, Head of the Algebra Department
st. Surganova, 11, Minsk, 220012
I. A. Havarushka
Institute of Mathematics of the National Academy of Sciences of Belarus
Belarus
Belarus
Ihar A. Havarushka, Ph. D. (Phys.-Math.), Researcher
st. Surganova, 11, Minsk, 220012
G. V. Matveev
Belarusian State University
Belarus
Belarus
Gennadii V. Matveev, Ph. D. (Phys.-Math.), Assoc. Prof., Assoc. Prof. of the Department of Higher Mathematics of the Faculty of Applied Mathematics and Computer Sciences
av.Nezavisimosti, 4, Minsk, 220030
References
1. Cramer R., Damgard I., Nielsen J. Multiparty Computation from Threshold Homomorphic Encryption. LNCS, 2001, vol. 2045, pp. 280–300.
2. Bethencourt J., Sahai A., Waters B. Ciphertext-policy attribute-based encryption. Proceedings of IEEE Symposium on Security and Privacy, Berkeley, CA, USA, 20–23 May 2007. Berkeley, 2007, pp. 321–334.
3. Benaloh J. Secret sharing homomorphisms: keeping shares of a secret sharing. LNCS, 1987, vol. 263, pp. 251–260.
4. Shamir A. How to share a secret. Communications of the ACM, 1979, vol. 22, pp. 612–613. https://doi.org/10.1145/359168.359176
5. Asmuth C., Bloom J. A modular approach to key safeguarding. IEEE Transactions on Information Theory, 1983, vol. 29, pp. 156–169. https://doi.org/10.1109/TIT.1983.1056651
6. Mignotte M. How to share a secret. LNCS, 1983, vol. 149, pp. 371–375.
7. Galibus T., Matveev G., Shenets N. Some structural and security properties of the modular secret sharing. 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, 26–29 September 2008. Timisoara, 2008, pp. 197–200. https://doi.org/10.1109/SYNASC.2008.14
8. Galibus T., Matveev G. Generalized Mignotte's Sequences Over Polynomial Rings. Electronic Notes in Theoretical Computer Science, 2007, vol. 186, pp. 43–48. https://doi.org/10.1016/j.entcs.2006.12.044
9. Galibus T., Matveev G. Finite Fields. Gröbner Bases and Modular Secret Sharing. Journal of Discrete Mathematical Sciences and Cryptography, 2012, vol. 15, pp. 339–348. https://doi.org/10.1080/09720529.2012.10698386
10. Vaskouski M. M., Matveev G. V. Verification of modular secret sharing. Zhurnal Belorusskogo gosudarstvennogo universiteta. Matematika. Informatika [Journal of the Belarusian State University. Mathematics and Informatics], 2017, no. 2, pp. 17–22 (In Russ.)
11. Matveev G. V., Matulis V. V. Perfect verification of modular scheme. Zhurnal Belorusskogo gosudarstvennogo universiteta. Matematika. Informatika [Journal of the Belarusian State University. Mathematics and Informatics], 2018, no. 2, pp. 4–9 (In Russ.)
12. Di Matteo G. The action of SL2(Z) on the upper-half complex plane. Available at: https://www.dimatteo.is/Mathematics/Courses/Modular-forms/02-SL2Z.pdf (accessed 10.04.2024).
13. Platonov V. P., Rapinchuk A. S. Algebraicheskie gruppy i teoriya chisel. Algebraic Groups and Number Theory. Moscow, Nauka, 1991, 656 p. (In Russ.).
Review
For citations:
Yanchevskiĭ V.I., Havarushka I.A., Matveev G.V. Secret sharing in a special linear group. Informatics. 2024;21(3):39-47. (In Russ.) https://doi.org/10.37661/1816-0301-2024-21-3-39-47
Views: 217
Email this article 