Secure internet chat
Download
1 / 16

Secure Internet Chat - PowerPoint PPT Presentation


  • 435 Views
  • Updated On :

Secure Internet Chat How to make talking online more secure. Group Key Distribution Relation to 2 Party Key Exchange Importance 4 of 23 Evans Lectures Lacking Analysis Static/Dynamic Membership Simple System: Star n Member Keys, K i 1 Common Key, K Group 1 2 8 3 S 7 4 6 5

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Secure Internet Chat' - JasminFlorian


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Secure internet chat l.jpg

Secure Internet Chat

How to make talking online more secure.


Group key distribution l.jpg
Group Key Distribution

  • Relation to 2 Party Key Exchange

  • Importance

    • 4 of 23 Evans Lectures

    • Lacking Analysis

  • Static/Dynamic Membership


Simple system star l.jpg
Simple System: Star

  • n Member Keys, Ki

  • 1 Common Key, KGroup

1

2

8

3

S

7

4

6

5


Star join l.jpg
Star Join

  • Establish New Member Key

  • Update All Group Keys (Multicast)

E(KGroup, KNewGroup)

1

E(KGroup, KNewGroup)

E(KGroup, KNewGroup)

2

8

3

S

E(KGroup, KNewGroup)

E(KGroup, KNewGroup)

9

E(K9, KNewGroup)

7

4

6

5

E(KGroup, KNewGroup)

E(KGroup, KNewGroup)

E(KGroup, KNewGroup)


Star leave l.jpg
Star Leave

  • n-1 Individual Encryptions

E(K1, KNewGroup)

1

E(K2, KNewGroup)

2

8

3

S

E(K3, KNewGroup)

E(K7, KNewGroup)

9

E(K9, KNewGroup)

7

4

6

5

E(K4, KNewGroup)

E(K6, KNewGroup)

E(K5, KNewGroup)


Basic rekeying schemes l.jpg
Basic Rekeying Schemes

  • N-Party Diffie-Hellman

  • MIIA

  • Star Graph

  • Key Graph


Key graph l.jpg
Key Graph

SK

K2

K2

K1

K1

K1

K1

K0

K0


Key graph member join l.jpg
Key Graph - Member Join

SK

K2

K2

K1

K1

K1

K1

K0

K0


Key graph member leave l.jpg
Key Graph - Member Leave

SK

K2

K2

K1

K1

K1

K1

K0

K0


Several members leave l.jpg
Several Members Leave

SK

K2

K2

K1

K1

K1

K1

K0


Boolean key function minimization l.jpg
Boolean Key Function Minimization

K1

K2

K1

K2

K1

K2

K1

K2

X

K0

1

1

1

0

1

K0

1

1

= K2 + K1


How to analyze l.jpg
How to Analyze?

  • Average Case

    • Bandwidth

    • Computation

    • Storage

  • Data Models

  • Simulation


Data models l.jpg
Data Models

  • Simulator calculates more than net gain




Conclusion l.jpg
Conclusion

  • Key Graphs

  • Boolean Enhanced

  • Periodic Rekeying


ad