摘要
門檻式隨機網格視覺密碼機制 (threshold visual cryptograms of random grids, TVCRG) 的分享影像無需像素擴張且看似雜亂無意義；但在分享者參與多個機密分享時，卻有不易分辨手中分享影像用在那個機密上的問題。在分享影像上置入有意義的圖像，可使分享者有效地管理與辨識。本研究提出門檻式多重有意義分享影像隨機網格視覺密碼機制 (TVCRG with meaningful shares)：在(k, n) 門檻下，n 張分享影像可分別顯示n 張不同的有意義圖像，而在任 k（或大於 k）張分享影像疊合結果上可辨識出機密影像，不受置入有意義圖像的干擾，且任小於 k 張分享影像無法獲得 P的資訊。實驗結果和對比分析（分享影像上有意義圖像的對比和疊合結果上機密的對比）顯示了本研究的正確性與有效性。
並列摘要
The shares in a set of threshold visual cryptograms of random grids (TVCRG) do not need an extra pixel expansion and look like random pictures. However, when one participates the sharing of several secrets, he/she is confronted with the inconvenience for managing the shares at hand (such as not easy to identify which share is the right one). We propose a feasible TVCRG with meaningful shares in this research: Given secret image P, threshold k and n meaningful pictures, the n encoded visual cryptograms of random grids look like the n meaningful pictures and the superimposed result of any k or more shares reveals P without the interference of the meaningful shares, while that of any less than k shares gives nothing to P. Experimental results (including the contrast analyses on the meaningful shares and on the revealed secret) demonstrate the effectiveness of our scheme. are also examined.
延伸閱讀
- Hsu, C. H. (2010). 基於視覺密碼的改良式多機密影像分享機制 [master's thesis, Chung Yuan Christian University]. Airiti Library. https://doi.org/10.6840/cycu201000668
- Chen, Y. W. (2017). 基於隨機網格之有意義機密分享影像的視覺密碼技術 [master's thesis, National Taichung University of Science and Technology]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0061-2908201719135700
- 鍾宇鈞（2020）。可容錯且有意義的多重視覺機密分享機制之研究〔碩士論文，國立暨南國際大學〕。華藝線上圖書館。https://doi.org/10.6837/ncnu202000369
- Tsai, H. Y. (2012). 植基於有意義的分享影像之像素非擴展式視覺密碼技術 [master's thesis, National Tsing Hua University]. Airiti Library. https://doi.org/10.6843/NTHU.2012.00064
- 官振宇（2009）。有意義且不擴展分享影像之漸進式視覺密碼〔碩士論文，淡江大學〕。華藝線上圖書館。https://doi.org/10.6846/TKU.2009.01081