A secret sharing scheme based on integer decomposition and hexagonal structure

被引：0
作者：
Rouia Z. [1 ]
Lemnouar N. [1 ]
Rida A.M. [1 ]
机构：
[1] LAMIE Laboratory, Department of Computer Science, Faculty of Mathematics and Computer Science
来源：
International Journal of Information and Communication Technology | 2024年 / 24卷 / 04期
关键词：
bio-inspired hexagonal structure; isoperimetry; quasi-square decomposition; secret sharing;
D O I：
10.1504/IJICT.2024.138784
中图分类号：
学科分类号：
摘要：
Security is a major challenge in storage and transmission of digital data. Secret sharing scheme is a fundamental primitive used in multiparty computations, access control and key management, which is based here on two concepts, namely: hexagonal structure and integer decomposition. Use of hexagonal structure is common in biological modelling. For integer decomposition, the oldest known method is Fermat’s factorisation, while for the proposed decomposition, the factorisation uniqueness of positive integer into two factors is exploited. Experimental results obtained from the applied scheme to digital images reveal interesting properties; this scheme turns out to be lossless, ideal, flexible, extensible, and even can detect and identify cheater; in sum, it has a good security. © 2024 Inderscience Enterprises Ltd.
引用
收藏
页码：482 / 501
页数：19
相关论文
共 29 条
  • [1] Ahmad A., Elabdalla A.M., An efficient method to determine linear feedback connections in shift registers that generate maximal length pseudo-random up and down binary sequences, Computers & Electrical Engineering, 23, 1, pp. 33-39, (1997)
  • [2] Ball P., Designing the Molecular World: Chemistry at the Frontier, 19, (1996)
  • [3] Blakley G.R., Safeguarding cryptographic keys, International Workshop on Managing Requirements Knowledge (MARK), (1979)
  • [4] Catalina C., Grau J.M., Oller-Marcen A.M., Tomicronth L., Counting invertible sums of squares modulo n and a new generalization of Euler’s totient function, Publicationes Mathimaticae, 87, 1–2, pp. 133-145, (2015)
  • [5] Deng F.G., Long G.L., Zhou H.Y., An efficient quantum secret sharing scheme with Einstein–Podolsky–Rosen pairs, Physics Letters A, 340, 1–4, pp. 43-50, (2005)
  • [6] Hales T.C., A proof of the Kepler conjecture, Annals of Mathematics, 162, 3, pp. 1065-1185, (2005)
  • [7] Kaboli R., Khazaei S., Parviz M., On ideal and weakly-ideal access structures, IACR Cryptol, (2020)
  • [8] Kim J.L., Nari L., Secret sharing schemes based on additive codes over GF (4), Applicable Algebra in Engineering Communication and Computing, 28, 1, pp. 79-97, (2017)
  • [9] Krupic J., Bouza M., Burton S., Barry C., O'Keefe J., Grid cell symmetry is shaped by environmental geometry, Nature, 518, 7538, pp. 232-235, (2015)
  • [10] Lein H., Chingfang H., Mingwu Z., Tingting H., Maoyuan Z., Realizing secret sharing with general access structure, Information Sciences, 367, pp. 209-220, (2016)
123