A generalization of the Mignotte's scheme over Euclidean domains and applications to secret image sharing

Journal of Algebra Combinatorics Discrete Structures and Applications

article

Ibrahim Ozbek¹  Fatih Temiz²  Irfan Siap³ 

[1] Yildiz Technical University, Graduate School of Science and Engineering, Department of Mathematics;Istanbul Gelisim University, Department of Management Information Systems;Jacodesmath Institute, Department of Mathematics

关键词: Mignotte sequences;    Secret image sharing;    Secret sharing scheme;    Euclidean domain;   

DOI  :  10.13069/jacodesmath.617239

学科分类：社会科学、人文和艺术（综合）

来源: Yildiz Technical University

【 摘 要 】

Secret sharing scheme is an efficient method to hide secret key or secret image by partitioning itinto parts such that some predetermined subsets of partitions can recover the secret but remainingsubsets cannot. In 1979, the pioneer construction on this area was given by Shamir and Blakleyindependently. After these initial studies, Asmuth-Bloom and Mignotte have proposed a different(k, n) threshold modular secret sharing scheme by using the Chinese remainder theorem. In thisstudy, we explore the generalization of Mignotte’s scheme to Euclidean domains for which we obtainsome promising results. Next, we propose new algorithms to construct threshold secret image sharingschemes by using Mignotte’s scheme over polynomial rings. Finally, we compare our proposed schemeto the existing ones and we show that this new method is more efficient and it has higher security.

【 授权许可】

CC BY