Secret image sharing in encrypted domain based on chaos theory and Chinese Remainder Theorem

Basit Öğe Kaydı
dc.authorid0000-0002-3159-2497
dc.contributor.authorYavuz, Erdem
dc.date.accessioned2026-02-08T15:15:11Z
dc.date.available2026-02-08T15:15:11Z
dc.date.issued2026
dc.departmentBursa Teknik Üniversitesi
dc.description.abstractThe increasing reliance on digital images emphasizes the need for stronger security. While encryption offers protection, it remains vulnerable to single points of failure or attack. Secret Image Sharing in the Encrypted Domain (SIS-ED) improves security by combining encryption with secret sharing, addressing issues like image leakage and unauthorized reconstruction. This paper proposes a new (n,n)-threshold SIS-ED scheme based on chaos theory and the Chinese Remainder Theorem (CRT) to enhance image protection in practical applications. In the sharing stage, a chaos-based cryptosystem scrambles the pixels of the secret image, disrupting spatial correlations. The scrambled image is split into n one-dimensional vectors, which undergo pixel fusion process. The n-tuple bytes are encoded into a single unique number using CRT with a set of mutually coprime numbers greater than 255, ensuring full reversibility and lossless recovery. The resulting (8n + 1)-bit numbers are converted to binary and split into 8-bit chunks to form a byte vector of encoded image. A random byte sequence generated by a chaotic function (Logistic map) is XORed with this vector to add additional perturbation to the encoded image. The perturbed image is then divided into n shares for distribution. In the recovery stage, pixel separation is performed by solving linear congruence equations using modular arithmetic. The proposed SIS-ED framework enables perfect data reconstruction, eliminating the need for random pixel expansion and producing compressed, more compact shares. Experiments validate the effectiveness and robust cryptographic properties of the approach.
dc.identifier.doi10.1016/j.displa.2025.103264
dc.identifier.issn0141-9382
dc.identifier.issn1872-7387
dc.identifier.scopus2-s2.0-105020260044
dc.identifier.scopusqualityQ1
dc.identifier.urihttps://doi.org/10.1016/j.displa.2025.103264
dc.identifier.urihttps://hdl.handle.net/20.500.12885/5654
dc.identifier.volume91
dc.identifier.wosWOS:001608645800001
dc.identifier.wosqualityQ2
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherElsevier
dc.relation.ispartofDisplays
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzWOS_KA_20260207
dc.subjectChaotic encryption
dc.subjectChinese Remainder Theorem
dc.subjectEncrypted domain
dc.subjectModular arithmetic
dc.subjectMulti-primes
dc.subjectSecret image sharing
dc.titleSecret image sharing in encrypted domain based on chaos theory and Chinese Remainder Theorem
dc.typeArticle

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu