secure internet chat
Download
Skip this Video
Download Presentation
Secure Internet Chat

Loading in 2 Seconds...

play fullscreen
1 / 16

Secure Internet Chat - PowerPoint PPT Presentation


  • 435 Views
  • Uploaded 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

Secure Internet Chat

How to make talking online more secure.

group key distribution
Group Key Distribution
  • Relation to 2 Party Key Exchange
  • Importance
    • 4 of 23 Evans Lectures
    • Lacking Analysis
  • Static/Dynamic Membership
simple system star
Simple System: Star
  • n Member Keys, Ki
  • 1 Common Key, KGroup

1

2

8

3

S

7

4

6

5

star join
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
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
Basic Rekeying Schemes
  • N-Party Diffie-Hellman
  • MIIA
  • Star Graph
  • Key Graph
key graph
Key Graph

SK

K2

K2

K1

K1

K1

K1

K0

K0

key graph member join
Key Graph - Member Join

SK

K2

K2

K1

K1

K1

K1

K0

K0

key graph member leave
Key Graph - Member Leave

SK

K2

K2

K1

K1

K1

K1

K0

K0

several members leave
Several Members Leave

SK

K2

K2

K1

K1

K1

K1

K0

boolean key function minimization
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
How to Analyze?
  • Average Case
    • Bandwidth
    • Computation
    • Storage
  • Data Models
  • Simulation
data models
Data Models
  • Simulator calculates more than net gain
conclusion
Conclusion
  • Key Graphs
  • Boolean Enhanced
  • Periodic Rekeying
ad