|
|
The ISC International Journal of Information Security، جلد ۱۷، شماره ۲، صفحات ۲۶۱-۲۶۵
|
|
|
| عنوان فارسی |
|
|
| چکیده فارسی مقاله |
|
|
| کلیدواژه‌های فارسی مقاله |
|
|
| عنوان انگلیسی |
A New Scheme Based on (t,n)-Secret Image Sharing With Steganography Based on Joseph’s Problem and HLR |
|
| چکیده انگلیسی مقاله |
The paper presents a novel approach to Secret Image Sharing (SIS) that combines (t, n)-threshold schemes with steganography, utilizing Joseph’s problem and Homogeneous Linear Recursion (HLR) to enhance security. The methodology involves dividing a secret image into shadow images, embedding these shadows into cover images using a Least Significant Bit (LSB) method guided by Joseph’s problem. The study aims to increase the security of SIS while maintaining high visual quality in the stego images. The authors validate their approach through various experiments, demonstrating that the proposed method improves Peak Signal-to-Noise Ratio (PSNR) and Structural Similarity Index (SSIM) compared to existing methods. |
|
| کلیدواژه‌های انگلیسی مقاله |
Joseph’s Problem,Homogeneous Linear Recursion,Secret Image Sharing,Steganography |
|
| نویسندگان مقاله |
Zahra Saeidi |
Cryptography and Data Security Laboratory, School of Mathematics and Computer Science, Iran University of Science and Technology, Tehran, Iran
Samaneh Mashhadi |
Cryptography and Data Security Laboratory, School of Mathematics and Computer Science, Iran University of Science and Technology, Tehran, Iran
|
|
| نشانی اینترنتی |
https://www.isecure-journal.com/article_219355_331dc6dcc085e5590ba4bd9325697b28.pdf |
| فایل مقاله |
فایلی برای مقاله ذخیره نشده است |
| کد مقاله (doi) |
|
| زبان مقاله منتشر شده |
en |
| موضوعات مقاله منتشر شده |
|
| نوع مقاله منتشر شده |
|
|
|
|
برگشت به:
صفحه اول پایگاه |
نسخه مرتبط |
نشریه مرتبط |
فهرست نشریات
|