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

Basit Öğe Kaydı
dc.authorscopusid57192188807
dc.authorscopusid57211353260
dc.authorscopusid55888670600
dc.contributor.authorOzbek, Ibrahim
dc.contributor.authorTemiz, Fatih
dc.contributor.authorSiap, Irfan
dc.date.accessioned2024-09-11T19:58:13Z
dc.date.available2024-09-11T19:58:13Z
dc.date.issued2019
dc.departmentİstanbul Gelişim Üniversitesien_US
dc.description.abstractSecret sharing scheme is an efficient method to hide secret key or secret image by partitioning it into parts such that some predetermined subsets of partitions can recover the secret but remaining subsets cannot. In 1979, the pioneer construction on this area was given by Shamir and Blakley independently. 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 this study, we explore the generalization of Mignotte’s scheme to Euclidean domains for which we obtain some promising results. Next, we propose new algorithms to construct threshold secret image sharing schemes by using Mignotte’s scheme over polynomial rings. Finally, we compare our proposed scheme to the existing ones and we show that this new method is more efficient and it has higher security. © 2019, Jacodesmath Institute. All rights reserved.en_US
dc.description.sponsorshipTürkiye Bilimsel ve Teknolojik Araştirma Kurumu, TÜBITAK, (114F388)en_US
dc.description.sponsorship? This research was partially supported by The Scientific and Technological Research Council of Turkey, Project No: 114F388. Ibrahim Ozbek; Yildiz Technical University, Graduate School of Science and Engineering, Department of Mathematics, Istanbul, Turkey (email: ibrhmozbek@gmail.com). Fatih Temiz (Corresponding Author); Istanbul Gelisim University, Department of Management Information Systems, Istanbul, Turkey (email: ftemiz@gelisim.edu.tr). Irfan Siap; Jacodesmath Institute, Department of Mathematics, Istanbul, Turkey (email: irfan.siap@gmail.com).en_US
dc.identifier.doi10.13069/jacodesmath.617239
dc.identifier.endpage161en_US
dc.identifier.issn2148-838Xen_US
dc.identifier.issue3en_US
dc.identifier.scopus2-s2.0-85073629461en_US
dc.identifier.scopusqualityQ4en_US
dc.identifier.startpage147en_US
dc.identifier.urihttps://doi.org/10.13069/jacodesmath.617239
dc.identifier.urihttps://hdl.handle.net/11363/8446
dc.identifier.volume6en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherJacodesmath Instituteen_US
dc.relation.ispartofJournal of Algebra Combinatorics Discrete Structures and Applicationsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.snmz20240903_Gen_US
dc.subjectEuclidean domain; Mignotte sequences; Secret image sharing; Secret sharing schemeen_US
dc.titleA generalization of the Mignotte’s scheme over Euclidean domains and applications to secret image sharingen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
Makale / Article
Boyut:
1.82 MB
Biçim:
Adobe Portable Document Format
İndir

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu