Securing Mobile Agents Migration Using Tree Parity Machine with New Tiny Encryption Algorithm

The total processing time may vary according to the order of visit when a mobile agent is sequentially migrated to another node. An effective migration algorithm is one in which the processing time is kept to its minimum from the initial state to the destination state by ordering the process. The total time spend for the process can be minimized by adopting an effective migration algorithm. Existing mobile agents such as Aglets, Voyager, and Odyssey do not guarantee the effectiveness by not taking the status of the network and the node to be moved into upon the migration. This paper proposes AMIS as the method used for the migration of the mobile agent. AMIS minimizes the total migration time of the mobile agent, and provides a firm and safe order for the migration of the mobile agent.

For mobile agent, it can only be performed under trusted environment if there is no proper security. It can not be performed in the Internet due to the high risks. There are too many security issues in Internet. For example, some malicious servers or programs which attack or steal our server or original data. Hence, this paper proposes a mobile agent application of E-commerce system and some authentication mechanisms for the system that include authentication of the legality of servers in E-commerce, authentication of the legality of mobile agents, and the verification of attacks on servers and mobile agents. By applying mobile agent and encryption/ decryption technologies, this paper will introduce how coordinator server establishes authentication mechanisms, and the authentication between servers, as well as how coordinator server verifies that each server is attacked or not? Meanwhile, this paper also introduces the authentication between: (1) buyer/ seller and server, (2) mobile agent and server, as well as the verification of attacks on mobile agent. Finally, this paper focuses on protecting and verifying the data that are collected by mobile agent, to ensure the data's integrity, authentication, non-repudiation, confidentiality and availability, so as to achieve the targets of data security mechanism.

Mobile agent systems provide new perspectives for distributed e-commerce applications. These applications may present specific restrictions, making mobile agent systems a feasible solution. Even so, mobile agents present some security related problems. An important one is resource access control. The ability for mobile agents to provide a simple, scalable, flexible, and secure access control system is a key point for the widespread adoption of mobile agents. In this paper we propose a mechanism to safely assign roles to mobile agents and an access control method based on Role-based Access Control (RBAC). The access control method provides a simple, lightweight and distributed model for mobile agent applications. It is proposed as an extension of the MARISM-A (An Architecture for Mobile Agents with Recursive Itineraries and Secure Migration) project, a secure mobile agent platform.

The speed and convenience of the Internet facilitated the development of electronic commerce (e-commerce). E-commerce research and technologies have always drawn the attention of researchers. Among them, the application of mobile agent on e-commerce has drawn much attention in recent years. Mobile agents can roam freely over different execution environments to execute tasks assigned to them. However, a mobile agent may be attacked when it requests services from other servers or when comes in contact with and exchange information with another agents while roaming on the internet. Hence, a mobile agent user may be concerned that his mobile agent could be corrupted or private information tapped and pirated by other agents. To ensure the security of mobile agents in public network environment, this paper proposes a security scheme that is suitable for mobile agents. The scheme includes access control and key management; it is also an improvement on the key management and access control for mobile agent scheme of Volker and Mehrdad. The proposed scheme corrects the drawback in Volker and Mehrdad’s scheme which is the need of a large amount of storage for storing the secret keys. Security and performance analysis of our scheme proves the proposed scheme to be more efficient and secure.KeywordsAccess ControlHash FunctionMobile AgentPublic ParameterAccess Control SchemeThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Time Efficient Optimal Tunning through Various Learning Rules in Unify Computing (TEOTLRUC)

This article presents an approach for inter-agent communication and inter-platform agent migration based on IEEE FIPA (Foundation for Intelligent Physical Agents) Agent Communication Language (ACL) messages. The promising features of IEEE FIPA standards that support open, flexible, and interoperable agent communication and migration are discussed in the paper. Messages for agent communication and migration, platform architecture that deliver and manage these messages, and the main procedure of processing a mobile agent message are also introduced. An application example, in which a mobile agent visits multiple hosts and travels via mobile agent messages, simulates a mobile agent for remote data processing. This example shows the feasibility, simplicity, and openness of the presented approach for mobile agent migration. Using FIPA ACL messages for agent migration in FIPA compliant agent systems simplifies agent platform, reduces development effort, and easily achieves inter-platform migration through well-designed communication mechanisms provided in the agent platform.

