跳到主要內容

臺灣博碩士論文加值系統

(54.83.119.159) 您好!臺灣時間:2022/01/17 09:06
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:巫玉珊
研究生(外文):Yu-Shan Wu
論文名稱:機密影像之分享與隱藏
論文名稱(外文):Sharing and Hiding of Secret Images
指導教授:林志青林志青引用關係
指導教授(外文):Ja-Chen Lin
學位類別:碩士
校院名稱:國立交通大學
系所名稱:資訊科學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2002
畢業學年度:90
語文別:英文
論文頁數:91
中文關鍵詞:機密影像分享資料隱藏偽造檢測偽造者辨識
外文關鍵詞:secret image sharingdata hidingfaking detectionfaker identification
相關次數:
  • 被引用被引用:0
  • 點閱點閱:216
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:1
隨著網際網路的日益盛行,有助於我們在網路上傳送資料。然而在開放的網際網路上進行傳輸(或存放)時,如何安全的傳送機密文件是目前十分重要的議題。一般而言,機密文件若集中於一個資訊(information carrier)來保管,則一旦這個資訊載體遭破壞或遺失,機密亦即損失。但在另一方面,若複製多份,則被盜取破解的機率亦會增加。為能解決這樣一個不易兩全其美的問題,機密分享(secret sharing)可能是最好的解決方式。
在本篇論文中,我們將機密分享的概念使用於數位影像上。當我們對機密影像作分享(sharing)後,我們會得到n張看似雜訊的分(shadows)。為了避免引起駭客的注意,我們加入了資料隱藏(data hiding)的方法,使得每張分存看似一般普通的影像,並且經由資料隱藏後的分存資料量仍相等於未包裝前。為了達到此目標,我們提出兩種量化(quantization)法:(1)固定區塊大小量化法及(2)變動區塊大小量化法。
由於影像分存在傳輸或儲存的過程中,可能遭遇到破壞,因此,我們提出一個快速分存檢驗法,來驗證是否所蒐集到的分存均為正確無誤的。此外,我們也提出另一個具辨識偽造者並修復分存的機制;我們可將這機制與快速分存檢驗法結合,以獲得一個立即檢測並快速修復的系統。

Due to the popularity of Internet, it is convenient to transmit and receive information. However, the data are easy to get intercepted or peeped in the public environment of computer network, hence how to transmit confidential data securely becomes critical research. Traditionally, the data are stored or transmitted by only one information carrier; and hence, the secrets will disappear when the information carrier is destroyed or lost. On the other hand, if we duplicate several copies of the secrets in the storage or transmission process, then the probability of being stolen will also increase. In order to overcome this problem, “secret sharing” might be the best solution.
In the thesis, we apply the secret sharing concept to digital images. After sharing the secret image, we can obtain n shadow images (looking like random noise). In order to avoid hacker’s attention, we apply “Data Hiding Procedure” to make each shadow image look like ordinary image; and the size of the shadow image after data hiding is the same as the size before data hiding. To achieve this goal, two quantization procedures are proposed in the thesis: (1) fixed block size, and (2) variable block size.
Since the shadow images might be attacked by hackers during transmission or storage, we propose a “Fast Faking Detection Procedure” to detect whether all of the received shadow images are genuine to ensure the recovery secret image is correct. Another proposed procedure is called “Faker Identification and Damaged Shadows Repairing Procedure”, we can combine it with the Fast Faking Detection Procedure to obtain a real-time alarm system (to judge whether fakers exist), followed by a fast repairing system.

