Return to search

Protecting mobile agents against malicious hosts.

by Sau-Koon Ng. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2000. / Includes bibliographical references (leaves 100-112). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Evolution of the mobile agent paradigm --- p.1 / Chapter 1.2 --- Terminology --- p.5 / Chapter 1.3 --- Beneficial aspects --- p.7 / Chapter 1.3.1 --- Autonomy --- p.7 / Chapter 1.3.2 --- Client customization --- p.8 / Chapter 1.3.3 --- Attendant and real time interactions --- p.8 / Chapter 1.4 --- Fundamental deployment bottleneck: security concern --- p.9 / Chapter 1.4.1 --- Risking the mobile agent hosts --- p.10 / Chapter 1.4.2 --- Risking the mobile agents --- p.11 / Chapter 1.4.3 --- The difficult problem --- p.12 / Chapter 1.5 --- Contribution of this thesis --- p.13 / Chapter 1.6 --- Structure of the thesis --- p.14 / Chapter 2 --- Understanding attacks and defense --- p.15 / Chapter 2.1 --- Introduction --- p.15 / Chapter 2.2 --- Understanding attacks --- p.16 / Chapter 2.2.1 --- The meaning of an attack --- p.16 / Chapter 2.2.2 --- An abstract model of attacks --- p.17 / Chapter 2.2.3 --- A survey of various attacks --- p.21 / Chapter 2.3 --- Understanding defense --- p.25 / Chapter 2.3.1 --- The meaning of defense --- p.25 / Chapter 2.3.2 --- Security requirements of defense --- p.26 / Chapter 2.3.3 --- A survey of protection schemes --- p.28 / Chapter 2.4 --- Concluding remarks --- p.40 / Chapter 3 --- Confidentiality in mobile agent systems --- p.42 / Chapter 3.1 --- Introduction --- p.42 / Chapter 3.2 --- Motivations --- p.43 / Chapter 3.2.1 --- Program comprehension --- p.44 / Chapter 3.2.2 --- Black-box testing --- p.45 / Chapter 3.3 --- Theory --- p.46 / Chapter 3.3.1 --- Assumptions --- p.46 / Chapter 3.3.2 --- Entropy of mobile agents --- p.46 / Chapter 3.3.3 --- Intention spreading by insertion --- p.49 / Chapter 3.3.4 --- Intention shrinking by splitting --- p.52 / Chapter 3.3.5 --- Nested spreading and shrinking --- p.55 / Chapter 3.4 --- Implementation possibilities --- p.55 / Chapter 3.4.1 --- Addition of irrelevant variables and conditional statements --- p.55 / Chapter 3.4.2 --- Splitting the cost function --- p.60 / Chapter 3.5 --- Security analysis --- p.63 / Chapter 3.5.1 --- Human inspection --- p.63 / Chapter 3.5.2 --- Automatic program comprehension --- p.64 / Chapter 3.6 --- Related work --- p.66 / Chapter 3.6.1 --- Time limited blackbox security --- p.66 / Chapter 3.6.2 --- Computing with encrypted function --- p.66 / Chapter 3.7 --- Applicability --- p.67 / Chapter 3.8 --- Further considerations --- p.68 / Chapter 3.8.1 --- Weaknesses --- p.68 / Chapter 3.8.2 --- Relationship with other approaches --- p.69 / Chapter 3.8.3 --- Further development --- p.71 / Chapter 3.9 --- Concluding remarks --- p.71 / Chapter 4 --- Anonymity in mobile agent systems --- p.73 / Chapter 4.1 --- Introduction --- p.73 / Chapter 4.2 --- Solutions to anonymity --- p.74 / Chapter 4.2.1 --- Mixing --- p.75 / Chapter 4.2.2 --- Group signatures --- p.76 / Chapter 4.3 --- Anonymous agents --- p.78 / Chapter 4.3.1 --- Anonymous connection --- p.78 / Chapter 4.3.2 --- Anonymous communication --- p.79 / Chapter 4.4 --- Concluding remarks --- p.84 / Chapter 5 --- Open issues --- p.86 / Chapter 5.1 --- Introduction --- p.86 / Chapter 5.2 --- Security issues --- p.86 / Chapter 5.2.1 --- Reachable problems --- p.87 / Chapter 5.2.2 --- Difficult problems --- p.88 / Chapter 5.3 --- Performance issues --- p.88 / Chapter 5.3.1 --- Complexity and strength --- p.89 / Chapter 5.3.2 --- An optimizing protocol --- p.90 / Chapter 5.4 --- Concluding remarks --- p.94 / Chapter 6 --- Conclusions --- p.96

Identiferoai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_323047
Date January 2000
ContributorsNg, Sau-Koon., Chinese University of Hong Kong Graduate School. Division of Information Engineering.
Source SetsThe Chinese University of Hong Kong
LanguageEnglish, Chinese
Detected LanguageEnglish
TypeText, bibliography
Formatprint, xi, 112 leaves : ill. ; 30 cm.
RightsUse of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Page generated in 0.0026 seconds