1. April 11 2002Master Project Presentation1 Security Issues for Stigmergic Systems Weilin Zhong

2. April 11 2002Master Project Presentation2 Swarm Intelligence

3. April 11 2002Master Project Presentation3 Swarm Intelligence How can simple individuals achieve complex group behaviors? Intelligence lies in Interactions Direct Interaction Indirect Interaction – Stigmergy

4. April 11 2002Master Project Presentation4 Biological Stigmergy Example Ant Foraging Model

5. April 11 2002Master Project Presentation5 Stigmergic Systems Examples: Network Routing Problems[DiCaro98] Peer-to-Peer network framework[Montresor01] Distributed Intrusion and Response Systems[Fenet01] Terrain Coverage[Koenig01] Desirable Characteristics for Survivability Adaptive Decentralized Emergent (Collaborative Group Behaviors)

6. April 11 2002Master Project Presentation6 Stigmergic Systems - Security Challenges Open-hostile environment No Centralized Control Limited Computational Power AntNet Security 1. What’s AntNet ? 2. Threats and Attacks 3. Defenses

7. April 11 2002Master Project Presentation7 AntNet AntNet[DiCaro98] An Adaptive Routing Algorithm Inspired by the stigmergy model in ant foraging Mobile Multi-Agent Systems - Ants

8. April 11 2002Master Project Presentation8 AntNet Probabilistic Routing Table 0 1 2 3

9. April 11 2002Master Project Presentation9 AntNet 1 2 3 4 T 4->4 =0 T 3->4 =L(3,4)+ T 4->4 T 2->4 =L(2,3)+ T 3->4 T 1->4 =L(1,2)+ T 2->4 (N1) (N1, N2) (N1,N2,N3)(N1, N2, N3, N4)

10. April 11 2002Master Project Presentation10 AntNet: Threats and Attacks Threats – Compromised Nodes Untrustworthy Hosts Compromised Link Attack Goals Increase packet latency Decrease Overall Network Throughput Break down a critical node or link Divert packets from certain links

11. April 11 2002Master Project Presentation11 Attack Classes 1. Fabricating Ant Packets 2. Dropping Ant Packets 3. Tampering With Ant Packets

12. April 11 2002Master Project Presentation12 Fabrication Attack Fabrication Inject bogus ants Replay ants Attack Simulation ( 0234,1.6ms) … ( 0234,4.8ms) (0) (01) (014) (014,0ms) (014,1.6ms) (014,3.2ms) (0)(02)(023) (0234) ( 0234,0ms) ( 0234,3.2ms) ( 0234,4.8ms)

13. April 11 2002Master Project Presentation13 Fabrication -- Defense Unique Identifier ID Checking and Time out Defense Simulation

14. April 11 2002Master Project Presentation14 (01) Dropping Attacks Dropping Ants Network Failure Location Limitation Simulation Results (02345,6.4ms) (0) (01) (0)(02)(023)(0234)(02345) (02345,0ms)(02345, 1.6ms)(02345,3.2ms)(02345,4.8ms)

15. April 11 2002Master Project Presentation15 Tampering Attacks Tampering With Path Information Trip Time Information Attack Simulation (0234,0ms)(0234,1.6ms) (0234,0ms) (0234,1.6ms) (0) (01) (014) (014,1.6ms) (014,3.2ms) (02)(0)(023)(0234) (014,0ms)

16. April 11 2002Master Project Presentation16 Tampering Attacks - Locality 0 1 2 3 4 5 Locality of Damages

17. April 11 2002Master Project Presentation17 Tampering Attacks - Locality Locality of Damagess 0 1 2 3 4 5 (0) (01) (014) (014,0ms) (014,1ms) (014,2ms) (0)(02)(023)(0234) (0234,0ms)(0234,1ms) (0234,0ms)(0234,1ms)

18. April 11 2002Master Project Presentation18 Tampering Attacks - Locality Locality of Damagess 0 1 2 3 4 5 (0) (01) (014) (014,0ms) (014,1ms) (014,2ms) (0)(02)(023)(0234) (0234,0ms) (0234,1ms)(0234,2ms)(0234,0ms)

19. April 11 2002Master Project Presentation19 Tampering Attacks - Locality Locality of Damagess 0 1 2 3 4 5 (0) (01) (014) (014,0ms) (014,1ms) (014,2ms) (0)(02)(023)(02354) (02354,0ms) (02354,2ms) (02354,3ms) (0235) (02354,0ms)(02354,1ms)

20. April 11 2002Master Project Presentation20 Tampering Attacks - Locality Critical Region s D External Node Internal Node

21. April 11 2002Master Project Presentation21 Tampering Attack -- Defense Adapted based on [Murphy96, Smith96], Cryptographic Solution {n, A, B}S A {n, B, C}S B {n, A, B}S A {n, C, D}S C {n, B, C}S B {n, A, B}S A {X}S K : X signed by node K {n, ABCD,0}S D {n, C, D}S C {n, B, C}S B {n, A, B}S A {n, ABCD,0}S D {n, C, D, T CD }S C {n, ABCD,0}S D {n, C, D, T CD }S C {n, B, C, T BC }S B {n, ABCD,0}S D {n, C, D, T CD }S C {n, B, C, T BC }S B {n, A, B, T AB }S A

22. April 11 2002Master Project Presentation22 Tampering Attack -- Defense Lightweight Solutions – Verification Ants S D T = (T2 – T1) /2 T = (T2’ – T1) T2 T2’ {T 1 } {T 1 }S D

23. April 11 2002Master Project Presentation23 Summary Stigmergic Systems: two-fold factors for security offer useful properties for security: adaptive, decentralized. offer new opportunities for attackers and challenge traditional security mechanisms AntNet Security: Resilient to most attacks with simple defense methods Use unique ids to prevent fabrication attacks Dropping and tampering attacks are only effective for malicious nodes on the only path Cryptographic techniques usage can be limited by the locality property