閱讀全文 | |
篇名 |
Multiple Secret Sharing with Simple Image Encryption
|
---|---|
並列篇名 | Multiple Secret Sharing with Simple Image Encryption |
作者 | Heri Prasetyo、Chih-Hsien Hsia、Jing-Yi Deng |
英文摘要 | Multiple Secret Sharing (MSS) aims to secure the image transmission by improving the ambiguity on image contents. The former (n, n)-MSS scheme generates n shared images from n secret images and reconstruct n recovered secret images from n shared images. This scheme hides the content of secret image by performing the eXclusive-OR (XOR) with specific masking coefficient. It exploits the Chinese Remainder Theorem (CRT) approach for generating the masking coefficient. However, the former scheme cannot work if n is odd. It overcomes the aforementioned problem by incorporating random image, transforming into nk encrypted secret images, and employing double masking coefficients. The presented MSS scheme utilizes an image encryption technique with simple chaotic maps for increasing the ambiguity of shared image content. The experimental results reveal that the proposed MSS method solves the problem on former MSS scheme and yields better performances. |
起訖頁 | 323-342 |
關鍵詞 | CRT、Image encryption、Secret sharing、Simple chaotic、XOR |
刊名 | 網際網路技術學刊 |
期數 | 202003 (21:2期) |
出版單位 | 台灣學術網路管理委員會 |
DOI |
|
QR Code | |
該期刊 上一篇
| A Novel Method for CCSDS-TC Recognition |
該期刊 下一篇
| Comparative Performance Evaluation of Popular Virtual Private Servers |