A mobile agent is a software program which migrates from a site to another site to perform tasks assigned by a user. For the mobile agent system to support agents in various application areas, the issues regarding reliable agent execution, as well as compatibility between two different agent systems or secure agent migration, have been considered. Some of the proposed schemes are either replicating the agents (Hamidi & Mohammadi, 2005) or check-pointing the agents (Park, Byun, Kim, & Yeom, 2002; Pleisch & Schiper, 2001;) For a single agent environment without considering inter-agent communication, the performance of the replication scheme and the check-pointing scheme is compared in Park et al. (2002) and Silva, Batista, and Silva (2000). In the area of mobile agents, only few works can be found relating to fault tolerance. Most of them refer to special agent systems or cover only some special aspects relating to mobile agents, such as the communication subsystem. Nevertheless, most people working with mobile agents consider fault tolerance to be an important issue (Izatt, Chan, & Brecht, 1999; Shiraishi, Enokido, & Takzawa, 2003). Mobile agents are becoming a major trend for designing distributed systems and applications in the last few years and foreseeable future. It can bring benefits such as reduced network load and overcoming of network latency (Chan, Won, & Lyu, 1993). Nevertheless, security is one of the limiting factors of the development of these systems. The main unsolved security problem lies in the possible existence of malicious hosts that can manipulate the execution and data of agents (Defago, Schiper, & Sergent, 1998). Most distributed applications we see today are deploying the client/server paradigm. There are certain problems with the client/server paradigm, such as the requirement of a high network bandwidth, and continuous user-computer interactivity. In view of the deficiencies of the client/server paradigm, the mobile code paradigm has been developed as an alternative approach for distributed application design. In the client/server paradigm, programs cannot move across different machines and must run on the machines they reside on. The mobile code paradigm, on the other hand, allows programs to be transferred among and executed on different computers. By allowing code to move between hosts, programs can interact on the same computer instead of over the network. Therefore, communication cost can be reduced. Besides, mobile agent (Fischer, Lynch, & Paterson, 1983) programs can be designed to work on behalf of users autonomously. This autonomy allows users to delegate their tasks to the mobile agents, and not to stay continuously in front of the computer terminal. The promises of the mobile code paradigm bring about active research in its realization. Most researchers, however, agree that security concerns are a hurdle (Greenberg, Byington, & Harper, 1998). In this article, we investigate these concerns. First, we review some of the foundation materials of the mobile code paradigm. We elaborate Ghezzi and Vigna’s classification of mobile code paradigms (Ghezzi & Vigna, 1997), which is a collection of the remote evaluation, code on demand, and mobile agent approaches. In the next section, we address the current status of mobile code security. The following section presents the model for fault-tolerant mobile agent. In the next section, security issues of the mobile agent are discussed, and we discuss security modeling and evaluation for the mobile agent in the section after. In the following section, simulation results and influence of the size of agent are discussed. We then conclude the article.

The Internet of Things (IoT) is becoming an indispensable part of the actual Internet and continues to extend deeper into the daily lives of people, offering distributed and critical services. Mobile agents are widely used in the context of IoT and due to the possibility of transmitting their execution status from one device to another in an IoT network, they offer many advantages such as reducing network load, encapsulating protocols, exceeding network latency, etc. Also, Blockchain Technology is growing rapidly allowing for the addition of an approved security layer in many areas. Security issues related to mobile agent migration can be resolved with the use of Blockchain. This paper aims to demonstrate how Blockchain Technology can be used to secure mobile agents in the context of the IoT using Ethereum and a Smart Contract. The transactions within the Blockchain are used to detect the malevolent mobile agents that could infiltrate the IoT systems. The proposed model aims to provide a secure migration of mobile agents to ensure security and protect the IoT applications against malevolent agents. The case of a smart home with multiple applications is applied to verify the proposed solution. The model presented in this paper could be extended to a wider selection of IoT systems outside of the smart home.

This chapter focuses on the very serious problem of denial of service (DoS) attacks against computer systems and networks. DoS attacks are attacks designed to disrupt, overwhelm, and/or damage computing resources and data. These attacks are aimed not against confidentiality of data or integrity of systems and data, but rather against availability of systems and data. Attackers launch DoS attacks for a wide variety of reasons. The probability of success is high, due in large part to the fact that the Internet itself has not been designed for security. The cost of DoS attacks is often high—several well‐known attacks have reportedly cost organizations billions of dollars. Many types of DoS attacks have surfaced so far, including resource starvation attacks, buffer overflow attacks, and packet fragmentation attacks. Distributed denial of service (DDoS) attacks, attacks in which programs planted in multiple systems cooperate, represent an even higher level of threat. Preventing DoS attacks is difficult in the first place due to a plethora of reasons; limiting the potential for damage and disruption is often the most cost‐effective strategy. Hot sites, cold sites, use of uninterruptible power supplies (UPSs) and Redundant Array of Independent Drives (RAID) solutions, and other measures can limit the damage from DoS attacks. Using properly configured and maintained firewalls is one of the best single prevention measures. Additionally, using packet filters on systems, keeping up with patches, limiting services that run on these systems, and using other measures go a long way in helping prevent susceptibility to DoS attacks.

Cet article decrit, du point de vue d'un clinicien generaliste, une solution pour l'implementation de dossiers concernant les patients en toute securite, ainsi que les strategies mises en place pour cette implementation. Cet article souligne donc l'importance de la securite pour la confidentialite de ces dossiers, mais aussi la difficulte de mettre en place un systeme de protection de l'information sur

Being equipped with a millimeter-wave radar allows a low-flying helicopter to sense the surroundings in real time, which significantly increases its safety. However, nonhomogeneous clutter environments, such as a multiple target situation and a clutter edge environment, can dramatically affect the radar signal detection performance. In order to improve the radar signal detection performance in nonhomogeneous clutter environments, this paper proposes a new automatic censored cell averaging CFAR detector. The proposed CFAR detector does not require any prior information about the background environment and uses the hypothesis test of the first-order difference (FOD) result of ordered data to reject the unwanted samples in the reference window. After censoring the unwanted ranked cells, the remaining samples are combined to form an estimate of the background power level, thus getting better radar signal detection performance. The simulation results show that the FOD-CFAR detector provides low loss CFAR performance in a homogeneous environment and also performs robustly in nonhomogeneous environments. Furthermore, the measured results of a low-flying helicopter validate the basic performance of the proposed method.

Nowadays, a lot of e-Learning systems are widely deployed in educational schools. Typical e-Learning systems are implemented as client-server model. In the client-server model, the number of clients affects on the load of the server. In order to reduce the load on the server, we developed a P2P-based distributed e-Learning system. The proposed system consists of a lot of mobile agents which manage study contents and some functions such as scoring, showing questions, and correct answers. When a learner requests content, a mobile agent who has its content comes to the learner's computer, and then he/she can start the study. Here, a mobile agent has to manage multimedia data, which may be a huge size of data. Thus, a mobile agent has to migrates to the learner's node with a huge size of data. Then, the learner cannot start the study until the mobile agent finished to migrate. In order to solve this problem, we divide multimedia data into fragments and prepare mobile agents which manages each fragments. Since each mobile agents become small, a learner can start the study soon without waiting for the migration of a mobile agent which has a huge size of multimedia data. We, however, have to search a mobile agent which manages their fragments. Therefore, a mobile agent which manages n-th fragments informs its location to the agent which manages (n+1)-th fragments, and vice versa. Since each agent knows the location of a mobile agent which manages next and previous fragment, and fragments are cached into learner's node, a learner can play multimedia data smoothly without finding the location of mobile agent which manages holding next fragment. Experiment results show the effectiveness of our method.

The security of mobile agents, which are autonomous software entities capable of migrating between computers to execute tasks, remains a critical concern in modern information technology. Cybersecurity has been a central component of this technological revolution and continues to be one of the most essential requirements for any software or platform. Despite advances in security measures, protecting mobile agents, particularly those carrying sensitive data, while they transmit over networks remains challenging. This research proposes a novel hybrid security technique, abbreviated as pretty good privacy and code obfuscation framework (PGF), which combines pretty good privacy (PGP) with code obfuscation. PGF is designed specifically to protect mobile agents, focusing on systems like Aglets. The technique aims to safeguard the integrity and confidentiality of the agent's data during transmission. Based on the mobile agent Aglets and the PGF technique, the proposed model enhances security by introducing additional protection layers during agent creation and transmission using PGP and code obfuscation. The comparative analysis demonstrated that PGF outperformed other algorithms in terms of time efficiency and security, effectively handling large data sizes through its hybrid cryptographic approach, which combines asymmetric and symmetric encryption. The model was implemented using the Aglets framework in Java development kit (JDK) and NetBeans and showed high reliability and practicality. However, its current design is tailored to Aglets, and future work could focus on adapting the model to other platforms and optimizing its resource efficiency for constrained environments.

In the world of mobile agents, security aspects are extensively being discussed. Denial of service (DoS) attacks are of considerable interest, i.e., when malicious hosts either delete received agents or prevent them from continuing their route. This paper presents a method for a posteriori identification of such malicious hosts to build a trust policy. Depending on how much the agent owner trusts the hosts, he can either define an appropriate order in which selected hosts should be visited, or he can decide which hosts he does not want to contact again. We also show how the sequence of hosts should be determined in order to minimize some costs.

Elections in recent years have become topical issues and characterized by violence and conflicts leading to loss of lives and properties. The integrity and confidentiality of the declared collated results have been questioned by individuals and organisations with keen interest in the outcomes of every election. Different countries have adopted different Election Results Management Systems (RMS) to help present a credible, fair and transparent election results. These systems adopted are not without criticisms and suspicions. This research paper has presented various factors that need to be considered when selecting a Results Management System (RMS) for elections. A cloud-based using a Hybrid homomorphic encryption approach is proposed in managing the election results data security and transmission. The proposed scheme has demonstrated effectiveness in handling data integrity, data confidentiality, data privacy and access control. The proposed scheme presented has enhanced the security of election results data against Chosen Ciphetext Attacks (CCA) and Denial of Service (DoS) as well as other cyber related attacks. The time required for the entire election data encryption, transmission, decryption, upload time and download time has been greatly enhanced with the proposed system. The proposed system workflow algorithm, key generation algorithm, encryption algorithm and decryption have been presented in this research paper. The outcome of the research work indicates that only 0.00078 seconds is required to generate keys for about 100 users. About 0.705 seconds and 0.863 seconds is required for the encryption and decryption of a 500MB election results data. It was observed that the overall election results data transmission time is about 51.779 seconds which is less than one minute (60 seconds) for about 500MB data size of the election results data. This paper makes a case for the adoption and implementation of the proposed system since it performs better in terms of securing the election results data and transmission time in the cloud environment.