steganography with public key cryptography for
play

Steganography with Public-Key Cryptography for Videoconference XXX - PowerPoint PPT Presentation

Steganography with Public-Key Cryptography for Videoconference XXX CNMAC - Set/2007 Fbio Borges de Oliveira Steganography with Public-Key Cryptography for Videoconference p.1/26 Steganography Source: Steganography: Steganography with


  1. Steganography with Public-Key Cryptography for Videoconference XXX CNMAC - Set/2007 Fábio Borges de Oliveira Steganography with Public-Key Cryptography for Videoconference – p.1/26

  2. Steganography Source: Steganography: Steganography with Public-Key Cryptography for Videoconference – p.2/26

  3. Why do we need to use it? 1. The enemy could interrupt the message 2. There is the Shor’s quantum algorithm that can factor huge numbers quickly O ( n 3 ) 3. Someone might find a way to break the cryptosystem Steganography with Public-Key Cryptography for Videoconference – p.3/26

  4. Symmetric Secure Channel Ana Beth Edna Steganography with Public-Key Cryptography for Videoconference – p.4/26

  5. Asymmetric Ana Beth Edna Steganography with Public-Key Cryptography for Videoconference – p.5/26

  6. RSA ϕ = ϕ ( pq ) = ( p − 1)( q − 1) Choose a so that gcd( a, ϕ ) = 1 ab ≡ 1 mod ϕ. x ab ≡ x mod pq ∀ x ∈ Z . Steganography with Public-Key Cryptography for Videoconference – p.6/26

  7. Diffie-Hellman Alice chooses k with gcd ( k, pq ) = 1 and sends the values of k and pq . Then, Alice chooses a r , computes k r and sends the result to Bob while keeping r secret. At the same moment Bob chooses s , computes k s and sends the result to Alice while keeping s secret. So, both form the candidate exponent a = ( k r ) s = ( k s ) r . To verify if a is a valid RSA exponent, Alice computes gcd ( a, ϕ ) = 1 . If a is not valid they repeat the process. Steganography with Public-Key Cryptography for Videoconference – p.7/26

  8. Key agreement Diffie-Hellman ElGamal Menezes-Vanstone Discrete Logarithmic Problem Steganography with Public-Key Cryptography for Videoconference – p.8/26

  9. Steganography and Public-key Steganography using public-key cryptography cannot use a static media, like an image, but it requires a data stream, like a dialog. Steganography with Public-Key Cryptography for Videoconference – p.9/26

  10. Videoconference We have the option to use the sound or the video We chose the ITU-T H263 - video codec protocol An H263 video stream contains I-frame, P-frame and B-frame Hiding in a sequence of JPEG Steganography with Public-Key Cryptography for Videoconference – p.10/26

  11. Spatial domain For every 8 bits. Steganography with Public-Key Cryptography for Videoconference – p.11/26

  12. Spatial domain Bit position: 12345678 Steganography with Public-Key Cryptography for Videoconference – p.11/26

  13. Spatial domain Bit position: 12345678 Steganography with Public-Key Cryptography for Videoconference – p.11/26

  14. Spatial domain Bit position: 12345678 Steganography with Public-Key Cryptography for Videoconference – p.11/26

  15. Spatial domain Bit position: 12345678 Steganography with Public-Key Cryptography for Videoconference – p.11/26

  16. Spatial domain Bit position: 12345678 Steganography with Public-Key Cryptography for Videoconference – p.11/26

  17. Spatial domain Bit position: 12345678 Steganography with Public-Key Cryptography for Videoconference – p.11/26

  18. Spatial domain Bit position: 12345678 Steganography with Public-Key Cryptography for Videoconference – p.11/26

  19. Spatial domain Bit position: 12345678 Steganography with Public-Key Cryptography for Videoconference – p.11/26

  20. Visual attack Steganography with Public-Key Cryptography for Videoconference – p.12/26

  21. Steganographic scheme in JPEG Quantizer DCT Entropy Encoder Input 8 x 8 k c Steganography o JPEG l B Output Image Entropy Decoder Dequantizer Inverse DCT Steganography with Public-Key Cryptography for Videoconference – p.13/26

  22. Discrete Cosine Transform (DCT) 7 7 F [ m, n ] = C ( m ) C ( n ) � � P [ x, y ] cos α cos β, 2 2 x =0 y =0 α = (2 x + 1) mπ , 16 β = (2 y + 1) nπ 16 � 1 2 for k = 0 , √ C ( k ) = 1 for all other values of k . Steganography with Public-Key Cryptography for Videoconference – p.14/26

  23. The quantization F ′ [ m, n ] = F [ m, n ] Q [ m, n ] Steganography with Public-Key Cryptography for Videoconference – p.15/26

  24. Pixel matrix P   0 0 0 200 200 0 0 0   0 0 200 200 200 200 0 0       0 200 200 200 200 200 200 0     200 200 200 200 200 200 200 200   P =     200 200 200 200 200 200 200 200       0 200 200 200 200 200 200 0     0 0 200 200 200 200 0 0     0 0 0 200 200 0 0 0 Steganography with Public-Key Cryptography for Videoconference – p.16/26

  25. Quantization matrix Q   6 11 16 21 26 31 36 41   11 16 21 26 31 36 41 46       16 21 26 31 36 41 46 51       21 26 31 36 41 46 51 56   Q =     26 31 36 41 46 51 56 61       31 36 41 46 51 56 61 66       36 41 46 51 56 61 66 71     41 46 51 56 61 66 71 76 Steganography with Public-Key Cryptography for Videoconference – p.17/26

  26. Consider the matrices A that has not suffered steganography B that has changed in every second LSB of coefficients AC, whose modulus is greater than two C that has changed only the second LSB of F ′ [0 , 2] D that has changed the LSB of AC, whose modulus is greater than one Steganography with Public-Key Cryptography for Videoconference – p.18/26

  27. Euclidian distance | P − A | = 35 . 60898762 | P − B | = 200 . 2698180 | P − C | = 48 . 98979486 | P − D | = 106 . 5833008 Steganography with Public-Key Cryptography for Videoconference – p.19/26

  28. Matrix A without steganography Steganography with Public-Key Cryptography for Videoconference – p.20/26

  29. Matrix B with aggressive settings Steganography with Public-Key Cryptography for Videoconference – p.21/26

  30. Matrix C no aggressive settings Steganography with Public-Key Cryptography for Videoconference – p.22/26

  31. Matrix D with aggressive settings Steganography with Public-Key Cryptography for Videoconference – p.23/26

  32. The protocol 1. the position of the sequence of bits previously agreement to establish communication in a videoconference, 2. steganography more secure, 3. Diffie-Hellman key agreement, 4. RSA to exchange an irrational number generator, 5. strong cryptography based on irrational numbers. Steganography with Public-Key Cryptography for Videoconference – p.24/26

  33. Conclusion We have introduced a model for steganocryptography First of all we revised the RSA, Diffie-Hellman and JPEG’s compression Our contribution is showing the viability to embed in others LSB It brings an extra-layer of security Steganography with Public-Key Cryptography for Videoconference – p.25/26

  34. Last Slide Thank you. Any suggestions will be welcome. www.lncc.br/borges Fábio Borges de Oliveira Steganography with Public-Key Cryptography for Videoconference – p.26/26

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend