標題: Sharing of multiple images: economically sized and fast-decoding approach based on modulus and Boolean operations
作者: Chao, Kun-Yuan
Lin, Ja-Chen
資訊工程學系
Department of Computer Science
關鍵字: multi-image sharing;modulus operation;Boolean operation;input/output size ratio;computational complexity
公開日期: 1-四月-2010
摘要: Secret image sharing is a popular technology to secure digital images in storage and transmission. Traditionally, the technology transforms one secret image into several images called shadows or shares. Later, when the number of collected shadows reaches a specified threshold value, the decomposed image can be reconstructed. We propose a new sharing approach to transform n secret images into n shadows. Later, after gathering all the n shadows, all the n secret images can be retrieved error-free. No information in any secret image is revealed if one shadow is absent. The total size of n generated shadows is identical to the total size of n input secret images; hence, this approach does not waste storage space. Each pixel in each secret image is reconstructed using only one Boolean, one modulus, and two mathematical operations, so it is also a fast approach for reconstructing many secret images. Comparisons are included. (C) 2010 Society of Photo-Optical Instrumentation Engineers. [DOI: 10.1117/1.3407067]
URI: http://dx.doi.org/10.1117/1.3407067
http://hdl.handle.net/11536/5555
ISSN: 0091-3286
DOI: 10.1117/1.3407067
期刊: OPTICAL ENGINEERING
Volume: 49
Issue: 4
結束頁: 
顯示於類別:期刊論文


文件中的檔案:

  1. 000278512200035.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。