TABLE OF CONTENTS
ABSTRACT IN CHINESE............................................I
ABSTRACT IN ENGLISH...........................................II
ACKNOWLEDGEMENT..............................................III
TABLE OF CONTENTS.............................................IV
LIST OF FIGURES..............................................VII
Chapter 1 Introduction........................................1
1.1 Motivation...............................................1
1.2 Related Studies..........................................2
1.2.1 Literature Review of Secret Sharing Techniques.......2
1.2.2 Literature Review of Image Hiding Techniques.........3
1.2.3 Literature Review of Faker Detection and
Identification Techniques............................4
1.3 Overview of the Proposed Methods.........................5
1.4 Thesis Organization......................................8
Chapter 2 Sharing and Hiding of Secret Images — Fixed Block
Size................................................9
2.1 Introduction.............................................9
2.2 The Proposed Method......................................9
2.2.1 FS Quantization Procedure...........................10
2.2.2 Secret Sharing Procedure............................14
2.2.3 Data Hiding Procedure...............................17
2.2.4 The Secret Image Reconstruction Mechanism...........20
2.3 Distortion and Error....................................23
2.3.1 Distortion between Host Image and Stego Image.......24
2.3.2 Error between Secret Image and Recovery Secret Image ....................................................25
2.4 Experimental Results....................................32
2.5 Summary.................................................35
Chapter 3 Sharing and Hiding of Secret Images — Variable
Block Size.........................................36
3.1 Introduction............................................36
3.2 The Quantization Method.................................36
3.2.1 VS Quantization Procedure...........................37
3.2.2 S_E Table Embedding Procedure.......................40
3.2.3 Finer Repairing Procedure...........................46
3.2.4 The Secret Image Reconstruction Mechanism...........49
3.3 Experimental Results....................................56
3.4 Summary.................................................59
Chapter 4 Fast Faking Detection..............................60
4.1 Introduction............................................60
4.2 The Proposed Method.....................................60
4.2.1 The Property of the Polynomial......................60
4.2.2 Fast Faking Detection Procedure.....................66
4.3 Experimental Results....................................69
4.4 Summary.................................................74
Chapter 5 Faker Identification and Damaged Shadows Repairing ...................................................75
5.1 Introduction............................................75
5.2 The Proposed Method.....................................75
5.2.1 Faker Identification Procedure......................76
5.3 Experimental Results....................................81
5.4 Summary.................................................86
Chapter 6 Conclusions and Future Works......................87
6.1 Conclusions.............................................87
6.2 Future Works............................................88
References...................................................89

