Evaluation of Program Code Caching for Mobile Agent Migrations

Mobile agents are able to migrate among machines to achieve their tasks. This feature is attractive to design, implement, and maintain distributed systems because we can implement both client-side and server-side programming in one mobile agent. However, it involves the increase of data traffic for mobile agent migrations. In this paper, we propose program code caching to reduce the data traffic caused by mobile agent migrations. A mobile agent consists of many program codes that define a task executed in each machine they migrate; thus, the mobile agent migration involves the transfer of their program codes. Therefore, our method reduces the number of the transfer of program codes by using program code cache. We have implemented our method on a mobile agent framework called Maglog and conducted experiments on a meeting scheduling system.     

Secure Web Transaction with Anonymous Mobile Agent over Internet

A major problem of mobile agents is their apparent inability to authenticate transactions in hostile environments. In this paper, a new secure anonymous mobile agent scheme is proposed for the prevention of agent tempering without compromising the mobility or autonomy of the agent. In the scheme, a mobile agent can produce valid signature on website's bid (it means to transact a contact with the web site) on behalf of its customer, without revealing the customer's real private key. In addition, the anonymity of the customer is also achieved when its agent transacts with the websites. Furthermore, the customer who issues a malicious agent or denies the transaction can be identified and detected by Agent Management Center (AMC). Therefore, the scheme is practical in the future electronic commerce over Internet.     

Secure web transaction with anonymous mobile agent over internet

A major problem of mobile agents is their apparent mability to authenticate transactions in hostile environments,In this paper,a new secure anonymous mobile agent scheme is proposed for the prevention of agent tempering without compromising the mobility or autonomy of the agent.in the scheme,a mobile agent can produce valid signature on website‘s bid(it means to transact a contact with the web site)on behalf of its customer ,without-revealing the customer‘s real private key.In addition,the anonymity of the customer is also achieved when its agent tansacts with the websites.Furthermore,the customer who issues a malicious agent or denies the transaction can be identified and detected by Agent Management Center(AMC).Thererfore,the scheme is practical in the future elecronic commerce over Internet.     

Correlated Differential Privacy of Multiparty Data Release in Machine Learning

Differential privacy(DP)is widely employed for the private data release in the single-party scenario.Data utility could be degraded with noise generated by ubiquitous data correlation,and it is often addressed by sensitivity reduction with correlation analysis.However,increasing multiparty data release applications present new challenges for existing methods.In this paper,we propose a novel correlated differential privacy of the multiparty data release(MP-CRDP).It effectively reduces the merged dataset's dimensionality and correlated sensitivity in two steps to optimize the utility.We also propose a multiparty correlation analysis technique.Based on the prior knowledge of multiparty data,a more reasonable and rigorous standard is designed to measure the correlated degree,reducing correlated sensitivity,and thus improve the data utility.Moreover,by adding noise to the weights of machine learning algorithms and query noise to the release data,MP-CRDP provides the release technology for both low-noise private data and private machine learning algorithms.Comprehensive experiments demonstrate the effectiveness and practicability of the proposed method on the utilized Adult and Breast Cancer datasets.     

Correlated Differential Privacy of Multiparty Data Release in Machine Learning

Differential privacy(DP)is widely employed for the private data release in the single-party scenario.Data utility could be degraded with noise generated by ubiquitous data correlation,and it is often addressed by sensitivity reduction with correlation analysis.However,increasing multiparty data release applications present new challenges for existing methods.In this paper,we propose a novel correlated differential privacy of the multiparty data release(MP-CRDP).It effectively reduces the merged dataset's dimensionality and correlated sensitivity in two steps to optimize the utility.We also propose a multiparty correlation analysis technique.Based on the prior knowledge of multiparty data,a more reasonable and rigorous standard is designed to measure the correlated degree,reducing correlated sensitivity,and thus improve the data utility.Moreover,by adding noise to the weights of machine learning algorithms and query noise to the release data,MP-CRDP provides the release technology for both low-noise private data and private machine learning algorithms.Comprehensive experiments demonstrate the effectiveness and practicability of the proposed method on the utilized Adult and Breast Cancer datasets.     

基于JavaCard的移动代理系统安全性研究

With wide and increasing range applications of mobile agent technology, the security problem has gotten more and more focus. This paper discusses the security problems that the mobile agent system faces with at presentand the existing protesting schemes for it. Then a solving method based on JavaCard is proposed to protect mobile a-gents. And a feasible solving method is also provided to solve the security problems of JavaCard itself.     

MADIDS：一种基于移动代理的新型分布式入侵检测系统

