This book presents initial steps towards creating secure systems that overcome attacks through adaptation. It provides a model explaining mobile code and methods for designing robust peer-to-peer networks. Methods are provided for implementing adaptive systems designed to tolerate many current attacks. After early chapters providing background on computer security, the book describes recent advances in relevant technology, and provides results from research programs. Author information is not given. Annotation c2004 Book News, Inc., Portland, OR
Author(s): R.R. Brooks
Edition: 1
Publisher: CRC Press
Year: 2004
Language: English
Pages: 378
City: Boca Raton
Disruptive Security Technologies with Mobile Code and Peer-to-Peer Networks......Page 2
Dedication......Page 4
Preface......Page 5
ACKNOWLEDGEMENT AND DISCLAIMER......Page 6
Table of Contents......Page 7
References......Page 1
References......Page 11
CHAPTER 1: Overview......Page 12
References......Page 15
CHAPTER 2: Network Security Problems......Page 16
1. VULNERABILITIES......Page 18
2. ATTACKS......Page 22
3. THREAT MODELING......Page 24
4. PHYSICAL SECURITY......Page 25
5. SOCIAL ENGINEERING......Page 27
7. FRAUD......Page 28
8. SCAVENGING......Page 29
10. TRAPDOORS......Page 30
11. VIRUSES......Page 31
12. WORMS......Page 33
14. COVERT COMMUNICATIONS CHANNELS......Page 35
15. BUFFER OVERFLOW AND STACK SMASHING......Page 37
16. DENIAL OF SERVICE......Page 39
17. DISTRIBUTED DENIAL OF SERVICE......Page 40
20. CRYPTANALYSIS......Page 41
21. DNS AND BGP VULNERABILITIES......Page 42
References......Page 44
1. AUDITS......Page 45
2. ENCRYPTION......Page 46
4. OBFUSCATION......Page 48
5. PUBLIC KEY INFRASTRUCTURE......Page 50
6. CODE SIGNING......Page 51
8. FORMAL METHODS......Page 52
9. VIRUS SCANNERS......Page 53
10. ATTACK GRAPHS......Page 54
11. SECURITY AUTOMATA......Page 56
13. FIREWALLS......Page 57
15. PROOF CARRYING CODE......Page 58
16. SECURE HARDWARE......Page 59
17. DEPENDABILITY, SAFETY, LIVENESS......Page 60
18. QUALITY OF SERVICE......Page 63
19. ARTIFICIAL IMMUNE SYSTEMS......Page 64
20. EXERCISES......Page 65
References......Page 66
CHAPTER 4: Disruptive Technologies......Page 67
1. MOBILE CODE......Page 68
2. PEER-TO-PEER NETWORKS......Page 71
3. FIELD PROGRAMMABLE GATE ARRAYS......Page 73
4. ADAPTATION......Page 74
A. CONTINUOUS MODELS......Page 77
B. DISCRETE MODELS......Page 79
6. EXERCISES......Page 81
References......Page 82
CHAPTER 5: Understanding Networks......Page 83
1. INTERNET PROTOCOL BACKGROUND......Page 84
A. SENSOR NETWORKS......Page 87
B. BACnet......Page 90
3. NETWORK TOPOLOGY......Page 91
A. ERDÖS-RÉNYI RANDOM GRAPH......Page 92
B. SMALL WORLD GRAPHS......Page 94
4. SCALE-FREE GRAPHS......Page 95
A. AD HOC WIRELESS NETWORKS......Page 96
B. CELL PHONE GRIDS......Page 97
5. TRAFFIC FLOWS......Page 98
6. CONCLUSION......Page 103
References......Page 104
1. EXISTING PARADIGMS......Page 105
2. EXISTING IMPLEMENTATIONS......Page 107
3. THEORETICAL MODEL......Page 108
4. SIMULATOR FOR MODEL......Page 117
A. CLIENT-SERVER......Page 119
B. REMOTE EVALUATION......Page 123
D. PROCESS MIGRATION......Page 124
F. ACTIVE NETWORKS......Page 125
6. SIMULATION STUDIES OF MODELS......Page 126
A. CLIENT-SERVER......Page 127
B. REMOTE EVALUATION......Page 129
C. CODE ON DEMAND......Page 130
D. PROCESS MIGRATION......Page 132
E. MOBILE AGENTS......Page 134
7. MODELS OF NETWORKING PATHOLOGIES......Page 135
B. VIRUS......Page 136
A. WORM......Page 137
B. DISTRIBUTED DENIAL OF SERVICE......Page 138
9. COMPARISON OF NETWORK SIMULATIONS......Page 139
A. CANTOR UDP MODEL......Page 141
B. CANTOR TCP MODEL......Page 143
C. SIMULATION COMPARISONS......Page 144
10. TAXONOMIES OF MOBILE CODE AND SECURITY......Page 150
11. MOBILE CODE DAEMON IMPLEMENTATION......Page 155
12. CONCLUSION......Page 162
13. EXERCISES......Page 163
References......Page 164
CHAPTER 7: Protecting Mobile Code......Page 165
1. CONTROL FLOW MODIFICATION......Page 166
2. BYTECODE MODIFICATION......Page 168
3. PROTOCOL FOR EXCHANGING BYTECODE TABLES......Page 171
4. ENTROPY MAXIMIZATION OF BYTECODE MAPPINGS......Page 173
5. BYTECODE STEGANOGRAPHY......Page 183
6. USE OF SECURE COPROCESSORS......Page 187
7. CONCLUSION......Page 188
References......Page 189
CHAPTER 8: Protecting Mobile Code Platforms......Page 190
1. SMART CARD APPLICATIONS......Page 193
2. BUILDING CONTROL SYSTEMS......Page 194
3. FPGA CRYPTOGRAPHY ENGINE......Page 196
A. EXISTING IMPLEMENTATIONS......Page 198
B. PARALLEL ENCRYPTION ENGINE FOR DES......Page 201
C. PARALLEL ENCRYPTION ENGINE FOR TRIPLE DES......Page 204
D. PARALLEL ENCRYPTION ENGINE FOR AES......Page 206
E. SECURE HASH FUNCTION ENGINE......Page 208
F. ASIC IMPLEMENTATIONS......Page 210
G. COMPARISON OF PARALLEL AND PIPELINED AES......Page 211
4. DIFFERENTIAL POWER ANALYSIS......Page 214
A. SECURE INSTRUCTION SET......Page 216
B. SECURE INSTRUCTION IMPLEMENTATION......Page 218
C. DES RESULTS......Page 221
D. AES IMPLEMENTATION......Page 225
E. AES EVALUATION......Page 227
F. PARALLEL CRYPTOGRAPHY ENGINE POWER ANALYSIS......Page 228
References......Page 229
CHAPTER 9: Maintaining Trust on the Network......Page 230
1. ASSUMPTIONS AND PRIMITIVES......Page 233
2. MOBILE CODE VERIFICATION......Page 234
3. HOST VERIFICATION......Page 236
4. MULTI-LEVEL SECURITY......Page 240
5. CONCLUSIONS......Page 241
References......Page 242
CHAPTER 10: Designing Peer-to-Peer Systems......Page 243
1. GRAPH THEORY BACKGROUND......Page 244
A. ERDÖS-RÉNYI......Page 245
B. SMALL WORLD......Page 246
C. CELL PHONE GRIDS......Page 248
D. AD HOC......Page 249
E. SCALE-FREE......Page 251
3. NUMBER OF HOPS BETWEEN NODES......Page 254
A. EMPIRICAL ESTIMATE......Page 255
B. ANALYTICAL ESTIMATE......Page 259
4. DEPENDABILITY OF PEER-TO-PEER SYSTEMS......Page 261
5. VULNERABILITY TO ATTACK......Page 266
6. QUALITY OF SERVICE OF PEER-TO-PEER SYSTEMS......Page 267
A. ANALYTICAL EXPRESSION FOR DELAY......Page 269
B. ANALYTICAL EXPRESSION FOR JITTER......Page 271
C. ANALYTICAL EXPRESSION FOR LOSS PROBABILITY......Page 273
D. QUEUING MODEL......Page 274
E. COMPARISON WITH SIMULATIONS......Page 276
7. CORRECT NUMBER OF INDEXES......Page 277
8. KEY MANAGEMENT......Page 280
9. CONCLUSION......Page 288
References......Page 289
1. AD HOC DATA ROUTING BACKGROUND......Page 290
2. SPIN GLASS ROUTING......Page 294
3. MULTIFRACTAL ROUTING......Page 297
4. PHEROMONE ROUTING......Page 300
5. COMPARISON OF ROUTING ALGORITHMS......Page 310
6. EPIDEMIC RESOURCE DISCOVERY......Page 312
7. CONCLUSION......Page 320
References......Page 321
1. DENIAL OF SERVICE (DoS) BACKGROUND......Page 322
2. TRAFFIC FLOW MEASURES......Page 325
3. ATTACK DETECTION......Page 326
4. VERIFICATION OF DETECTOR......Page 331
5. GAME THEORY ANALYSIS......Page 350
6. NETWORK STRUCTURE VULNERABILITIES......Page 352
References......Page 357
CHAPTER 13: Conclusion......Page 358
Table of Contents......Page 360
References......Page 361