REFERENCES
[1] G.R. Blakley, “Safeguarding cryptographic keys,”
Proceedings AFIPS 1979 National Computer Conference, New
York, USA., Vol. 48, pp. 313-317,1979.
[2] A. Shamir, “How to share a secret,” Communication of the
ACM, Vol. 22, No. 11, pp. 612-613, 1979.
[3] M.B. de Carvalho, E.A.B. da Silva, and W.A. Finamore,
“Rate distortion optimized adaptive multiscale vector
quantization,” International Conference on Image
Processing, Vol. 2, pp.439 —442, 2001.
[4] B.Y. Shiueng and Y.T. Lin, “ Smooth side-match classified
vector quantizer with variable block size,” IEEE
Transactions on Image Processing, Vol. 10, No. 5, pp.677 —
685, 2001.
[5] J.C. Tsai, C.H. Hsieh, and T.C. Hsu, “A new dynamic finite-
state vector quantization algorithm for image
compression,” IEEE Transactions on Image Processing, Vol.
9, No. 11, pp.1825 —1836, 2000.
[6] M.H. Johnson, R.E. Ladner, and E.A. Riskin, “Fast nearest
neighbor search of entropy-constrained vector
quantization,” IEEE Transactions on Image Processing, Vol.
9, No. 8, pp. 1435 —1437, 2000.
[7] N. Vlajic and H.C. Card, “Vector quantization of images
using modified adaptive resonance algorithm for
hierarchical clustering,” IEEE Transactions on Neural
Networks, Vol. 12, No. 5, pp. 1147 —1162, 2001.
[8] D.C. Wu and W.H. Tsai, “Spatial-domain Image Hiding Using
Image Differencing,” IEE Proceedings on Vision, Image, and
Signal Processing, Vol. 147, No. 1, pp. 29-37, 2000.
[9] W.N. Lie and L.C. Chang, “Data hiding in images with
adaptive numbers of least significant bits based on the
human visual system,” International Conference on Image
Processing, Vol. 1, pp. 286 —290, 1999.
[10] R.Z. Wang, C.F. Lin, and J.C. Lin, “Hiding Data in Images
by Optimal Moderately-Significant-Bit Replacement,”
Electronic Letters, Vol. 36, No. 25, pp. 2069-2070, 2000.
[11] T.S. Chen, C.C. Chang, and M.S. Hwang, “A virtual image
cryptosystem based upon vector quantization,” Image
Processing, IEEE Transactions on, Vol. 7, No. 10, pp.
1485 —1488, 1998.
[12] M.D. Swanson, B. Zhu, and A.H. Tewfik, “Robust Data
Hiding for Images,” IEEE Digital Signal Processing
Workshop Proceedings, pp. 37-40, 1996.
[13] J. Fridrich and M. Goljan, “Images with Self-Correcting
Capabilities,” International Proceedings on Image
Processing, Vol. 3, pp. 792-796, 1999.
[14] D. Kundur, “Implications for high capacity data hiding in
the presence of lossy compression,” International
Conference on Information Technology: Coding and
Computing, pp. 16 —21, 2000.
[15] R.C. Gonzalez and R.E. Woods, “Digital Image
Processing,” Addison-Wesley Book Company, U.S., 1992.
[16] C.C. Chang and R.J. Hwang, “Sharing secret image using
shadow codebooks,” Information Sciences, Vol. 111, No. 1-
4, pp. 335-345, 1998.
[17] T.C. Wu and W.H. He, “A geometric approach for sharing
secrets,” Computers & Security, Vol. 14, No. 2, pp. 135-
145,1995.
[18] W.H. He and T.S. Wu, “Comment on Lin-Wu (t,n)-threshold
verifiable multisecret sharing scheme,” IEE Proc. Comput.
Digit. Tech., Vol. 148, No. 3 2001.
[19] C.C. Chang, C.S. Tsai, and T.S. Chen, “A new scheme for
sharing secret color images in computer network,”
International Conference on Parallel and Distributed
Systems, pp. 21 —27, 2000.
[20] K.J. Tan and H.W. Zhu, “General secret sharing scheme,”
Computer Communications, Vol. 22, pp. 755—757 1999.
[21] E. Dawson and D. Donovan, “The breadth of Shamir’s
secret sharing scheme,” Comput. Security, Vol.13, pp. 69—
78 1995.
[22] A. Beimel and B. Chor, “Secret Sharing with Public
Reconstruction,” IEEE Transactions on Information Theory,
Vol.44, No. 5, pp. 1887-1896, 1998.
[23] M. Itoh, A. Saito, and T. Nishizeki, “Multiple assignment
scheme for sharing secret,” J. Cryptol., Vol. 6, No. 1,
pp. 15—20, 1993.
[24] T.C. Wu and T.S. Wu, “Cheating Detection and Cheater
Identification in Secret Sharing Schemes,” IEE Proc.
Comput. Digit. Tech., Vol.142, No. 5, 1995.
[25] K.J. Tan, H.W. Zhu, and S.J. Gu, “Cheater identification
in (t,n) threshold scheme,” Computer Communications, Vol.
22, pp. 755—757 1999.
[26] C.C. Chang and C.W. Chan, “Detecting dealer cheating in
secret sharing systems,” Computer Software and
Applications Conference, 2000. COMPSAC 2000. The 24th
Annual International, pp.449 —453, 2000.
[27] K. Okada and K. Kurosawa, “MDS Secret Sharing Scheme
Secure Against Cheaters,” IEEE Transactions on
Information Theory, Vol. 46, No. 3, 2000.
[28] G. R. Blakley and G. A. Kabatianski, “Ideal perfect
threshold schemes and MDS codes,” IEEE Conf. Proc., Int.
Symp. Information Theory, p. 488, 1995.
[29] W. Ogata and K. Kurosawa, “Optimum secret sharing schemes
secure against cheating,” in Advances in Cryptology,
Proc. Eurocrypt’96 New York: Springer-Verlag, 1996, Vol.
1070, pp. 200—211.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top