Trust and security in collaborative computing

Contents......Page 12
Preface......Page 8
Acknowledgments......Page 10
List of Figures......Page 16
List of Tables......Page 18
1.1 Overview of Trusted Collaborative Computing......Page 20
1.2 Basic Concepts in Terms of Security......Page 22
1.3 Basic Concepts in Terms of Reliability......Page 28
1.4 Abbreviations and Notations......Page 34
1.5 Outline......Page 32
2.1 Overview of Secure Group Communication (SGC)......Page 36
2.2 Typical Group Key Management Schemes for SGC......Page 38
2.2.1.1 Key Tree (Logical Key Hierarchy)......Page 39
2.2.1.2 Other Proposed Schemes......Page 43
2.2.2.1 Iolus......Page 45
2.2.2.2 Other Proposed Schemes......Page 47
2.2.3.1 Tree based Group Di.e-Hellman Key Agreement......Page 48
2.2.3.2 Other Proposed Schemes......Page 50
2.2.4 Distributed Group Key Distribution......Page 51
2.2.4.1 DGKD......Page 52
2.3.1 SGC for Wireless and Mobile Ad Hoc Networks......Page 54
2.3.1.1 CRTDH......Page 55
2.3.1.2 Other Proposed Schemes......Page 56
2.3.2 Authenticated Key Exchange (AKE)......Page 57
2.3.2.1 AUTH-CRTDH......Page 58
2.3.2.2 Other Proposed Schemes......Page 62
2.3.3.1 Self-Healing based on Polynomials and Secret Sharing......Page 63
2.3.3.2 Other Proposed Schemes......Page 65
2.3.4.1 BF-TGDH......Page 67
2.3.5.1 KTDCKM-SDC......Page 71
2.3.5.2 Other Proposed Schemes......Page 74
2.4 Conclusion......Page 75
3.1 Overview of Access Control in Collaborative Computing......Page 78
3.2.1 System Description and Initialization......Page 83
3.2.2 System Dynamics and Maintenance......Page 86
3.2.3 Discussion......Page 87
3.3.1 HACModel......Page 90
3.3.2 Directly Dependent Key Schemes......Page 92
3.3.4 Polynomial and Interpolation based Schemes......Page 94
3.3.5 An E.cient CHAC Scheme with Locality......Page 96
3.4 A Uniform CHAC Scheme Based on Access Polynomials......Page 98
3.4.2 Key Computation/Derivation......Page 99
3.4.3 Node/Vertex Level Dynamics......Page 100
3.4.4 User Level Dynamics......Page 101
3.4.5 Security and Performance Analysis......Page 102
3.4.5.1 Security Analysis......Page 103
3.4.5.2 Performance Analysis......Page 105
3.4.6 An Illustrative Example and Experiment Results......Page 106
3.4.7 Discussion......Page 109
3.4.7.1 Enforcement of Other Access Models......Page 112
3.5 Conclusion......Page 113
4.1 Overview of Intrusion Detection and Defense......Page 114
4.2 Intruding Attacks......Page 115
4.3 Intrusion DetectionModels......Page 117
4.3.1 AnomalyModeling......Page 119
4.3.2 MisuseModeling......Page 120
4.3.3 Specification Modeling......Page 121
4.4 Intrusion Response......Page 123
4.5.1.1 DoS Flooding Attacks......Page 124
4.5.1.2 Redirection Attacks......Page 127
4.5.1.3 Service Exploits......Page 128
4.5.2 Distributed Denial of Service (DDoS) Attacks......Page 129
4.5.2.1 DDoS Attack Steps......Page 130
4.5.2.2 DDoS Tools......Page 132
4.6.1 Single-node Defending Method......Page 134
4.6.2.1 Path Identi.cation......Page 135
4.6.3 Honeypot......Page 137
4.7 Defending against DoS/DDoS Attacks–Traceback......Page 138
4.7.1 ICMP Traceback.......Page 140
4.7.2 (Probabilistic) IP Packet Marking......Page 141
4.7.3 Hash Based Traceback......Page 142
4.7.4.1 Distributed Linked List Traceback (DLLT)......Page 143
4.7.4.2 Probabilistic Pipelined Packet Marking (PPPM)......Page 144
4.7.5 Intrusion Detection and Traceback in Wireless Networks......Page 145
4.7.6 Pushback......Page 146
4.8.1 Best Practice Methods......Page 147
4.8.3 Netbouner......Page 149
4.8.5 SIFF......Page 150
4.8.7 PacketScore......Page 151
4.8.8 Speak-Up......Page 152
4.9 Secure Overlay Service (SOS)......Page 153
4.10 Conclusion......Page 155
5.1 Overview of Reliability in Grid Computing......Page 156
5.2.1 Description of the Grid Computing......Page 158
5.2.2 Failure Analysis of Grid Service......Page 160
5.2.3 Grid Service Reliability and Performance......Page 161
5.2.4 Grid Service Time Distribution and Indices......Page 163
5.3.1 Universal Generating Function......Page 166
5.3.2 Illustrative Example......Page 170
5.4 Tree Topology Grid Architecture......Page 174
5.4.1.1 Minimal Task Spanning Tree (MTST)......Page 175
5.4.1.2 pmf of the Task Execution Time......Page 177
5.4.2 Illustrative Example......Page 178
5.4.2.3 List of MTST Elements......Page 179
5.4.2.4 pmf of Task Completion Time......Page 180
5.4.3 Parameterization and Monitoring......Page 182
5.5 Conclusion......Page 184
6.1 Overview of Security in Grid Computing......Page 186
6.2 Existing Research on Grid Computing Security......Page 188
6.3 Secure Grid Communication and Controlled Resource Sharing in Grid Computing......Page 192
6.4.1 First Level......Page 194
6.4.3 Combination of Two Levels......Page 196
6.4.4.1 Security Analysis......Page 197
6.4.4.2 Complexity Analysis......Page 199
6.5 Secure Grid Computing by DLKM......Page 203
6.5.1 Access Local Resources......Page 204
6.5.3 Data Grid......Page 205
6.5.5 An Illustrative Example......Page 207
6.5.5.1 Initialization......Page 208
6.5.5.2 Illustration of DLKM for a Grid Service......Page 210
6.6 Conclusion......Page 211
7.1 Overview of Trusted and Seamless Medical Information Systems......Page 212
7.2 Health Information Technology and Medical Information System......Page 214
7.3 Architecture of the Proposed Secure MIS......Page 216
7.3.1 System Architecture......Page 217
7.3.2 Security Functions Supported by ACP......Page 218
7.3.3 Tele-medicine Service .......Page 220
7.3.4 Additional Features Resulting from the ACP Mechanism......Page 221
7.4 Dependable MIS based on Grid Computing Technology......Page 222
7.5 Conclusion......Page 224
Bibliography......Page 226
Index......Page 244