| A Secure Boolean-based Multi-Secret Image Sharing Scheme | |
|---|---|
| 學年 | 102 |
| 學期 | 2 |
| 出版（發表）日期 | 2014-06-01 |
| 作品名稱 | A Secure Boolean-based Multi-Secret Image Sharing Scheme |
| 作品名稱（其他語言） | |
| 著者 | 陳建彰; 吳緯杰 |
| 單位 | 淡江大學資訊工程學系 |
| 出版者 | New York: Elsevier Inc. |
| 著錄名稱、卷期、頁數 | Journal of Systems and Software 92, pp.107–114 |
| 摘要 | An (n, n) multi-secret image sharing scheme shares n secret images among n shared images. In this type of schemes, n shared images can be used to recover all n secret images, but the loss of any shared image prevents the recovery of any secret image. Among existing image sharing techniques, Boolean-based secret schemes have good performance because they only require XOR calculation. This study presents a secure Boolean-based secret image sharing scheme that uses a random image generating function to generate a random image from secret images or shared images. The proposed function efficiently increases the sharing capacity on free of sharing the random image. The use of a bit shift subfunction in the random image generating function produces a random image to meet the random requirement. Experimental results show that the proposed scheme requires minimal CPU computation time to share or recover secret images. The time required to share n secret images is nearly the time as that required to recover n secret images. The bit shift subfunction takes more computation load than the XOR subfunction needs. |
| 關鍵字 | Multiple secret images;Boolean;XOR |
| 語言 | en_US |
| ISSN | 0164-1212 |
| 期刊性質 | 國外 |
| 收錄於 | SCI |
| 產學合作 | |
| 通訊作者 | 陳建彰 |
| 審稿制度 | 是 |
| 國別 | USA |
| 公開徵稿 | |
| 出版型式 | ,紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/98448 ) |
GoogleAnalytics