| Preface | 5 |
---|
| Organization | 6 |
---|
| Table of Contents | 13 |
---|
| PART I ICE-B | 16 |
---|
| Towards Automated Service Trading | 17 |
| Introduction | 17 |
| Conceptual Framework | 18 |
| Trading | 20 |
| Discovery | 20 |
| Information | 21 |
| Selection | 22 |
| AgreementMaking | 22 |
| Binding | 23 |
| Related Work | 24 |
| Conclusions and Future Work | 27 |
| References | 28 |
| SAGA: An Adaptive Infrastructure for Secure Available GRID on Ad-Hoc Networks | 29 |
| Introduction | 29 |
| Adaptive Infrastructure | 31 |
| Adaptive Grid Behaviour | 33 |
| Predictive Infrastructure Modification | 34 |
| Reactive Infrastructure Modification | 34 |
| Secure Infrastructure | 36 |
| SAGA Application | 38 |
| Conclusions | 40 |
| References | 40 |
| Variable Quantity Market Clearing Algorithms | 42 |
| Introduction | 42 |
| Preliminaries | 44 |
| Model | 44 |
| Goals | 44 |
| Analysing Efficiency | 45 |
| Quantity Clearing Algorithms | 46 |
| Algorithm 1 | 46 |
| Algorithm 2 | 47 |
| Algorithm 3 | 48 |
| Algorithm 4 | 48 |
| Algorithm 5 | 48 |
| Algorithm 6 | 49 |
| Comparison | 49 |
| Conclusions | 52 |
| References | 53 |
| Modeling the Dynamics of Social Networks | 54 |
| Introduction | 54 |
| System-Theoretic Framework | 56 |
| When the Power Law? | 59 |
| Modeling the Dynamics of Social Networks | 60 |
| Experiment 1 | 60 |
| Experiment 2 | 61 |
| Discussion | 62 |
| Conclusions | 64 |
| References | 65 |
| Reputation Management Service for Peer-to-Peer Enterprise Architectures | 66 |
| Introduction | 66 |
| Reputation Management in Role-Based Peergroups | 67 |
| Analytical Model | 68 |
| Four-Role Configuration Example | 70 |
| Emulation Results | 72 |
| Related Work | 74 |
| Conclusions | 77 |
| References | 77 |
| A New Approach for the Trust Calculation in Social Networks | 78 |
| Introduction | 78 |
| Literature Review | 80 |
| Trust Function | 81 |
| Evaluation of the Yu Trust Function | 82 |
| Modification of the Trust Function | 84 |
| Results | 86 |
| Conclusions | 89 |
| References | 90 |
| PART II SECRYPT | 92 |
---|
| Spoofed ARP Packets Detection in Switched LAN Networks | 93 |
| Introduction | 93 |
| Related Work | 94 |
| Background | 95 |
| ARP Protocol | 95 |
| ARP Cache | 95 |
| ARP Cache Poisoning Attack | 96 |
| Static ARP Cache Update | 96 |
| Dynamic ARP Cache Update | 96 |
| The MiM Attack | 97 |
| Detection of MiM Attack | 98 |
| Detection of Hosts with Enabled IP Packet Routing | 98 |
| Detection of ARP Cache Poisoning Attack | 100 |
| The AntiMiM Application | 101 |
| Network Performance Analysis | 102 |
| Conclusions | 102 |
| References | 103 |
| Efficient All-or-Nothing Encryption Using CTR Mode | 104 |
| Introduction | 104 |
| All-or-Nothing Transforms | 105 |
| Definitions | 105 |
| Applications | 105 |
| Constructions | 106 |
| CTRT-CTR Encryption | 106 |
| Package Transform | 106 |
| CTR Transform | 107 |
| CTRT-CTR Mode | 107 |
| Latency Considerations | 108 |
| Efficient All-or-Nothing Encryption | 109 |
| Applications | 110 |
| Proofs of Security | 111 |
| Existing Security Results | 111 |
| Security of AONT-CTR Encryption | 112 |
| Security of Efficient AONT-CTR Encryption | 115 |
| Conclusions | 116 |
| References | 117 |
| Proposals for Iterated Hash Functions | 119 |
| Introduction | 119 |
| Properties of Existing Constructions | 120 |
| The Davies-Meyer Construction | 120 |
| The
|