When traditional Intrusion Detection System(IDS)is used to detect and analyze the great flow data transfer in high-speed network,it usually causes the computation bottleneck.This paper presents a new Mobile Agent Distributed IDS(MADIDS) system based on the mobile agents.This system is specifically designed to process the great flow data transfer in high-speed network.In MADIDS,the agents that are set at each node process the data transfer by distributed computation architecture.Meanwhile by using the reconfiguration quality of the mobile agents,the load balance of distributed computation can be dynamically implemented to gain the high-performance computing ability.This ability makes the detecting and analyzing of high-speed network possible.MADIDS can effectively solve the detection and analysis performance bottleneck caused by the great flow data transfer in high-speed network.It enhances the performance of IDS in high-speed network.In this paper,we construct the infrastructure and theoretical model of MADIDS,and the deficiencies of MADIDS and future research work are also indicated.     

基于主从样式的移动代理安全模型的研究与实现

In the ages of current network technology, as a new technology, the emergence of mobile agent shows us a wider and wider application prospect in the fields of network technology, such as Network Management,Intelligence Information Retrieval and Electronic Commence and so on. The security is the essence of mobile agent technology. In this paper we analyze the security issues and survey some representative approaches to solve the problem in mobile agent systems. We focus on the issues about the agent's security and propose a master-slave designpattern based security model for mobile agent called SMAP(Secure Mobile Agent Platform). In the end we give anapplication example to show how to use these.     

SPMH: A Solution to the Problem of Malicious Hosts

In this paper,a solution to the Problem of Malicious Hosts,named SPMH,is suggested.At first,Mobile Agent Blackbox Construction Method based on Loureiro‘s Protocol (MABCM-LP)is suggested to convert a mobile agent into a Mobile Agent Blackbox(MAB) which makes the mobile agent difficult to be understood and tampered by malicious hosts.At the same time,a Protocol Tracing the Inputs/outputs and Results(PTIR)is developed to trace the mobile agent running at a host,which can be used to detect and prove the attacks by malicious hosts,It is proved that this solution is secure,correct,and robust.It is found firstly that the detection method and the prevention method are complementary to each other,and this is the first solution that integrated both of these two methods too.     

A blockchain-based transaction system for private data sharing and trading

To address the private data management problems and realize privacy-preserving data sharing, a blockchain-based transaction system named Ecare featuring information transparency, fairness and scalability is proposed. The proposed system formulates multiple private data access control strategies, and realizes data trading and sharing through on-chain transactions, which makes transaction records transparent and immutable. In our system, the private data are encrypted, and the role-based account model ensures that access to the data requires owner’s authorization. Moreover, a new consensus protocol named Proof of Transactions (PoT) proposed by ourselves has been used to improve consensus efficiency. The value of Ecare is not only that it aggregates telemedicine, data transactions, and other features, but also that it translates these actions into transaction events stored in the blockchain, making them transparent and immutable to all participants. The proposed system can be extended to more general big data privacy protection and data transaction scenarios.     

基于蜂窝无线网络的移动IP（IPv6）研究

Introduce method and technology of combination of the TCP/IP protocol based on IPv6 and the cellular wireless communication network. Analyze the cut-in point and key technology of the combination from the view of frame, system structure and the realization of protocols. The 3G cellular wireless communication is a hotspot today and the mobile IP technology is one of the developing directions for the Internet's future. We put forward a new idea and method for the mobile communication technology from the practical view.     

Electronic payment system

Equipment and method for acknowledging a trans- action in an electronic payment system, comprising first processing means for providing electronic receipts corresponding to payments, second processing means for receiving said receipts, and transfer means for transferring said receipts between the first and second processing means. Said electronic receipt or part of it is encrypted with a public-key algorithm by using the payee's private key as an encryption key, and a receipt is decrypted with a public-key algorithm by using the payee's public key as s decryption key. If a recipient of the receipt wants to be convinced of the authenticity of the receipt, he decrypts the encryption by means of the payee's public key. Digital encryption with the payee's private key certifies the origin of the receipt undeniably. As long as the receipt is in encrypted form, it cannot be read without exactly knowing the payee, and counterfeiting of the receipt is impossible. An electronic receipt can be easily read and tran     

An algorithm for high precision attitude determination when using low precision sensors

The technology for high precision attitude determination when using low precision sensors is a key requirement of a modern small satellite. This paper presents a new attitude determination algorithm termed preprocess EKF(PP-EKF) based on preprocessing of the sensor data. It can enhance the overall modeling accuracy by using the quadratic penalty function to correct the dynamic model error and angular velocity error in realtime, based on the information fusion of the current and the past measurement information. The measurement model of the EKF is linearized by introducing the q method. The solution error of this process is also corrected to further improve the accuracy of the measurement model and make better use of measurement data from the low precision sensors, to obtain good attitude determination results. Finally, the simulation results demonstrate the high reliability and other advantages of the proposed algorithm.     

