Methodology of risk assessment in mobile agent system design
The DOI matches its Crossref record; 12 of the 15 references it cites were found in a registry or an index.
Abstract
In mobile agent systems, depending on their purpose, various paths may be taken to provide security based on the vulnerability of the features. With widespread information sharing between potential system breakers ranging from amateur hackers to professional crackers, system security features are tested every day. As evident from frequent break-ins, security is often proven either inefficient or nonexistent. Clearly, a pragmatic methodology of determining the system security requirements is needed. The purpose is two-fold. First, we catalog and classify numerous security techniques and practices for mobile agent systems. We also provide the definitions and describe implementations of security features relevant to mobile agent systems. Additionally, we measure their impact on agent system design and performance. The second purpose is to illustrate the discussed methodology in the context of DOORS, a mobile agent system developed by us for network performance data collection. We discuss which security features are suitable for DOORS and how they impact the performance of the DOORS system.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“McLean et al. presented a new method that identifies the risks that surround mobile agent systems [251].”
From Robotics cyber security: vulnerabilities, attacks, countermeasures, and recommendations (2022) · cites this paper as [251]
Citations
Cites
Software engineering: A practitioner's approach
(1983) · Advances in Engineering Software (1978) · doi:10.1016/0141-1195(83)90118-3 · Cited by 8,234
Greenberg, M. S., Byington, L. C., & Harper, D. G. (1998) · IEEE Communications Magazine · doi:10.1109/35.689634 · Cited by 416 · cited 2×
“Most notabley, agents are programmed in universal, or machine-independent languages such as Tcl or Java [8], though forms of agent systems written in C and C++ exist in minor numbers yet provide less inter-platform robustness.”
BackgroundYokoo, M., & Suzuki, K. (2002) · Adaptive Agents and Multi-Agents Systems · doi:10.1145/544741.544770 · Cited by 93 · cited 2×
“[28] M.”
BackgroundAgents on the move [mobile software agents]
Morreale, P. A. (1998) · IEEE Spectrum · doi:10.1109/6.666958 · Cited by 63
The computational complexity of agent design problems
Wooldridge, M. (2002) · International Conference on Multi Agent Systems · doi:10.1109/icmas.2000.858472 · Cited by 39 · cited 2×
“[26] M.”
BackgroundA Mobile Agent Brokering Environment for the Future Open Network Marketplace
Chieng, D. H. T., Ho, I. W., Marshall, A., & Parr, G. P. (2000) · Lecture notes in computer science · doi:10.1007/3-540-46525-1_1 · Cited by 20 · cited 2×
“[4] D.”
BackgroundThe Computational Complexity of Agent Verification
Wooldridge, M., & Dunne, P. E. S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45448-9_9 · Cited by 19 · cited 1×
“Agents are autonomous, mobile programs with variable levels of complexity [26, 27], depending on their role.”
BackgroundAn Agent-Based Architecture for Generating Interactive Stories
Osborn, B. (2002) · Cited by 9
Modeling robot swarms using agent-based simulation
Dickie, A. J. (2002) · Defense Technical Information Center (DTIC) · Cited by 8
Introduction to Mobile Agent Systems and Applications
Nebesh, D., & Tarr, R. (2000) · Technology of Object-Oriented Languages and Systems · Cited by 6
Computing twin primes and Brun's constant: a distributed approach
Fry, P. H., Nesheiwat, J., & Szymanski, B. K. (2002) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1109/hpdc.1998.709953 · Cited by 6 · cited 2×
“[6] P.”
MethodSelf-citationExperiences with distributed computation of twin primes distribution
Fry, P. H., Nesheiwat, J., & Szymanski, B. K. (2001) · doi:10.12694/scpe.v2i3.141 · Cited by 1 · cited 1×
“Also, this approach typically models advanced distributed computing practices such as the SETI distributed computation model, RPI's twin enumeration project [6, 7], and Beauwolf Clusters allowing for compiling or calculating a portion of complex code.”
MethodSelf-citation
Research works printed but not linked: 6
- sundsted, 1998, Agents on the move, Java World
- fisch, 2000, Secure Computers and Networks Analysis Design and Implementation
- 1998, FM 100–14 Risk Management
- bivens, 1999, Agent-based network monitoring, Agent based High Performance Computing
- sundsted, 1998, Agents talking to agents, Java World
- sundsted, 1998, Agents can think too!, Java World
Cited by
Robotics cyber security: vulnerabilities, attacks, countermeasures, and recommendations
Yaacoub, J.-P. A., Noura, H. N., Salman, O., & Chehab, A. (2022) · International Journal of Information Security · doi:10.1007/s10207-021-00545-8 · Cited by 320
“presented a new method that identifies the risks that surround mobile agent systems [251].”
Analyzing Cyber-Physical Threats on Robotic Platforms
Ahmad Yousef, K., AlMajali, A., Ghalyon, S., Dweik, W., & Mohd, B. (2018) · Sensors · doi:10.3390/s18051643 · Cited by 42
“McLean et al. [42] described a method for identifying the risks involved with mobile agent systems through a “Risk Management” approach.”
MethodAbeykoon, I., & Feng, X. (2019) · IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI) · doi:10.1109/smartworld-uic-atc-scalcom-iop-sci.2019.00299 · Cited by 12
Risk assessment management for mobile payment security
DaiHong, Zhong, R., & LanTian (2008) · IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI) · doi:10.1109/soli.2008.4682854 · Cited by 3
Simulating protein computing: character recognition via probabilistic transition trees
Eichelberger, C. N., & Najarian, K. (2006) · IEEE International Conference on Granular Computing (GrC) · doi:10.1109/grc.2006.1635766 · Cited by 2
“This asynchronous, readily-recombined processing power, of course, very much resembles some of the significant problems in sensor networking, where there are meaningful contributions to be made [5][6][7].”
Background
Metadata
- Authors
- McLean, I., Szymanski, B., & Bivens, A.
- Affiliations
- Rensselaer Polytechnic Institute (US)
- ORCID
- Szymanski, B.
- Venue
- IEEE Systems, Man and Cybernetics SocietyInformation Assurance Workshop, 2003.
- Publisher
- IEEE
- Published
- 2004-02-03
- Pages
- 35-42
- OpenAlex
- W2116914385
- Cited by
- 6
- References
- 15
- Citations by year
- 2021: 1 · 2019: 1 · 2018: 1
- FWCI
- 0.16
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE Systems, Man and Cybernetics Information Assurance Workshop (IAW) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Agent-Based Network Management
- Physical Sciences › Computer Science › Hardware and Architecture › Security and Verification in Computing
- Physical Sciences › Computer Science › Information Systems › Information and Cyber Security
- Keywords
- mobile agent systems, risk assessment, system security, security requirements, security techniques, security features, doors
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.