臺灣博碩士論文加值系統

由於近年來網際網路通訊的日益興盛，透過網路所傳遞的各種影像之應用存在著某些安全上的疑慮，因此，安全性的提昇日益重要。 這篇論文提供兩種解決方法來解決視覺密碼上的作弊問題和數位影像上的竄改問題。
視覺密碼在秘密通訊服務中引起釵h關注。 基本上，視覺密碼為把一個秘密信息編碼成數個無意義的分享影像，而之後可透過全部亦或數個分享影像疊合來還原秘密信息，毋需任何計算。 視覺密碼也已實際應用在影像驗證、視覺驗證、影像影藏和數位浮水印。 不幸地，在釵h應用中視覺密碼被揭露出可能存在「作弊問題」，意即疊合還原的秘密影像可能受內部的惡意作弊者影響而改變。現今，普及式運算在學術和工業上已經被廣泛地應用，因此，可借助此優勢將其運用在解碼階段所需的輕量型運算。
第二章，我們提出一個簡單的架構，此架構以增強分享影像的驗證機制來克服作弊問題。對於分享影像是否被更動，其它解決作弊的方法通常只提供模擬兩可的答案，此方法可以有效的確定作弊發生與否。此外，此法更可以有效率的解決視覺密碼中的兩個主要問題，例如:無意義分享影像之管理不便的問題及分享影像間難以精準疊合的問題。
第三章，我們提出一個新穎的易碎型浮水印方法。此乃結合二次邏輯映射及漢明碼的混合式架構以偵測任何目的影像上的更動。基於安全理由，使用一把私鑰來產生二次邏輯映射以對抗向量量化編碼的攻擊，各區塊的驗證藏入為各自獨立。實驗結果顯示我們提出的方法可以有效地偵測及惡意竄改定位缺損的位元，亦可抵擋向量量化編碼的攻擊。

The communications through computer network are popular recently; therefore, the security problems of various image applications are getting much more important while transferring or passing images through the Internet. This thesis provided two methods for solving cheating problem in Visual Cryptography and detecting the tampering in digital images.
Visual Cryptography (VC) has drawn much attention for providing the service of secret communication. Basically, VC is the process of encoding a secret into several meaningless shares and later decoding the secret by superimposing all or some of the shares without any computation involved. VC has been adopted to support some practical applications, such as image authentication, visual authentication, image hiding, and digital watermarking. Unfortunately, in many applications, VC has been shown to suffer from the “cheating problem” in which the disclosed secret image may be altered by malicious insiders who are called “cheaters.” While ubiquitous computing has been well developed, it has recently occurred to people in both academia and industry that research could benefit more from computational VC by introducing light-weight computation costs in the decoding phase.
In Chapter 2, a simple scheme is proposed to conquer the cheating problem by facilitating the capability of share authentication. It is worthwhile to note that the proposed scheme can identify for certain whether cheating attacks have occurred or not, while other schemes that have the same objective frequently provide a vague answer. In addition, the proposed scheme effectively addresses the two main problems of VC, i.e., the inconvenience of meaningless share management and the challenge of achieving difficult alignment.
In Chapter 3, a new fragile watermarking scheme is proposed. For the purpose of detecting any modification of the image, a hybrid scheme combining a two-pass logistic map with Hamming code is designed. For security purposes, the two-pass logistic map scheme contains a private key to help resist the VQ attack even when the embedding scheme is block-wise independent. The experimental results show that our proposed scheme can detect and locate burst bits and malicious tampering effectively; it can also resist the VQ attack successfully.

中文摘要 1
Abstract 2
Contents 4
List of Figures 5
List of Tables 6
1. Introduction 7
1.1. Research Motivation and Objectives 7
1.2. Organization 10
2. Preventing Cheating in Computational Visual Cryptography 11
2.1. Preliminaries 11
2.2 Related Work 13
2.2.1 Visual Cryptography 13
2.2.2 Cheating problem 14
2.3 Proposed scheme 15
2.3.1 The base codebook design 16
2.3.2 Embedding Process 19
2.3.3 Extraction Process 22
2.4 Experimental results and discussions 23
2.5 Security analysis and discussions 25
3. A Effective Scheme Based on Chaos-and-Hamming Code for Authenticating Images 30
3.1 Preliminaries 30
3.2. Related works 31
3.2.1 Vector quantization attack 31
3.2.2 Logistic map 32
3.2.3 Hamming code 33
3.3. The proposed scheme 35
3.3.1 The embedding procedure 37
3.3.2 The detection procedure 42
3.4. Experimental results 44
3.4.1 Performance of detecting and locating tampered areas 45
3.4.2 Resisting the VQ attack 49
4. Conclusions 51
Bibliography 51

