簡易檢索 / 詳目顯示

回結果列表
研究生： 樊恩戎
Farn, En-Jung
論文名稱： 基於各種拼圖遊戲的資訊隱藏學之研究
A Study of Steganography Based on Puzzle Games
指導教授： 陳朝欽
口試委員:
學位類別： 博士
Doctor
系所名稱： 電機資訊學院 - 資訊工程學系
Computer Science
論文出版年： 2010
畢業學年度： 99
語文別： 中文
論文頁數： 82
中文關鍵詞： 資訊影藏學 、拼圖遊戲 、資料藏匿
外文關鍵詞： steganography, puzzle games, data hiding
相關次數： 點閱：2  下載：0 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 在網際網路上有許多種不同的拼圖遊戲。在本篇論文裡面，我們提出三個新的資訊隱藏方法，分別將秘密資訊藏在三種熱門的拼圖遊戲中：jigsaw拼圖、jig swap拼圖和 (n2-1)拼圖。
    我們所提出的第一個新方法，是將秘密資訊藏在 jigsaw拼圖影像裡面。首先，將一個輸入的數位影像分割成許多區塊(blocks)。接著，在每一個區塊的右邊跟底部畫上一個半圓(semicircle)並與邊線相接。我們將利用半圓的位置和圓弧的方向和一把秘密金鑰(stego-key)來藏秘密資訊。最後會得到一個看起來像一般常出現在網路上之jigsaw拼圖影像。
    第二個提出的新方法，是將秘密資訊藏在jig swap拼圖影像裡面。首先，將輸入的一個彩色數位影像分割成許多區塊。然後將每個區塊根據秘密資訊和一把秘密金鑰，重新規劃擺到新的位置。最後會得到一個完美的jig swap拼圖影像。解密的過程將需要原始影像。假設，發信者(sender)跟收信者(receiver)分享一些共同的影像，收信者將可以從已藏有秘密資訊的jig swap拼圖影像中擷取出藏入的秘密資訊。
    第三個提出的新方法，是將秘密資訊藏在一個可解的(n2-1)拼圖裡面。秘密資訊一開始將被轉換成一個從1到n2-1數列的排列。接著基於一parity測試演算法及一秘密金鑰，我們提出一偶排列產生器，將秘密資訊轉換出來的排列轉換成一個可解的(n2-1)拼圖。
    我們同時也提出一個如何利用線上拼圖遊戲 (on-line puzzle game) 來傳輸秘密資訊的方案。實驗數據顯示出我們所提出的三個資訊隱藏方法都是不可被偵測的 (undetectable)。更進一步來說，第一和第二個所提出的方法，都是對失真壓縮 (lossy compression) 和壓縮格式轉換 (format conversion)具有抗性；第三個方法則是沒有失真壓縮、壓縮格式轉換和幾何圖形失真的問題。

    There are many kinds of puzzle games on the Internet. In this thesis, three new steganographic methods are proposed based on three popular puzzle games: jigsaw puzzle, jig swap puzzle and (n2-1)-puzzle.
    The first novel method is proposed to hide secret data in jigsaw puzzle images. First, a digital image is taken as input and divided into blocks. Then, a semicircle is drawn and attached to the right/ bottom side of each block. The secret data are embedded through the attached positions and orientations of the semicircles according to a stegokey. The resulting image looks like those jigsaw puzzle images appearing on many jigsaw puzzle Web sites.
    The second novel method is proposed to hide a secret message in a jig swap puzzle image. First, a color image is taken as input and divided into blocks. Second, each block is rearranged to a new position according to the secret data and a stegokey. The resulted image is a perfect jig swap puzzle. The original image is needed for extracting secret data. Under the assumption that the receiver and the sender share some common images, the receiver can extract the secret data from the jig swap puzzle image.
    The third novel method is proposed to hide secret message in a solvable (n2-1)-puzzle. The secret message is first converted into a permutation of numbers 1 to n2-1. Based on a parity test algorithm and a stegokey, an even permutation generator is provided to transform the obtained permutation into a solvable stego-(n2-1)-puzzle.
    A scenario is also presented for secret message transmission via an on-line puzzle game. Experimental results show that all of these three proposed methods are undetectable. Furthermore, the first and second methods are robust to lossy compression and format conversion, and the third method has no robustness problem for lossy compression, format conversion and geometric distortion.

    CHAPTER 1 Introduction .......................................................................................1 CHAPTER 2 Jigsaw Puzzle Images for Steganography 2.1 Introduction ..................................................................................................7 2.2 The Proposed Method ................................................................................10 2.2.1 Embedding a Secret Message in a Jigsaw Puzzle Image ………………10 2.2.2 The Proposed Embedding Process ……………………………………..14 2.2.3 The Extraction Process …………………………………………………16 2.3 Analysis of The Proposed Method ……………………………………….20 2.3.1 Limited Robustness …………………..................................................20 2.3.2 Security and Undetectability ............................................................... 27 2.3.3 Capacity................................................................................................ 30 2.4 Summary........................................................................................................ 31 CHAPTER 3 A Novel Steganographic Method Based on Jig Swap Puzzle Images 3.1 Introduction ...................................................................................................32 3.2 The Proposed Method and Scenario ..............................................................33 3.2.1 Idea of Embedding a Secret Message in a Jig Swap Puzzle Image ……...34 3.2.2 The Proposed Embedding Process .............................................................37 3.2.3 Example ......................................................................................................40 3.2.4 The Extraction Process ...............................................................................42 3.2.5 The Proposed Scenario ...............................................................................48 3.3 Analysis of the Proposed Method ..................................................................50 3.3.1 Robustness.............................................................................................50 3.3.2 Imperceptibility.....................................................................................51 3.3.3 Undetectability and Security................................................................ 53 3.4 Summary.........................................................................................................55 CHAPTER 4 A New Data Hiding Method Based on (n2-1)-Puzzle 4.1 Introduction ...................................................................................................56 4.2 The Proposed Method ...................................................................................57 4.2.1 Preliminary .................................................................................................57 4.2.2 Parity Test for Even Permutation ...............................................................59 4.2.3 The Proposed Embedding Process .............................................................60 4.2.4 The Proposed Extraction Process ...............................................................65 4.2.5 The Proposed Scenario ...............................................................................67 4.3 Analysis of the Proposed Method ..................................................................68 4.3.1 Robustness ..................................................................................................68 4.3.2 Security and Undetectability ......................................................................69 4.3.3 Capacity ......................................................................................................72 4.4 Summary.........................................................................................................73 CHAPTER 5 Conclusion and Discussion……......................................................74 References ……..........................................................................................................76

    [Bend1996] W. Bender et al., “Techniques for Data Hiding,” IBM Systems J., Vol. 35, No. 3-4, 313-336, 1996.
    [Cach1998] C. Cachin, “An Information-Theoretic Model for Steganography,” 2nd Int’l Workshop in Information Hiding, Springer-Verlag, Vol. 1525, 273–289, 1998.
    [Chan2002] C. L. Chang, T. S. Chen, and L. Z. Chung, "A steganographic method based upon JPEG and quantization table modification," Information Sciences, Vol.141, No.1-2, 123-138, 2002.
    [Chan2004] C. K. Chan and L. M. Cheng, “Hiding data in images by simple LSB substitution,” Pattern Recognition, Vol. 37, 469–474, 2004.
    [Cox2008] I. J. Cox, M. L. Miller, J. A. Bloom, J. Fridrich, and T. Kalker, Digital Watermarking and Steganography. Morgan Kaufmann publisher, 429-495, 2008.
    [Delf2008] A. Delforouzi, M. Pooyan, “Adaptive digital audio steganography based on integer wavelet transform,” Circuits, Systems, and Signal Processing, Vol. 27, No. 2, 247-259, 2008.
    [Dema2007] E. D. Demaine and M. L. Demaine, “Jigsaw puzzles, edge matching, and polyomino packing: connections and complexity,” Graphs and Combinatorics, Vol. 23, No. 1, 195-208, 2007.
    [Ditt2006] J. Dittmann, C. Kraetzer, “Audio benchmarking tools and steganalysis,” http://www.ecrypt.eu.org/documents/D.WVL.10-1.1.pdf, 2006.
    [Dumi2003] S. Dumitrescu, X. Wu, Z. Wang, ”Detection of LSB steganography via sample pair analysis,” Proc. 5th Int'l Workshop on Information Hiding, Berlin, Springer-Verlag, 355-372, 2003.
    [Farn2009A] E. J. Farn and C. C. Chen, “Novel steganographic method based on jig swap puzzle images,” Journal of Electronic Imaging, Vol. 18, No. 1: 013003, 2009.
    [Farn2009B] E. J. Farn and C. C. Chen, “Jigsaw puzzle images for steganography,” Optical Engineering, Vol. 48, No. 7: 077006, 2009.
    [Frid2000] J. Fridrich and R. Du, “Secure Steganographic Methods for Palette Images,” Proc. The 3rd Information Hiding Workshop, LNCS, Springer-Verlag, New York, Vol. 1768, 47-60, 2000.
    [Frid2002] J. Fridrich, M. Goljan, and D. Hogea, “Steganalysis of JPEG Images: Breaking the F5 Algorithm,” Proc. 5th Int’l Workshop Information Hiding, Springer-Verlag, 7-9, 2002.
    [Frid2005] J. Fridrich, T.S. Holotyak and D. Soukal, “Stochastic Approach to Secret Message Length Estimation in +-k Embedding Steganography,” Proc. SPIE Electronic Imaging, San Jose, CA, Vol. 16, No. 20, 673-684, 2005.
    [Frid2006] J. Fridrich and D. Soukal, “Matrix embedding for large payloads,” IEEE Trans. Inf. Security Forensics, Vol. 1, No. 3, 390–394, 2006.
    [Gard1959] M. Gardner, The Mathematical Puzzles of Sam Loyd, Dover Publisher, New York, 1959.
    [Haye2001] R. Hayes, “The Sam Loyd 15-Puzzle,” Technical Report TCD-CS-2001-24, University of Dublin, Trinity College, Ireland, 2001.
    [John1879] W. A. Johnson, “Notes on the 15 Puzzle 1,” Amer. J. Math., Vol. 2, No. 14, 397-399, 1879.
    [John1998A] N. Johnson, and S. Jajodia, “Exploring Steganography: Seeing the Unseen,” IEEE Computer, Vol. 31, No. 2, 26-34, 1998.
    [John1998B] N.F. Johnson and S. Jajodia, “Steganalysis of Images Created Using Current Steganographic Software,” Proc. 2nd Int’l Workshop in Information Hiding, Springer-Verlag, 273–289, 1998.
    [Khar2006] M. Kharrazi, H. T. Sencar, and N. Memon “Cover selection for steganographic embedding,” IEEE International Conference on Image Processing, 117-120, 2006.
    [Knut1997] D. E. Knuth, The Art of Computer Programming, Vol 1: Fundamental Algorithms, 3rd Edition, Addison-Wesley Publishing Company, 1997.
    [Lee2000] Y. K. Lee and L. H. Chen, "High Capacity Image Steganographic Model," IEE Proceedings-Vision, Image, and Signal Processing, Vol. 147, No. 3, 288-294, 2000.
    [Lee2003] Y. K. Lee and L. H. Chen, "Secure Error-Free Steganography for JPEG images," International Journal of Pattern Recognition and Artificial Intelligence, Vol. 17, No. 6, 967-981, 2003.
    [Lyu2002] S. Lyu and H. Farid, “Detecting Hidden Messages Using Higher-Order Statistics and Support Vector Machines,” Proc. 5th Int’l Workshop in Information Hiding, Springer-Verlag, 340-354, 2002.
    [Marv1999] L. M. Marvel Jr., C. G. Boncelet and C. T. Retter, “Spread spectrum image steganography," IEEE Trans. Image Processing, Vol. 8, No. 8, 1075-1083, 1999.
    [Ni2006] Z. Ni, Y. Q. Shi, N. Ansari, and W. Su, “Reversible data hiding,” IEEE Trans. Circuits Syst. Video Technol, Vol. 16, No. 3, 354–362, 2006.
    [Niel2009] T. R. Nielsen, P. Drewsen, and K. Hansen, “Solving jigsaw puzzles using image features,” Pattern Recognition Letters, Vol. 14, No. 29, 1923–1933, 2008.
    [Noda2004] H. Noda, T. Furuta, M. Niimi, E. Kawaguchi, "Application of BPCPS steganography to wavelet compressed video," International Conference on Image Processing, Singapore, Vol. 4, 24-27, 2004.
    [Noto2008] M. Noto, “MP3 stego: hiding text in MP3 files,” http://www.sans.org/reading_room/whitepapers/stenganography/550.php, 2008.
    [Pal2003] A. Pal, K. Shanmugasundaram, and N. Memon, “Automated reassembly
    of fragmented images,” IEEE Trans. Image Process., Vol. 15, No. 2, 385–393, 2003.
    [Parb1997] I. Parberry, “A real time algorithm for the (n2-1)-puzzle,” Information Processing Letters, Vol. 56, 23-28, 1997.
    [Prov2001] N. Provos, “Defending Against Statistical Steganalysis,” Proc. 10th Usenix Security Symp., Usenix Assoc., 323–335, 2001.
    [Prov2003] N. Provos and P. Honeyman, “Hide and Seek: An Introduction to Steganography,” IEEE Security & Privacy, Vol. 1, No. 3, 32-44, 2003.
    [Ratn1990] D. Ratner and M. K. Warmuth, “The (n2-1)-puzzle and related relocation problems,” Journal of Symbolic Computation, Vol. 10, 111-137, 1990.
    [Shan1948] C. E. Shannon, "A mathematical theory of communication," Bell System Technical Journal, Vol. 27, 379-423, 623-656, 1948.
    [Stor1879] W. E. Storey, “Notes on the 15 Puzzle 2,” Amer. J. Math., Vol. 2, No. 14, 399-404, 1879.
    [Thie2003] C. C. Thien and J. C. Lin, “A simple and high-hiding capacity method for hiding digit-by-digit data in images based on modulus function,” Pattern Recognition, Vol. 36, No. 12, 2875–2881, 2003.
    [West1999] A. Westfeld and A. Pfitzmann, “Attacks on Steganographic Systems,” Proc. 3rd Int’l Workshop in Information Hiding, Springer-Verlag, 61–76, 1999.
    [West2001] A. Westfeld, “F5—A Steganographic Algorithm: High Capacity Despite Better Steganalysis,” Proc. 4th Int’l Workshop Information Hiding, Springer-Verlag, 289–302, 2001.
    [Web01] A. Brown, “S-Tool V4,” ftp://idea.sec.dsi.unimi.it/pub/ security /crypt /code/ s-tools4.zip.
    [Web02] H. Repp, “Hide4PGP,” http://www.rugeley.demon.co.uk/security/
    hide4pgp.zip.
    [Web03] D. Upham, “JPEG-JSteg,” http://www.funet.fi/pub/crypt/stefanography /jpeg-jsteg-v4.diff.gzee , 1997.
    [Web04] A. Latham, “Steganography: JPHIDE and JPSEEK,” http://linux01.gwdg.de /~alatham/stego.html, 1999.
    [Web05] N. Provos, “Outguess,” http://www.outguesst.orgoutguest-0.2.tar.gz, 2001.
    [Web06] R. Machado, “\Stego,” http://www.stego.com.
    [Web07] http://www.jigzone.com.
    [Web08] http://www.spintop-games.com.
    [Web09] http://www.kraisoft.com/puzzle-games/real-jigsaw-puzzle.
    [Web10] http://www.jigsaw2order.com.
    [Web11] http://www.alljigsawpuzzles.co.uk/personalised_jigsaw_puzzles.htm.
    [Web12] http://howto.nicubunu.ro/gimp_jigsaw_puzzle.
    [Web13]http://www.photoshopzilla.com/How-to-make-jigsaw-puzzle-pieces_43.html.
    [Web14] http://www.essortment.com/all/howtomakeyour_rgzx.htm.
    [Web15] http://www.tutorials.com/07/0738/0738.asp.
    [Web16] http://www.indezine.com/products/powerpoint/cool/puzzlepictures.html.
    [Web17] http://www.puzzleworld.org/SlidingBlockPuzzles/15.htm.
    [Web18] http://www.thepcmanwebsite.com/media/tile_puzzle.
    [Web19] http://mypuzzle.org/sliding.
    [Web20] http://24hours7days.com/Java/Slide.html
    [Web21] http://www.jigsawpuzzles.ws
    [Web22] http://www.pajersoft.com/winshweb.htm
    [Web23] http://www.kraisoft.com/puzzle-games/jigsaw
    [Web24] http://www.spintop-games.com/jigsaw_game_download/
    jigsaw_landscapes.html
    [Web25] http://www.spintop-games.com/jigsaw_game_download/jigsaw_nature.html
    [Web26] http://www.onlinegameshq.com/game/867/picture-puzzle.html.
    [Web27] http://www.indezine.com/products/powerpoint/cool/puzzlepictures.html.
    [Zhao2007] Y. X. Zhao, M. C. Su, Z. L. Chou, and J. Lee, “A puzzle solver and its application in speech descrambling,” in Proc. 2007 WSEAS Int. Conf. Computer Engineering and Applications, Gold Coast, Australia, pp. 171–176, World Scientific and Engineering Academy and Society WSEAS, Stevens Point, WI, 2007.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)

    QR CODE