Two-Factor Cancelable Biometrics Authenticator

Biometrics-based authentication system offers advantages of providing high reliability and accuracy. However the contemporary authentication system is impuissance to compromise. If a biometrics data is compromised, it cannot be replaced and rendered unusable. In this paper, a cancelable biometrics-based authenticator is proposed to solve this irrevocability issue. The proposed approach is a two-factor authentication system, which requires both of the random data and facial feature in order to access the system. In this system, tokenized pseudo-random data is coupled with momentbased facial feature via inner product algorithm. The output of the product is then discretized to generate a set of private binary code, coined as 2factor-Hashing code, which is acted as verification key. If this biometrics-based verification key is compromised, a new one can be issued by replacing a different set of random number via token replacement. Then, the compromised one is rendered completely useless. This feature offers an extra protection layer against biometrics fabrication since the verification code is replaceable. Experimental results demonstrate that the proposed system provides zero Equal Error Rate in which there is a clear separation in between the genuine and the imposter distribution populations.     

移动Agent系统通信失效问题研究

The Mobile Agent is thought to be the popular computing model for the next generation's distributed sys-tem. The mobile agent has the following key features: autonomy, collaboration, security and especially mobility. Agood communication model for mobile agents cooperation is also necessary. In this article, after describing the maincommunication mechanisms, we analyze the methods to solve Agent Tracking and Communication Failure and make classification. We also propose a reliable and efficient mechanism named MEFS which uses Detecting methods and then analyze its performance by giving the experimental data at the end.     

A provable-secure and practical two-party distributed signing protocol for SM2 signature algorithm

Mobile devices are widely used for data access,communications and storage.However,storing a private key for signature and other cryptographic usage on a single mobile device can be challenging,due to its computational limitations.Thus,a number of(t,n)threshold secret sharing schemes designed to minimize private key from leakage have been proposed in the literature.However,existing schemes generally suffer from key reconstruction attack.In this paper,we propose an efficient and secure two-party distributed signing protocol for the SM2 signature algorithm.The latter has been mandated by the Chinese government for all electronic commerce applications.The proposed protocol separates the private key to storage on two devices and can generate a valid signature without the need to reconstruct the entire private key.We prove that our protocol is secure under nonstandard assumption.Then,we implement our protocol using MIRACL Cryptographic SDK to demonstrate that the protocol can be deployed in practice to prevent key disclosure.     

Emotional agent based on rough set

To improve the ability of agent for handling emotions, a new architecture for emotion agent is presented, based on the traditional BDI agent model and the rough set theory. By a new emotional reasoning algorithm based on rough set, the architecture performs emotion reasoning and implements the emotion treatment. An emotional agent grid based on this architecture has been realized, experiment results show that it is efficient to transact simple emotions by emotional agents.     

Information service model with mobile agent supported

Mobile Agent is a kind of novel agent technology characterized by mobile,intelligent,parallel and asynchronous computing.In this paper,a new information service model that adopts mobile agent technology is introduced first.and then an experimental system DOLTRIA system that is implemented based on the model is described.The DOLTRIA system implemented by WWW framework and Java can search for relevant HTML documents on a set of Web servers,The result of experiments shows that performance improvement can be achieved by this model,and both the elapsed time and network traffic are reduced significantly.     

一种编队控制的动态调整与规划方法

This article is concerned with cooperative control problems in formation of mobile robots under the nonholonomic constraints that certain geometrical constraints are imposed on multiple mobile robots throughout their travel. For this purpose, a new method of motion control for formation is presented, which is based on the dynamic regulation and scheduling scheme. It is attractive for its adaptability to the formation structure and desired trajectory. The quality of formation keeping can be evaluated by the instantaneous errors of formation offset and spacing distance. Some kinematics laws are developed to regulate and maintain the formation shape. Simulation results and data analysis show the validity of the proposed approach for a group of robots.     

．NET环境下的移动代理迁移机制

The migration mechanism is one of the most important techniques for the mobile agent techniques. In this paper, migration mechanism for the mobile agent based on Microsoft .NET developing environment is researched. First, the two serialized techniques provided by .NET platform are analyzed and compared,and Binary serialization techniques are adopted to implement the data state migration of the mobile agent. Then, the Web serviceapproach is introduced to realize the code state migration of the mobile agent and the corresponding Web service is constructed. At last, the whole migration process of the mobile agent is described.