[1] M. Naor and A. Shamir, “Visual cryptography,” Proceedings of Advances in Cryptology-EUROCRYPT’94, Lecture Notes in Computer Science, No.950, pp.1-12, Springer-Verlag, 1995.
[2] R. Lukac, K. N. Plataniotis, “Bit-level based secret sharing for image encryption," Pattern Recognition, Vol. 38, Issue. 5, pp.767-772, 2005.
[3] S.-J. Shyu, “Image encryption by random grids”, Pattern Recognition, Vol. 40, Issue 3, pp. 1014-1031, 2007.
[4] M. Naor and B. Pinkas, “Visual authentication and identification,” Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology, Lecture Notes in Computer Science, Vol. 1294, Santa Barbara, California, USA, pp. 322-336, 1997
[5] T.-H. Chen, and D.-S. Tsai, “Owner-customer right protection mechanism using a watermarking scheme and a watermarking protocol,” Pattern Recognition, Vol. 39, Issue. 8, pp. 1530-1541, 2006.
[6] C.-C. Chang, J.-C. Chuang and P.-Y. Lin, “Sharing a secret two-tone image in two gray-level images,” Proceedings of the 11th International Conference on Parallel and Distributed Systems, Vol. 2, pp. 300-304, 2005.
[7] W.-P. Fang and J.-C. Lin, “Visual cryptography with extra ability of hiding confidential data,” Journal of Electronic imaging, Vol. 15, No. 2, 023020, 2006.
[8] C.-S. Tsai, C.-C. Chang, and T.-S. Chen, ”Sharing multiple secrets in digital images,” The Journal of Systems and Software, Vol.64, pp.163-170, 2002.
[9] C.-C. Chang and J.-C. Chuang, "An image intellectual property protection scheme for gray-level images using visual secret sharing strategy," Pattern Recognition Letters, Vol. 23, pp. 931-941, 2002.
[10] S.-J. Lin, J.-C. Lin, “VCPSS: A two-in-one two-decoding-options image sharing method combining visual cryptography (VC) and polynomial-style sharing (PSS) approaches,” Pattern Recognition, Vol. 40, Issue 12, pp. 3652-3666, 2007.
[11] D. Jin, W.Q. Yan, and M.S. Kankanhalli, "Progressive color visual cryptography," Journal of Electronic Imaging, Vol. 14, 033019, 2005.
[12] G. Horng, T.-H. Chen, and D.-S. Tsai, “Cheating in visual cryptography,” Designs, Codes, Cryptography, Vol. 38, No. 2, pp. 219–236, 2006.
[13] C.-M. Hu and W.-G. Tzeng. “Cheating prevention in visual cryptography,” IEEE Transactions on Image Processing, Vol. 16, Issue 1, pp.36-45, 2007.
[14] D.-S. Tsai, T.-H. Chen and G. Horng, "A cheating prevention scheme for binary visual cryptography with Homogeneous secret images," Pattern Recognition, Vol. 40, Issue 8, pp. 2356-2366, 2007.
[15] D.-S Tsai and G. Horng, “Cheating in visual cryptography revisited,” Proceedings of 17th Information Security Conference, Chiayi, Taiwan, June 8, 2007.
[16] M. Naor and B. Pinkas, “Visual authentication and identification,” Proceedings of Advances in Cryptology, Lecture Notes in Computer Science, Vol. 1294, pp. 322–336, 1997.
[17] T.-H. Chen, C.-S. Wu, and W.-B. Lee, "A novel subliminal channel found in visual cryptography and its application to image hiding," Proceedings of the Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIHMSP07), Kaohsiung City, Taiwan, November 26-28, 2007.
[18] I. Pitas, “A method for signature casting on digital images,” Proceedings of International Conference on Image Processing, ICIP 96, Vol. 3, 1996.
[19]M. U. Celik, G. Sharmar and A. M. Tekalp, “Hierarchical watermarking for secure image authentication with localization,” IEEE Transactions on Image Processing, vol. 11, no. 6, pp. 585-594, 2002.
[20]C.-S. Chan and C.-C. Chang, “An efficient image authentication method based on Hamming code,” Pattern Recognition, vol. 40, no. 2, pp. 681-690, 2007.
[21]E.-C. Chang, M. S. Kankanhalli, X. Guan, Z.-Y. Huang and Y.-H. Wu, “Robust image authentication using content based compression,” ACM Multimedia System Journal, vol. 9, no. 2, pp. 121-130, 2003.
[22]Z. Dawei, C. Guanrong and L. Wenbo, “A chaos-based robust wavelet-domain watermarking algorithm,” Choas, Solitons & Fractals, vol. 22, pp. 47-54, 2004.
[23]R. L. Devaney, A First Course in Chaotic Dynamical Systems - Theory and Experiment, Addison-Wesley, Reading, MA, 1992.
[24]J. Fridrich, “Security of fragile authentication watermarks with localization,” Proceedings of SPIE Conference on Security and Watermarking of Multimedia Contents, vol. 4675, pp. 691-700, San Jose, California, April 2002.
[25]J. Fridrich, M. Goljan and A. C. Baldoza, “New fragile authentication watermark for images,” Proceeding of IEEE International Conference on Image Processing, vol. 1, pp. 446-449, Vancouver, Canada, 2000.
[26]R. W. Hamming, “Error detecting and error correcting codes,” Bell system technical journal, vol. 26, no. 2, pp. 147-160, 1950.
[27]M. Holliman and N. Memon, “Counterfeiting attacks on oblivious block-wise independent invisible watermarking schemes,” IEEE Transactions on Image Processing, vol. 9, no. 3, pp. 432-441, 2000.
[28]C.-Y. Lin and S.-F. Chang, “Issues and solutions for authenticating MPEG video,” Proceedings of SPIE on Security and Watermarking for Multimedia Contents, San Jose, CA, vol. 3657, pp. 54-65, 1999.
[29]C.-Y. Lin and S.-F. Chang, “A robust image authentication method distinguishing JPEG compression from malicious manipulation,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 11, no. 2, pp. 153-168, 2001.
[30]S.-H. Liu, H.-X. Yao, W. Gao and Y.-L. Liu, “An image fragile watermark scheme based on chaotic image pattern and pixel-pairs,” Applied Mathematics and Computation, vol. 185, no. 2, pp. 869-882, 2007.
[31]W. Lu, H. Lu and F.-L. Chung, “Robust digital image watermarking based on subsampling,” Applied Mathematics and Computation, vol. 181, no. 2, pp. 886-893, 2006.
[32]A. Mooney and J. G. Keating. “Generation and detection of watermarks derived from chaotic functions,” Proceedings of Opto-Ireland 2005:Imaging and Vision, vol. 5823, pp. 58-69, Dublin, 2005.
[33]A. Mooney, J. G. Keating and I. Pitas, “A comparative study of chaotic and white noise signals in digital watermarking,” Chaos, Solitons & Fractals, vol. 35, no. 5, pp. 913-921, 2008.
[34]A. H. Paquet, R. K. Ward and I. Pitas, “Wavelet packets-based digital watermarking for image verification and authentication,” Signal Processing, vol. 83, no. 10, pp. 2117-2132, 2003.
[35]Z. Peng and W. Liu, “Color image authentication based on spatiotemporal chaos and SVD,” Chaos, Solitons & Fractals, vol. 36, no. 4, pp. 946-952, May 2008.
[36]D. Simitopoulos, D. E. Koutsonanos and M. G. Strintzis, “Robust image watermarking based on generalized Radon transformations,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 13, no. 8, pp. 732-745, 2003.
[37]C.-W. Tang and H.-M. Hang, “A feature-based robust digital image watermarking scheme,” IEEE Transactions on Signal Processing, vol. 51, no. 4, pp.950-958, 2003.
[38]S. Voloshynovskiy, S. Pereira, V. Iquise and T. Pun, “Attack modeling: toward a second generation watermarking benchmark,” Signal Processing, vol. 81, no. 6, pp. 1177-1214, 2001.
[39]P. Wong and N. Memon, “Secret and public key authentication watermarking schemes that resist vector quantization attack,” Proceedings of SPIE on Security and Watermarking of Multimedia Contents, vol. 3971, pp. 417-427, San Jose, California, USA, 2000.
[40]M. Yeung and F. Mintzer, “An invisible watermarking technique for image verification,” Proceeding of IEEE International Conference on Image Processing, vol. 2, pp. 680-683, Santa Barbara, California, 1997.
[41]Y. Linde, A. Buzo, R. Gray, “ An Algorithm for Vector Quantizer Design,” IEEE Transactions on Communications, vol. 28, no. 1, pp. 84-95, 1980.