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

steganography with public key cryptography for
SMART_READER_LITE
LIVE PREVIEW

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


slide-1
SLIDE 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

slide-2
SLIDE 2

Steganography

Source: Steganography:

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

slide-3
SLIDE 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(n3)

  • 3. Someone might find a way to break the

cryptosystem

Steganography with Public-Key Cryptography for Videoconference – p.3/26

slide-4
SLIDE 4

Symmetric

Ana Beth Edna Secure Channel

Steganography with Public-Key Cryptography for Videoconference – p.4/26

slide-5
SLIDE 5

Asymmetric

Edna Ana Beth

Steganography with Public-Key Cryptography for Videoconference – p.5/26

slide-6
SLIDE 6

RSA

ϕ = ϕ(pq) = (p − 1)(q − 1) Choose a so that gcd(a, ϕ) = 1 ab ≡ 1 mod ϕ. xab ≡ x mod pq ∀x ∈ Z.

Steganography with Public-Key Cryptography for Videoconference – p.6/26

slide-7
SLIDE 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 kr and sends the result to Bob while keeping r secret. At the same moment Bob chooses s, computes ks and sends the result to Alice while keeping s secret. So, both form the candidate exponent a = (kr)s = (ks)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

slide-8
SLIDE 8

Key agreement

Diffie-Hellman ElGamal Menezes-Vanstone Discrete Logarithmic Problem

Steganography with Public-Key Cryptography for Videoconference – p.8/26

slide-9
SLIDE 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

slide-10
SLIDE 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

slide-11
SLIDE 11

Spatial domain

For every 8 bits.

Steganography with Public-Key Cryptography for Videoconference – p.11/26

slide-12
SLIDE 12

Spatial domain

Bit position: 12345678

Steganography with Public-Key Cryptography for Videoconference – p.11/26

slide-13
SLIDE 13

Spatial domain

Bit position: 12345678

Steganography with Public-Key Cryptography for Videoconference – p.11/26

slide-14
SLIDE 14

Spatial domain

Bit position: 12345678

Steganography with Public-Key Cryptography for Videoconference – p.11/26

slide-15
SLIDE 15

Spatial domain

Bit position: 12345678

Steganography with Public-Key Cryptography for Videoconference – p.11/26

slide-16
SLIDE 16

Spatial domain

Bit position: 12345678

Steganography with Public-Key Cryptography for Videoconference – p.11/26

slide-17
SLIDE 17

Spatial domain

Bit position: 12345678

Steganography with Public-Key Cryptography for Videoconference – p.11/26

slide-18
SLIDE 18

Spatial domain

Bit position: 12345678

Steganography with Public-Key Cryptography for Videoconference – p.11/26

slide-19
SLIDE 19

Spatial domain

Bit position: 12345678

Steganography with Public-Key Cryptography for Videoconference – p.11/26

slide-20
SLIDE 20

Visual attack

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

slide-21
SLIDE 21

Steganographic scheme in JPEG

Steganography

B l

  • c

k 8 x 8

JPEG Entropy Encoder Quantizer DCT Dequantizer Inverse DCT Entropy Decoder

Image

Input Output

Steganography with Public-Key Cryptography for Videoconference – p.13/26

slide-22
SLIDE 22

Discrete Cosine Transform (DCT)

F[m, n] = C(m) 2 C(n) 2

7

  • x=0

7

  • y=0

P[x, y] cos α cos β, α = (2x + 1)mπ 16 , β = (2y + 1)nπ 16 C(k) =

  • 1

√ 2 for k = 0,

1 for all other values of k.

Steganography with Public-Key Cryptography for Videoconference – p.14/26

slide-23
SLIDE 23

The quantization

F ′[m, n] = F[m, n] Q[m, n]

Steganography with Public-Key Cryptography for Videoconference – p.15/26

slide-24
SLIDE 24

Pixel matrix P

P =                 

200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200

                

Steganography with Public-Key Cryptography for Videoconference – p.16/26

slide-25
SLIDE 25

Quantization matrix Q

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 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

slide-26
SLIDE 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

slide-27
SLIDE 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

slide-28
SLIDE 28

Matrix A without steganography

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

slide-29
SLIDE 29

Matrix B with aggressive settings

Steganography with Public-Key Cryptography for Videoconference – p.21/26

slide-30
SLIDE 30

Matrix C no aggressive settings

Steganography with Public-Key Cryptography for Videoconference – p.22/26

slide-31
SLIDE 31

Matrix D with aggressive settings

Steganography with Public-Key Cryptography for Videoconference – p.23/26

slide-32
SLIDE 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

slide-33
SLIDE 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

slide-34
SLIDE 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