WorldWideScience

Sample records for Mobile Agent, Encryption, Aglet.

  1. Web Crawler Based on Mobile Agent and Java Aglets

    Directory of Open Access Journals (Sweden)

    Md. Abu Kausar

    2013-09-01

    Full Text Available With the huge growth of the Internet, many web pages are available online. Search engines use web crawlers to collect these web pages from World Wide Web for the purpose of storage and indexing. Basically Web Crawler is a program, which finds information from the World Wide Web in a systematic and automated manner. This network load farther will be reduced by using mobile agents.The proposed approach uses mobile agents to crawl the pages. A mobile agent is not bound to the system in which it starts execution. It has the unique ability to transfer itself from one system in a network to another system. The main advantages of web crawler based on Mobile Agents are that the analysis part of the crawling process is done locally rather than remote side. This drastically reduces network load and traffic which can improve the performance and efficiency of the whole crawling process.

  2. A Transport Model of Mobile Agent Based on Secure Hybrid Encryption

    Institute of Scientific and Technical Information of China (English)

    SUNZhixin; CHENZhixian; WANGRuchuan

    2005-01-01

    The solution of security problems of mobile agents is a key issue, which will decide whether mobile agents can be widely used. The paper analyzes main security problems, which currently are confronted with mobile agent systems and existing protection solutions. And then the paper presents a Security Transport model of mobile agents based on a hybrid encryption algorithm (TMSHE).Meanwhile, it expatiates on implementation of the algorithm. The algorithm of TMSHE model mainly consists of two parts, i.e., employing a hybrid encryption algorithm to encrypt mobile agents and using Transport layer security (TLS) to encrypt communication channel. Mobile agents by hybrid encryption move through communication channels, which are encrypted by TLS. The simulation results indicate that the model can protect mobile agents' security effectively, and consequently the security and steadiness of the whole mobile agent system are also improved. The model has succeeded in getting application in a prototypesystem- Intrusion detection system based on mobile agents.

  3. A Novel Security Approach in Mobile Agent Using Encryption

    Directory of Open Access Journals (Sweden)

    Nidhi Gupta

    2012-06-01

    Full Text Available The appearance of software agents has given rise too much discussion of what such an agent is and how it differs from programs in general. An agent is anything that can be viewed as perceiving its environment through sensors & acting upon that environment through actuators. The existing systems can be classified in the context of singleagent systems and multi-agent systems. Mobile agents cantransport themselves from one host to another. Mobile agents have been developed as an extension to and replacement of the client-server model. The proposed system is Mobile Agent System. It reduces network load and latency in which there is usually no transmission ofintermediate result. This conserves the network bandwidth .Since the agents are autonomous; the mobile device that dispatches the agent need not be connected all the time.

  4. Dimensions of Usability: Cougaar, Aglets and Adaptive Agent Architecture (AAA)

    Energy Technology Data Exchange (ETDEWEB)

    Haack, Jereme N.; Cowell, Andrew J.; Gorton, Ian

    2004-06-20

    Research and development organizations are constantly evaluating new technologies in order to implement the next generation of advanced applications. At Pacific Northwest National Laboratory, agent technologies are perceived as an approach that can provide a competitive advantage in the construction of highly sophisticated software systems in a range of application areas. An important factor in selecting a successful agent architecture is the level of support it provides the developer in respect to developer support, examples of use, integration into current workflow and community support. Without such assistance, the developer must invest more effort into learning instead of applying the technology. Like many other applied research organizations, our staff are not dedicated to a single project and must acquire new skills as required, underlining the importance of being able to quickly become proficient. A project was instigated to evaluate three candidate agent toolkits across the dimensions of support they provide. This paper reports on the outcomes of this evaluation and provides insights into the agent technologies evaluated.

  5. A secure model for mobile agent based on encrypted circuit construction

    Institute of Scientific and Technical Information of China (English)

    ZHENG Yan; WANG Ruchuan; MU Hong; WANG Haiyan

    2007-01-01

    As a new technology,mobile agent (MA) shows a wide application in the field of network technology.However,security has been one of the crucial problems in its application.A new protection model based on a trusted element is presented in this paper.The trusted element,which differs from the traditional trusted hardware such as a smart card or a co-processor,offers a third party service based on an encrypted circuit construction.The procedure of constructing an encrypted circuit is introduced and the method of using the trusted service to protect the MA is also described.An application example is given to show how to use the new model at the end of the paper.

  6. A Method for Interaction of Mobile Agent and SNMP

    Institute of Scientific and Technical Information of China (English)

    ZHANGPuhan; SUNYufang

    2003-01-01

    Typically, most of existing network man-agement applications are based on protocol SNMP(Simple network management protocol). The protocol is based on static, centralized and non-scalable client/server architec-tures, where some central entity processes large amounts of raw data gathered from each network element. By this reason, the management applications are not flexible, have problems of scalability and produce too much traffic in the network. Mobile agents have been proposed as a so-lution to the problems. However, most of proposed solu-tions often ignore the existing of legacy network manage-ment frameworks and have to change them. This paper presents a method to extend an existing legacy network management framework targeted at network management with an interface for integration with mobile agents and implemented it by using java technology and aglet which is a mobile agent system from IBM.

  7. Dynamic Rule Encryption for Mobile Payment

    Directory of Open Access Journals (Sweden)

    Emir Husni

    2017-01-01

    Full Text Available The trend of financial transactions by using a mobile phone or mobile payment increases. By using the mobile payment service, users can save money on mobile phone (handset and separate from the pulse. For protecting users, mobile payment service providers must complete the mobile payment service with the transaction security. One way to provide transaction security is to utilize a secure mobile payment application. This research provides a safety feature used for an Android-based mobile payment application. This security feature is making encryption rules dynamically named Dynamic Rule Encryption (DRE. DRE has the ability to protect data by means of encrypting data with dynamic rules, and DRE also has a token function for an authentication. DRE token raised with dynamic time-based rules. Here, the time is used as a reference with the order of the day in the year (day of the year. The processes of the DRE’s encryption, decryption, and the DRE’s functionality as the token are discussed in this paper. Here, the Hamming distance metric is employed for having maximum differences between plaintext and ciphertext.

  8. Mobile Agents

    Science.gov (United States)

    Satoh, Ichiro

    Mobile agents are autonomous programs that can travel from computer to computer in a network, at times and to places of their own choosing. The state of the running program is saved, by being transmitted to the destination. The program is resumed at the destination continuing its processing with the saved state. They can provide a convenient, efficient, and robust framework for implementing distributed applications and smart environments for several reasons, including improvements to the latency and bandwidth of client-server applications and reducing vulnerability to network disconnection. In fact, mobile agents have several advantages in the development of various services in smart environments in addition to distributed applications.

  9. MOBILE AGENT: EMERGING TECHNOLOGY

    OpenAIRE

    RAJGURU P. V. DR. DESHMUKH S. D

    2011-01-01

    Mobile agent technology has been promoted as an emerging technology that makes it much easier to design, implement, and maintain distributed systems, introduction to basic concepts of mobile agents like agent mobility, agent types and places and agent communication. Then benefits of the usage of mobile agents are summarized and illustrated by selected applications. The next section lists requirements and desirable properties for mobile agent languages and systems. We study the main features, ...

  10. A Highly Secure Mobile Agent System Architecture

    Science.gov (United States)

    Okataku, Yasukuni; Okutomi, Hidetoshi; Yoshioka, Nobukazu; Ohgishi, Nobuyuki; Honiden, Shinichi

    We propose a system architecture for mobile agents to improve their security in the environments of insecure networks and non-sophisticated terminals such as PDAs. As mobile agents freely migrate onto their favorite terminals through insecure networks or terminals, it is not appropriate for them to store some secret information for authentication and encryption/decryption. We introduce one and more secure nodes(OASIS NODE) for securely generating and verifying authentication codes. The each agent’s data are encrypted by a pseudo-chaos cipher mechanism which doesn’t need any floating processing co-processor. We’ve constructed a prototype system on a Java mobile agent framework, “Bee-gent" which implements the proposed authentication and cipher mechanisms, and evaluated their performances and their applicability to business fields such as an auction system by mobile agents.

  11. 基于Aglets的MAS信用研究的实验平台设计%Test Platform of Study on Multi-agent Trust Based on Aglets

    Institute of Scientific and Technical Information of China (English)

    莫再峰; 陈波; 曹勇

    2006-01-01

    本文在Aglet平台上开发出一个MAS可视化实验平台.该试验平台主要用于MAS系统(Multiagent Systems)用机制研究.用户在该平台上能够方便快捷地配置出一个多Agent系统,该系统不但具有Agent与Agent,Agent买体与平台的通信,Agent与用户的交互,Agent在内外网的移动等基本功能,而且可以在Agent之间建立信用关系,可以存储记录和直观的显示交互的历史及信用信息.该系统是一个开放的系统,用户可以方便的在该系统中加入自己的安全构架,信用策略和信用相关算法,以方便快速测试新的MAS信用模型.

  12. Lessons learned: mobile device encryption in the academic medical center.

    Science.gov (United States)

    Kusche, Kristopher P

    2009-01-01

    The academic medical center is faced with the unique challenge of meeting the multi-faceted needs of both a modern healthcare organization and an academic institution, The need for security to protect patient information must be balanced by the academic freedoms expected in the college setting. The Albany Medical Center, consisting of the Albany Medical College and the Albany Medical Center Hospital, was challenged with implementing a solution that would preserve the availability, integrity and confidentiality of business, patient and research data stored on mobile devices. To solve this problem, Albany Medical Center implemented a mobile encryption suite across the enterprise. Such an implementation comes with complexities, from performance across multiple generations of computers and operating systems, to diversity of application use mode and end user adoption, all of which requires thoughtful policy and standards creation, understanding of regulations, and a willingness and ability to work through such diverse needs.

  13. Mobile Agents Systems in Wireless Applications

    Directory of Open Access Journals (Sweden)

    Mihaela Muntean

    2009-06-01

    Full Text Available The paper presents an introduction in the Mobile Agents Systems and describes how this technology can be used in wireless applications. Also it is shown the possibility of securing wireless applications that use mobile agents and distributed computing. Wireless networks are a relatively new technology in the LAN market. With the weak encryption and security defined in the IEEE standards, wireless LANs, when improperly deployed or administered, can provide a significant risk to those economic sectors. These sectors include health-care, government, and banking in particular. Increasingly diverse heterogeneous wireless infrastructures in combination with more narrowly defined roles of parties participating in the delivery of applications to mobile users pose new challenges for support for delivering these applications.

  14. Fast Video Encryption Using the H.264 Error Propagation Property for Smart Mobile Devices

    Directory of Open Access Journals (Sweden)

    Yongwha Chung

    2015-04-01

    Full Text Available In transmitting video data securely over Video Sensor Networks (VSNs, since mobile handheld devices have limited resources in terms of processor clock speed and battery size, it is necessary to develop an efficient method to encrypt video data to meet the increasing demand for secure connections. Selective encryption methods can reduce the amount of computation needed while satisfying high-level security requirements. This is achieved by selecting an important part of the video data and encrypting it. In this paper, to ensure format compliance and security, we propose a special encryption method for H.264, which encrypts only the DC/ACs of I-macroblocks and the motion vectors of P-macroblocks. In particular, the proposed new selective encryption method exploits the error propagation property in an H.264 decoder and improves the collective performance by analyzing the tradeoff between the visual security level and the processing speed compared to typical selective encryption methods (i.e., I-frame, P-frame encryption, and combined I-/P-frame encryption. Experimental results show that the proposed method can significantly reduce the encryption workload without any significant degradation of visual security.

  15. Fast video encryption using the H.264 error propagation property for smart mobile devices.

    Science.gov (United States)

    Chung, Yongwha; Lee, Sungju; Jeon, Taewoong; Park, Daihee

    2015-04-02

    In transmitting video data securely over Video Sensor Networks (VSNs), since mobile handheld devices have limited resources in terms of processor clock speed and battery size, it is necessary to develop an efficient method to encrypt video data to meet the increasing demand for secure connections. Selective encryption methods can reduce the amount of computation needed while satisfying high-level security requirements. This is achieved by selecting an important part of the video data and encrypting it. In this paper, to ensure format compliance and security, we propose a special encryption method for H.264, which encrypts only the DC/ACs of I-macroblocks and the motion vectors of P-macroblocks. In particular, the proposed new selective encryption method exploits the error propagation property in an H.264 decoder and improves the collective performance by analyzing the tradeoff between the visual security level and the processing speed compared to typical selective encryption methods (i.e., I-frame, P-frame encryption, and combined I-/P-frame encryption). Experimental results show that the proposed method can significantly reduce the encryption workload without any significant degradation of visual security.

  16. Secure chip based encrypted search protocol in mobile office environments

    Directory of Open Access Journals (Sweden)

    Hyun-A Park

    2016-05-01

    Full Text Available This paper deals with largely two security problems between the cloud computing service and trusted platform module (TPM chip as a mobile convergent technology. At first, we solve the social issues from inside attackers, which is caused by that we regard server managers as trustworthy. In order to solve this problem, we propose encrypted DB retrieval system whose server manager cannot access on real data (plaintexts in mobile office environments of the cloud datacenter. The other problem is that cloud computing has limitless computing resources; however, it faces with the vulnerability of security. On the other hand, the TPM technology has been known as a symbol of physical security; however, it has the severe limitation of use such as hardware constraints or limited amount of non-volatile memory. To overcome the weakness and produce synergic effects between the two technologies, we combine two applications (cloud datacenter service, TPM chip as a mobile convergent technology. The main methods are TPM-security-client and masked keys. With these methods, the real keys are stored in TPM and the faked keys (masked keys are implemented for computations instead of real keys. Thus, the result of the faked keys is the same as the real keys. Consequently, this system is secure against both of the insiders and outsiders, the cloud computing service can improve security weaknesses.

  17. A Unidirectional Split-key Based Signature Protocol with Encrypted Function in Mobile Code Environment

    Institute of Scientific and Technical Information of China (English)

    MIAOFuyou; YANGShoubao; XIONGYan; HUABei; WANGXingfu

    2005-01-01

    In mobile code environment, signing private keys are liable to be exposed; visited hosts are susceptible to be attacked by all kinds of vicious mobile codes, therefore a signer often sends remote nodes mobile codes containing an encrypted signature function to complete a signature. The paper first presents a unidirectional split-key scheme for private key protection based on RSA, which is more simple and secure than secret sharing; and then proposes a split-key based signature protocol with encrypted function, which is traceable, undeniable and malignance resistant. Security analysis shows that the protocol can effectively protect the signing private key and complete secure signatures in mobile code environment.

  18. Secure Mobile Trade Agent

    Directory of Open Access Journals (Sweden)

    Musbah M. Aqe

    2007-01-01

    Full Text Available E-commerce on the internet has the ability to produce millions of transactions and a great number of merchants whose supply merchandise over the internet. As a result, it is difficult for entities to roam over every site on the internet and choose the best merchandise to trade. So, in this paper we introduced a mobile trade agent that visit the sites to gather and evaluate the information from merchant servers and decide to trade goods on behalf of the user. We observed that the combination of public key cryptosystem with distributed object technology make this proposed scheme more secure and efficient than the already existed schemes.

  19. A Security Protocol for the Identification and Data Encrypt- Key Management of Secure Mobile Devices

    Directory of Open Access Journals (Sweden)

    Song Han

    2013-07-01

    Full Text Available In this paper, we proposed an identification and data encrypt key manage protocol that can be used in some security system based on such secure devices as secure USB memories or RFIDs, which are widely used for identifying persons or other objects recently. In general, the default functions of the security system using a mobile device are the authentication for the owner of the device and secure storage of data stored on the device. We proposed a security model that consists of the server and mobile devices in order to realize these security features. In this model we defined the secure communication protocol for the authentication and management of data encryption keys using a private key encryption algorithm with the public key between the server and mobile devices. In addition, we was performed the analysis for the attack to the communication protocol between the mobile device and server. Using the communication protocol, the system will attempt to authenticate the mobile device. The data decrypt key is transmitted only if the authentication process is successful. The data in the mobile device can be decrypted using the key. Our analysis proved that this Protocol ensures anonymity, prevents replay attacks and realizes the interactive identification between the security devices and the authentication server.

  20. Mobile Agents - Smart Messages

    OpenAIRE

    Hurst, Leon; Cunningham, Padraig

    1997-01-01

    Wireless communication with Mobile Computing devices is known to be problematic. It is very different in character from conventional communication over wired networks. Since many distributed applications make assumptions about network characteristics, they may not be used in a hostile mobile environment. We are proposing a new kind of messaging system which incorporates adaptive behaviour into the messages themselves. We call these `Smart Messages?, and implement them using ...

  1. Mobile agent driven by aspect

    Directory of Open Access Journals (Sweden)

    Youssef Hannad

    2010-11-01

    Full Text Available Domain application of mobile agents is quite large. They are used for network management and the monitoring of complex architecture. Mobile agent is also essential into specific software architecture such that adaptable grid architecture. Even if the concept of mobile agent seems to be obvious, the development is always complex because it needs to understand network features but also security features and negotiation algorithms. We present a work about an application of aspects dedicated to mobile agent development over a local network. At this level, the underlying protocol is called jini and allows managing several essential concepts such that short transaction and permission management. Three subsets of aspects are defined in this work. A part is for the description of agent host and its security level, accessible resource, etc. A second part is about mobile agent and their collaboration. This means how they can operate on an agent host with the respect of the execution context. All the results are illustrated through a distributed monitoring application called DMA. Its main objective is the observation of component servers.

  2. New agents in HSC mobilization.

    Science.gov (United States)

    Domingues, Mélanie J; Nilsson, Susan K; Cao, Benjamin

    2017-02-01

    Mobilized peripheral blood (PB) is the most common source of hematopoietic stem cells (HSC) for autologous transplantation. Granulocyte colony stimulating factor (G-CSF) is the most commonly used mobilization agent, yet despite its widespread use, a considerable number of patients still fail to mobilize. Recently, a greater understanding of the interactions that regulate HSC homeostasis in the bone marrow (BM) microenvironment has enabled the development of new molecules that mobilize HSC through specific inhibition, modulation or perturbation of these interactions. AMD3100 (plerixafor), a small molecule that selectively inhibits the chemokine receptor CXCR4 is approved for mobilization in combination with G-CSF in patients with Non-Hodgkin's lymphoma and multiple myeloma. Nevertheless, identifying mobilization strategies that not only enhance HSC number, but are rapid and generate an optimal "mobilized product" for improved transplant outcomes remains an area of clinical importance. In recent times, new agents based on recombinant proteins, peptides and small molecules have been identified as potential candidates for therapeutic HSC mobilization. In this review, we describe the most recent developments in HSC mobilization agents and their potential impact in HSC transplantation.

  3. A DNA-Inspired Encryption Methodology for Secure, Mobile Ad Hoc Networks

    Science.gov (United States)

    Shaw, Harry

    2012-01-01

    Users are pushing for greater physical mobility with their network and Internet access. Mobile ad hoc networks (MANET) can provide an efficient mobile network architecture, but security is a key concern. A figure summarizes differences in the state of network security for MANET and fixed networks. MANETs require the ability to distinguish trusted peers, and tolerate the ingress/egress of nodes on an unscheduled basis. Because the networks by their very nature are mobile and self-organizing, use of a Public Key Infra structure (PKI), X.509 certificates, RSA, and nonce ex changes becomes problematic if the ideal of MANET is to be achieved. Molecular biology models such as DNA evolution can provide a basis for a proprietary security architecture that achieves high degrees of diffusion and confusion, and resistance to cryptanalysis. A proprietary encryption mechanism was developed that uses the principles of DNA replication and steganography (hidden word cryptography) for confidentiality and authentication. The foundation of the approach includes organization of coded words and messages using base pairs organized into genes, an expandable genome consisting of DNA-based chromosome keys, and a DNA-based message encoding, replication, and evolution and fitness. In evolutionary computing, a fitness algorithm determines whether candidate solutions, in this case encrypted messages, are sufficiently encrypted to be transmitted. The technology provides a mechanism for confidential electronic traffic over a MANET without a PKI for authenticating users.

  4. Mobile agent security using proxy-agents and trusted domains

    OpenAIRE

    Mitrovic, Nikola; Arronategui Arribalzaga, Unai

    2009-01-01

    Commercial or wide-network deployment of Mobile Agent Systems is not possible without satisfying security architecture. In this paper we propose architecture for secure Mobile Agent Systems, using Trusted Domains and Proxy agents. Existing approaches are based on security services at the level of an agent system, library or specific objects. Our concept uses proxy agents to enable transparent security services both to security-aware mobile agents and legacy agents. Per-agent and domain-level...

  5. Information security in data exchange between mobile devices with Android system using RSA encryption

    Directory of Open Access Journals (Sweden)

    Fernando Solís

    2017-02-01

    Full Text Available The new styles and ways of life lead to greater use of wireless networks, the mobile device being a tool for data transmission, which are susceptible to threats in the transmission channels in the network. IT security plays a very important role in guaranteeing the availability, privacy and integrity of information, one of the techniques that helps in this task is cryptography, whose foundation is to transform a message so that it is unintelligible except for those who have the Key to decipher it. The research focuses on the use of the RSA algorithm between mobile devices, the encrypted data is sent through communication channels called threads that through formulas and processes executed on the server, will help to execute the encryption and decryption of the data. To carry it out, a prototype for the exchange of data between mobile devices wirelessly was designed and implemented, conducting performance tests with three nodes to improve the security. The results show the efficiency of the algorithm and additionally its functionality, the times of encryption and decryption are fast against the sending of information without any method or algorithm used.

  6. A data encryption solution for mobile health apps in cooperation environments.

    Science.gov (United States)

    Silva, Bruno M; Rodrigues, Joel J P C; Canelo, Fábio; Lopes, Ivo C; Zhou, Liang

    2013-04-25

    Mobile Health (mHealth) proposes health care delivering anytime and anywhere. It aims to answer several emerging problems in health services, including the increasing number of chronic diseases, high costs on national health services, and the need to provide direct access to health services, regardless of time and place. mHealth systems include the use of mobile devices and apps that interact with patients and caretakers. However, mobile devices present several constraints, such as processor, energy, and storage resource limitations. The constant mobility and often-required Internet connectivity also exposes and compromises the privacy and confidentiality of health information. This paper presents a proposal, construction, performance evaluation, and validation of a data encryption solution for mobile health apps (DE4MHA), considering a novel and early-proposed cooperation strategy. The goal was to present a robust solution based on encryption algorithms that guarantee the best confidentiality, integrity, and authenticity of users health information. In this paper, we presented, explained, evaluated the performance, and discussed the cooperation mechanisms and the proposed encryption solution for mHealth apps. First, we designed and deployed the DE4MHA. Then two studies were performed: (1) study and comparison of symmetric and asymmetric encryption/decryption algorithms in an mHealth app under a cooperation environment, and (2) performance evaluation of the DE4MHA. Its performance was evaluated through a prototype using an mHealth app for obesity prevention and cares, called SapoFit. We then conducted an evaluation study of the mHealth app with cooperation mechanisms and the DE4MHA using real users and a real cooperation scenario. In 5 days, 5 different groups of 7 students selected randomly agreed to use and experiment the SapoFit app using the 7 devices available for trials. There were 35 users of SapoFit that participated in this study. The performance

  7. Mobile agents basic concepts, mobility models, and the tracy toolkit

    CERN Document Server

    Braun, Peter

    2005-01-01

    Mobile agents are software nomads that act as your personal representative, working autonomously through networks. They are able to visit network nodes directly using available computing power and are not limited by platform. This emerging field is now poised to become a cornerstone for new Web-based ubiquitous computing environments. Mobile Agents provides a practical introduction to mobile agent technology and surveys the state of the art in mobile agent research. Students and researchers can use the book as an introduction to the concepts and possibilities of this field and as an overview of ongoing research. Developers can use it to identify the capabilities of the technology to decide if mobile agents are the right solution for them. Practioners can also gain hands-on experience in programming mobile agents through exploration of the source code for a complete mobile agent environment available through the companion website.*Summarizes the state of the art in mobile agent research*Identifies the benefits...

  8. Analysis and Optimization for Mobile Agent Communication

    Institute of Scientific and Technical Information of China (English)

    YANGBo; LIUDayou

    2005-01-01

    Communication performance is one of the most important factors affecting the efficiency of mobile agent system. Only traditional optimization techniques for communication performance are not enough, especially in large-scale intelligent mobile agent system, so more intelligent optimization techniques are needed. In the background, the paper studies communication of mobile agent system from the viewpoint of performance. The paper makes qualitative and quantitative analysis of four important factors that will affect the communication performance of mobile agent system and presents the communication performance optimization model. The model hasthree primary functions. First, the model provides a formalism method to describe the communication task and process of mobile agent. Second, the model provides a means to make quantitative analysis of the performance of mobile agent system. Third, the model can plan out an optimal communication scheme for mobile agent to minimize the cost of whole communication. The model could thus be a building block for the optimization of the communication behavior of mobile agent.

  9. Migración de código en ambientes distribuidos : Plataforma Aglets

    OpenAIRE

    García Martín, Santiago

    2010-01-01

    Sumario de la presentación: I. Definición del Problema II. Conceptos Generales III. Debug IV. Sistema de carga de clases en Java V. AgletClassLoader VI. Entendiendo la Excepción VII. Resolviendo el problema VIII.Conclusión

  10. Novel Fast Encryption Algorithms for Multimedia Transmission over Mobile WiMax Networks

    Directory of Open Access Journals (Sweden)

    M.A. Mohamed

    2012-11-01

    Full Text Available Security support is mandatory for any communication networks. For wireless systems, security support is even more important to protect the users as well as the network. Since wireless medium is available to all, the attackers can easily access the network and the network becomes more vulnerable for the user and the network service provider. Worldwide Interoperability for Microwave Access (WiMax is going to be an emerging wireless technology nowadays. With the increasing popularity of Broadband internet, wireless networking market is thriving. In the IEEE 802.16e, security has been considered as the main issue during the design of the protocol. However, security mechanism of WiMax still remains an open research field. WiMax is relatively a new technology not deployed widely to justify the evidence of threats, risk and vulnerability in real situations. In this paper, a research is described three proposed chaos encryption techniques for multimedia transmission over Mobile WiMax physical and MAC layers. At first a global overview of the technology WiMax is given followed by an explanation of traditional encryption techniques used in WiMax. Then the proposed encryption techniques are presented with its chaos systems. Next, these techniques will be applied to different multimedia contents to compare between them and traditional techniques such as AES, IDEA, Blowfish and DES.

  11. Mobile Agents in Networking and Distributed Computing

    CERN Document Server

    Cao, Jiannong

    2012-01-01

    The book focuses on mobile agents, which are computer programs that can autonomously migrate between network sites. This text introduces the concepts and principles of mobile agents, provides an overview of mobile agent technology, and focuses on applications in networking and distributed computing.

  12. Security Measures to Protect Mobile Agents

    Science.gov (United States)

    Dadhich, Piyanka; Govil, M. C.; Dutta, Kamlesh

    2010-11-01

    The security issues of mobile agent systems have embarrassed its widespread implementation. Mobile agents that move around the network are not safe because the remote hosts that accommodate the agents initiates all kinds of attacks. These hosts try to analyze the agent's decision logic and their accumulated data. So, mobile agent security is the most challenging unsolved problems. The paper analyzes various security measures deeply. Security especially the attacks performed by hosts to the visiting mobile agent (the malicious hosts problem) is a major obstacle that prevents mobile agent technology from being widely adopted. Being the running environment for mobile agent, the host has full control over them and could easily perform many kinds of attacks against them.

  13. Decentralized network management based on mobile agent

    Institute of Scientific and Technical Information of China (English)

    李锋; 冯珊

    2004-01-01

    The mobile agent technology can be employed effectively for the decentralized management of complex networks. We show how the integration of mobile agent with legacy management protocol, such as simple network management protocol (SNMP), leads to decentralized management architecture. HostWatcher is a framework that allows mobile agents to roam network, collect and process data, and perform certain adaptive actions. A prototype system is built and a quantitative analysis underlines the benefits in respect to reducing network load.

  14. Secure Route Structures for Parallel Mobile Agents Based Systems Using Fast Binary Dispatch

    Directory of Open Access Journals (Sweden)

    Yan Wang

    2005-01-01

    Full Text Available In a distributed environment, where a large number of computers are connected together to enable the large-scale sharing of data and computing resources, agents, especially mobile agents, are the tools for autonomously completing tasks on behalf of their owners. For applications of large-scale mobile agents, security and efficiency are of great concern. In this paper, we present a fast binary dispatch model and corresponding secure route structures for mobile agents dispatched in parallel to protect the dispatch routes of agents while ensuring the dispatch efficiency. The fast binary dispatch model is simple but efficient with a dispatch complexity of O(log2n. The secure route structures adopt the combination of public-key encryption and digital signature schemes and expose minimal route information to hosts. The nested structure can help detect attacks as early as possible. We evaluated the various models both analytically and empirically.

  15. Security of Mobile Agents on the Internet.

    Science.gov (United States)

    Corradi, Antonio; Montanari, Rebecca; Stefanelli, Cesare

    2001-01-01

    Discussion of the Internet focuses on new programming paradigms based on mobile agents. Considers the security issues associated with mobile agents and proposes a security architecture composed of a wide set of services and components capable of adapting to a variety of applications, particularly electronic commerce. (Author/LRW)

  16. The Research of Mobile phone Entrance Guard System Model based on the Encryption Two-dimensional Code

    Directory of Open Access Journals (Sweden)

    Chu Jianli

    2013-09-01

    Full Text Available This article designs a new mobile-phone entrance guard system, uses the encryption two-dimensional code for identity authentication. Different from other similar products in the market, this system does not rely on specialized mobile phone card or NFC (near field communication module. It can be directly realized through mobile-phone software, and it can be operated simple and safer. This article designs the whole system model, includes structure, function and workflow. It also analyzes and researches the main algorithms used in the system, which include security policy algorithm, encryption two-dimensional code algorithm and image recognition algorithm. Finally, it provides the solution method for the problem in the experimental simulation. It also evaluated and summarized the experimental results.

  17. The Research on Mobile-agent Security

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    Mobile agent technology offers a new computing paradigm in which a program, in the form of a software agent, can suspend its execution in a host computer, transfer itself to another agent-enabled host in the network, and resume execution of the new host. As the sophistication of mobile software has increased with the time, so have the associated threats to security. This paper provides an overview of the range of threats facing the designers of mobile agent. The paper also identifies generic security objectives, and a range of measures for countering the identified threats.

  18. Information Service Model with Mobile Agent Supported

    Institute of Scientific and Technical Information of China (English)

    邹涛; 王继成; 张福炎

    2000-01-01

    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.

  19. NETWORK MANAGEMENT WITH SECURED MOBILE AGENT

    Institute of Scientific and Technical Information of China (English)

    迈克尔; 徐良贤

    2002-01-01

    Network management scheme must consider security challenges for the Mobile Agent paradigm to be accepted in the Internet computing world. Techniques to provide security solutions have been proposed and some have achieved good results. For example, it is possible to launch a code with a guarantee that it cannot attack the hosting sites. The main problem remaining, however, is protecting the mobile code against malicious service providers, the host problem. This paper proposed a Mobile Agent management scheme in a hierarchical level that provides to user a reliable and flexible global access to internet/network information services. We further described a protection mechanism to Mobile Agents against malicious hosts. As an effort to address host problems we first identify the kinds of attack that may be performed by malicious hosts, and propose a mechanism to prevent these attacks. At each agent host we introduce a trusted third party entity on each server called Secure Service Station (SSS) to carry out security actions.

  20. An Application of Mobile Agent System in Network Management

    Institute of Scientific and Technical Information of China (English)

    YANGChen-xiang; DUJun-ping; YINYi-xin

    2004-01-01

    This paper describes an application of a reusable mobile agent system in network management. A mobile agent reusable system is constructed to realize a new method in forming mobile agent systems. By using this method, an agent can change its route dynamically without making any change to its specific behavior. By classifying mobile agents into two categories, the task agent can be reusable in different networks. In this way, a mobile agent system can easily carry out network management tasks.

  1. Safe motion planning for mobile agents: A model of reactive planning for multiple mobile agents

    Energy Technology Data Exchange (ETDEWEB)

    Fujimura, Kikuo.

    1990-01-01

    The problem of motion planning for multiple mobile agents is studied. Each planning agent independently plans its own action based on its map which contains a limited information about the environment. In an environment where more than one mobile agent interacts, the motions of the robots are uncertain and dynamic. A model for reactive agents is described and simulation results are presented to show their behavior patterns. 18 refs., 2 figs.

  2. J2ME accessing distributed database based on mobile agent%基于移动agent的J2ME分布式数据库访问

    Institute of Scientific and Technical Information of China (English)

    茹蓓; 肖云鹏

    2011-01-01

    J2ME mobile device, as its limited computational and mnemonic ability, does not support database system actually. At present, most systems use J2ME-J2EE-database solution, but the linear solution does not adapt to characteristic of wireless environment such as highly delay and disconnection frequently. By using and extending agent theory, proposed a new method of four layers C/S J2ME accessing distributed database scheme, and developed a prototype system by open source project named Aglets. The result of evaluation shows that the scheme is practical, speedy and robust.%由于移动手持设备有限的计算和存储能力,J2ME没有提供真正意义上的数据库系统,目前大多数系统采用J2ME-J2EE-数据库系统的解决方案,然而这种线性部署并不适合无线计算环境下频繁断接、高延时等特性.通过借鉴移动agent思想并对其功能进行扩充,提出基于移动agent的J2ME分布式数据库四层C/S访问机制,并在开源Aglets平台基础上开发了一个分布式通信录系统原型,实验评估显示该方案有效地提高了J2ME设备对分布式数据库的访问效率和健壮性.

  3. COMPARATIVE ANALYSIS OF DIFFERENT ENCRYPTION TECHNIQUES IN MOBILE AD HOC NETWORKS (MANETS

    Directory of Open Access Journals (Sweden)

    Amal Ahmad

    2016-03-01

    Full Text Available In this paper a detailed analysis of Data Encryption Standard (DES, Triple DES (3DES and Advanced Encryption Standard (AES symmetric encryption algorithms in MANET was done using the Network Simulator 2 (NS-2 in terms of energy consumption, data transfer time, End-to-End delay time and throughput with varying data sizes. Two simulation models were adopted: the first simulates the network performance assuming the availability of the common key, and the second simulates the network performance including the use of the Diffie-Hellman Key Exchange (DHKE protocol in the key management phase. The obtained simulation results showed the superiority of AES over DES by 65%, 70% and 83% in term of the energy consumption, data transfer time, and network throughput respectively. On the other hand, the results showed that AES is better than 3DES by approximately 90% for all of the performance metrics. Based on these results the AES was the recommended encryption scheme.

  4. AN AGENT BASED TRANSACTION PROCESSING SCHEME FOR DISCONNECTED MOBILE NODES

    Directory of Open Access Journals (Sweden)

    J.L. Walter Jeyakumar

    2010-12-01

    Full Text Available We present a mobile transaction framework in which mobile users can share data which is stored in the cache of a mobile agent. This mobile agent is a special mobile node which coordinates the sharing process. The proposed framework allows mobile affiliation work groups to be formed dynamically with a mobile agent and mobile hosts. Using short range wireless communication technology, mobile users can simultaneously access the data from the cache of the mobile agent. The data Access Manager module at the mobile agent enforces concurrency control using cache invalidation technique. This model supports disconnected mobile computing allowing mobile agent to move along with the Mobile Hosts. The proposed Transaction frame work has been simulated in Java 2 and performance of this scheme is compared with existing frame works.

  5. Brahms Mobile Agents: Architecture and Field Tests

    Science.gov (United States)

    Clancey, William J.; Sierhuis, Maarten; Kaskiris, Charis; vanHoof, Ron

    2002-01-01

    We have developed a model-based, distributed architecture that integrates diverse components in a system designed for lunar and planetary surface operations: an astronaut's space suit, cameras, rover/All-Terrain Vehicle (ATV), robotic assistant, other personnel in a local habitat, and a remote mission support team (with time delay). Software processes, called agents, implemented in the Brahms language, run on multiple, mobile platforms. These mobile agents interpret and transform available data to help people and robotic systems coordinate their actions to make operations more safe and efficient. The Brahms-based mobile agent architecture (MAA) uses a novel combination of agent types so the software agents may understand and facilitate communications between people and between system components. A state-of-the-art spoken dialogue interface is integrated with Brahms models, supporting a speech-driven field observation record and rover command system (e.g., return here later and bring this back to the habitat ). This combination of agents, rover, and model-based spoken dialogue interface constitutes a personal assistant. An important aspect of the methodology involves first simulating the entire system in Brahms, then configuring the agents into a run-time system.

  6. 移动Agent的应用%Application of Mobile Agent

    Institute of Scientific and Technical Information of China (English)

    王继宏; 胡建平

    2000-01-01

    Based on the active ,individuality of the mobile Agent and low-consumption of the network bandwidth,mobile Agent is the newly born network communication and complete distributed computing mode. It has largely developing potential.. This paper presents the role of mobile Agent in present application and discusses the typical mobile Agent area based on the characters of mobile Agent. We provide a new way to classify the applications.

  7. Mobile Agent PLM Architecture for extended enterprise

    Directory of Open Access Journals (Sweden)

    Abdelhak Boulaalam

    2011-01-01

    Full Text Available Nowadays manufacturers are under increased pressure to have an add value for their products to struggle the low-cost production in emerging countries. Distributed control and Intelligent Product are a new and exciting opportunity to build more effective process networks for a wide range of applications in logistics and product development, Radio Frequency Identification is applied increasingly; this technology applied in conjunction with the Mobile Agent system can bring more values in managing and control the lifecycle of products by optimizing the three essential factors: cost, quality and deadline for the survival of a company in the competitive manufacturing world. In this paper we propose Mobile Agent PLM Architecture for extended enterprise, based on Mobile Agent and RFID or, more generally, Product Embedded Information Devices (PEID, for tracking and managing the information of the whole product lifecycle in the extended enterprise, and to satisfy new requirements for increased integrability, traceability, adaptability, extendibility, and closed-loop PLM. Mobile Agents are suitable for tracking information in distributing environment and the mobility aspect, at any time and any place. This paper proposes a first architecture based on these technologies.

  8. Secure Communication and Information Exchange using Authenticated Ciphertext Policy Attribute-Based Encryption in Mobile Ad-hoc Network

    Directory of Open Access Journals (Sweden)

    Samsul Huda

    2016-08-01

    Full Text Available MANETs are considered as suitable for commercial applications such as law enforcement, conference meeting, and sharing information in a student classroom and critical services such as military operations, disaster relief, and rescue operations. Meanwhile, in military operation especially in the battlefield in freely medium which naturally needs high mobility and flexibility. Thus, applying MANETs make these networks vulnerable to various types of attacks such aspacket eavesdropping, data disseminating, message replay, message modification, and especially privacy issue. In this paper, we propose a secure communication and information exchange in MANET with considering secure adhoc routing and secure information exchange. Regarding privacy issue or anonymity, we use a reliable asymmetric encryption which protecting user privacy by utilizing insensitive user attributes as user identity, CP-ABE (Ciphertext-Policy Attribute-Based Encryption cryptographic scheme. We also design protocols to implement the proposed scheme for various battlefied scenarios in real evironment using embedded devices. Our experimental results showed that the additional of HMAC (Keyed-Hash Message Authentication Code and AES (Advanced Encryption standard schemes using processor 1.2GHz only take processing time about 4.452 ms,  we can confirm that our approach by using CP-ABE with added HMAC and AES schemes make low overhead.

  9. Dispatching mobile Agents for DDM applicationss

    Institute of Scientific and Technical Information of China (English)

    LI Xi-ning; Guillaume Autran

    2008-01-01

    Techniques for mining information from distributed data sources accessible over the Internet are a growing area of research. The mobile Agent paradigm opens a new door for distributed data mining and knowledge discovery applications. In this paper we present the design of a mobile agent system which couples service discovery, using a logical language based application programming interface, and database access. Combining mobility with database access provides a means to create more efficient data mining applications. The processing of data is moved to network wide data locations instead of the traditional approach of bringing huge amount of data to the processing location. Our proposal aims at implementing system tools that will enable intelligent mobile Agents to roam the Internet searching for distributed data services. Agents access the data, discover patterns, extract useful information from facts recorded in the databases, then communicate local results back to the user. The user then generates a global data model through the aggregation of results provided by all Agents. This overcomes barriers posed by network congestion, poor security, and unreliability.

  10. FY1995 community support by mobile agents; 1995 nendo mobile agent ni yoru community keisei shien

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1997-03-01

    The purpose is to develop fundamental technologies for navigation systems and mobile computing systems in museums, theme parks and cities. Concretely, we implement software agents into the mobile computing environment which consists of PHS, mobile computers and mobile robots, and realize various functions to access regional information. We have studied on Communityware which supports human activities and communities by using mobile agents implemented into mobile computers and town robots. The mobile agents, which intelligently process information obtained in physical and virtual worlds, access regional information which is omnipresent in the environment. With respect to the approach using mobile computers, we have provided one hundred mobile computers in the international conference on multiagent systems 1996 and carried out the first experimentation of mobile computing in the world. The mobile computer has two functions: Community Viewer which displays interactions between members of communities and Social Matchmaker which supports to hold meetings by searching for people who have common interests. With respect to the approach using town robots, we have developed a robot system which can robustly behave in a complex outdoor environment by using vision agents embedded in the environment. The system aims at support of people in streets. (NEDO)

  11. A Forward Integrity and Itinerary Secrecy Protocol for Mobile Agents

    Institute of Scientific and Technical Information of China (English)

    GUAN Huanmei; MENG Xuejun; ZHANG Huanguo

    2006-01-01

    The security problem of mobile agents is widely being discussed. The problem which protects mobile agents from malicious hosts is difficult to solve, because a host has access to the complete internal state of an agent. Forward integrity in mobile agents guarantees that offers contained in a mobile agent from previously visited host can not be modified by a malicious host. Itinerary secrecy can prevent mobile agent from being passively attack. This paper proposes a new forward integrity and itinerary secrecy protocol for mobile agent. The protocol can also resist collusion truncation attack.

  12. Application of mobile scanning agent in the network security

    Institute of Scientific and Technical Information of China (English)

    闵君; 冯珊; 唐超; 梅纲

    2004-01-01

    To enhance the security of network systems, puts forward a kind of software agent is put forward, which has the induction ability of network frameworks and the ability of behavior independence. It is mobile scanning agent. More attentions is paid to expound how to design and realize mobile scanning agent. Besides, it is also explained the programs of mobile scanning agent system. In the end, it expects mobile scanning agent.

  13. RESEARCH ON FAST IMAGE ENCRYPTION METHOD FOR MOBILE TERMINALS%移动终端的图像快速加密方法研究

    Institute of Scientific and Technical Information of China (English)

    赵戈; 万玉晴

    2015-01-01

    According to the requirements of intelligent terminals of mobile Internet in image encryption,this article puts forward the four selection principles in regard to encryption approaches for images of mobile terminals based on analysing the traditional methods of image pixel positions scrambling and pixel greyscale value encryption by transformation,and based on these principles we design the encryption algorithm with dual image keys and dual scrambling which combines the Arnold conversion and the chaotic sequence encryption.Meanwhile,in order to improve computing speed of encryption and decryption,and to realise fast image encryption and decryption of mobile terminals,based on periodic verification and theoretical derivation of Arnold conversion,we derive a fast look-up table method for image encryption and decryption matrix of mobile terminals.It is proved by application that the algorithm can satisfy the requirement of transaction processing in image encryption of mobile terminals.%针对移动互联网智能终端的图像加密需求,在对传统的图像像素位置置乱以及像素灰度值变换加密等方法的分析与实验基础上,提出移动终端图像加密方法的四项选择原则,并按此原则设计Arnold变换和混沌序列加密相结合的图像双重密钥双重置乱加密算法。同时,为了提高加解密运算速度,实现移动终端快速图像加解密工作,在基于对Arnold变换的周期性验证和理论推导,得出移动终端的图像加解密矩阵的快速查表法。应用证明,该算法能满足事务处理对移动终端图像加密的需求。

  14. Design and Implementation on the Image Encryption of Mobile Communication System%移动通信的图像加密系统设计与实现

    Institute of Scientific and Technical Information of China (English)

    万玉晴

    2015-01-01

    针对智能手机图像的加密应用需求与目前台式加密系统不能很好地适用于移动终端平台等问题,本文设计了一套适用于智能手机的图像加密系统,结合基于混沌算法的图像加密技术,提出了适用于移动端应用的低配置、快速实现图像加密的技术方法。实验结果表明,系统采用的并行多线程技术路线,可以提高大像素图像的加解密效率三倍以上,为智能手机的实时图像加密提供了一种可实现解决方案。%This article presents an image encryption system for smart phones that can solve the problems such as the application requirements of image encryption of smart phones and the current desktop encryption systems are not quite suitable for mobile terminal platform. It propose a technical method with low allocation and fast image encryption for mobile application with the use of image encryption technology based on chaos algorithm. The experiment result shows that the parallel multithreading technical strategy adopted by the system can improve over three times encryption and decryption efficiency of large pixel images. So it can provide a realizable solution for the real-time image encryption of smart phones.

  15. Consensus in networks of mobile communicating agents

    Science.gov (United States)

    Baronchelli, Andrea; Díaz-Guilera, Albert

    2012-01-01

    Populations of mobile and communicating agents describe a vast array of technological and natural systems, ranging from sensor networks to animal groups. Here, we investigate how a group-level agreement may emerge in the continuously evolving network defined by the local interactions of the moving individuals. We adopt a general scheme of motion in two dimensions and we let the individuals interact through the minimal naming game, a prototypical scheme to investigate social consensus. We distinguish different regimes of convergence determined by the emission range of the agents and by their mobility, and we identify the corresponding scaling behaviors of the consensus time. In the same way, we rationalize also the behavior of the maximum memory used during the convergence process, which determines the minimum cognitive/storage capacity needed by the individuals. Overall, we believe that the simple and general model presented in this paper can represent a helpful reference for a better understanding of the behavior of populations of mobile agents.

  16. Consensus in evolving networks of mobile agents

    Science.gov (United States)

    Baronchelli, Andrea; Díaz-Guilera, Albert

    2012-02-01

    Populations of mobile and communicating agents describe a vast array of technological and natural systems, ranging from sensor networks to animal groups. Here, we investigate how a group-level agreement may emerge in the continuously evolving networks defined by the local interactions of the moving individuals. We adopt a general scheme of motion in two dimensions and we let the individuals interact through the minimal naming game, a prototypical scheme to investigate social consensus. We distinguish different regimes of convergence determined by the emission range of the agents and by their mobility, and we identify the corresponding scaling behaviors of the consensus time. In the same way, we rationalize also the behavior of the maximum memory used during the convergence process, which determines the minimum cognitive/storage capacity needed by the individuals. Overall, we believe that the simple and general model presented in this talk can represent a helpful reference for a better understanding of the behavior of populations of mobile agents.

  17. Transportation dynamics on networks of mobile agents

    CERN Document Server

    Yang, Han-Xin; Xie, Yan-Bo; Lai, Ying-Cheng; Wang, Bing-Hong

    2011-01-01

    Most existing works on transportation dynamics focus on networks of a fixed structure, but networks whose nodes are mobile have become widespread, such as cell-phone networks. We introduce a model to explore the basic physics of transportation on mobile networks. Of particular interest are the dependence of the throughput on the speed of agent movement and communication range. Our computations reveal a hierarchical dependence for the former while, for the latter, we find an algebraic power law between the throughput and the communication range with an exponent determined by the speed. We develop a physical theory based on the Fokker-Planck equation to explain these phenomena. Our findings provide insights into complex transportation dynamics arising commonly in natural and engineering systems.

  18. RESEARCH ON SECURITY PROTOCOL FOR COLLABORATING MOBILE AGENTS IN NETWORK INTRUSION DETECTION SYSTEMS

    Directory of Open Access Journals (Sweden)

    Olumide Simeon Ogunnusi

    2013-01-01

    Full Text Available Despite the popularity of mobile agents in academic and commercial arena, the security issues associated with them have hindered their adoption on large scale distributed applications. However, researchers are making relentless effort to overcome the security impediments so that the interesting properties inherent in mobile agent application, especially in the field of intrusion detection, can be harnessed. Such properties include: adaptability, autonomous nature, low bandwidth utilization, latency eradication, mobility and intelligence. A number of protocols have been developed by researchers for different key distribution techniques to enhance their performance and to protect communicating entities against malicious attacks that can hinder their activities. However, they do not take into account the availability and fault tolerance of the protocols in case of any possible attack despite the authentication methods offered by encryption. This study therefore, proposes a fault-tolerant key distribution protocol for distributed mobile agents (communicating entities in network intrusion detection system to facilitate hitch-free collaboration geared towards intrusive packets detection in Wireless Local Area Network (WLAN.

  19. Evolution of Cooperation among Mobile Agents

    CERN Document Server

    Chen, Zhuo; Cai, Yun-Ze; Xu, Xiao-Ming

    2010-01-01

    We study the effects of mobility on the evolution of cooperation among self-driven agents, which move at a constant speed v in a two-dimensional plane without boundary restrictions and average directions of neighbors within a radius R for collective motion. Adopting the the prisoner's dilemma game and the snowdrift game as metaphors, we find that cooperation can be maintained and even enhanced for small v and modest values of R, when compared with the case that all agents do not move. Depending on the payoff parameter and the game model, the cooperator frequency may show resonant behavior, or reach an absorbing state of all cooperators as the increase of R and the initial population density. These findings may help understanding the role of individual motion in social systems.

  20. Wireless network topology for monitoring mobile agents

    Science.gov (United States)

    Fraser, Matthew J.; James, Daniel A.; Thiel, David V.

    2005-02-01

    A wireless network of multiple sensor nodes for monitoring large numbers of mobile agents is described and investigated. Wireless monitoring provides time critical information from a number of data sources allowing near real-time analysis of the collected data. The developed wireless network provides a moderate data rate, is able to support many wireless nodes and is a low power solution. Novel network structures have been developed to satisfy all of these requirements. This paper evaluates a number of currently available wireless communication protocols, concluding that a Bluetooth wireless network satisfies the above criteria. To support a large number of devices, topologies using inter-piconet and piconet sharing methods have been developed. These network structures are outlined in detail and have been developed with the current Bluetooth hardware limitations in mind. The proposed wireless networks have been developed to be implemented with current Bluetooth hardware. A summary of network performance is included for each developed network structure, and from these figures an appropriate network structure has been chosen that satisfies the requirements of a wireless sensor network for monitoring mobile agents.

  1. Application and Development of Mobile Agent in AN

    Institute of Scientific and Technical Information of China (English)

    XU Li; ZHENG Bao-yu

    2004-01-01

    Active Networks represent a significant step in the evolution of packet-switched networks. It aims to move dynamic computation within the network. Mobile agent technology is a novel paradigm for distributed computation. This paper discusses the applicability of mobile agent technology for the development of active networks, both security policy and resource management, and other expected application as well. Based on the discussion, it describes a general mobile agent based Active Network (AN) architecture at last.

  2. Intelligent Detection System framework using Mobile agents

    CERN Document Server

    Jaisankar, N; Swamy, K Durai

    2010-01-01

    An intrusion detection system framework using mobile agents is a layered framework mechanism designed to support heterogeneous network environments to identify intruders at its best. Traditional computer misuse detection techniques can identify known attacks efficiently, but perform very poorly in other cases. Anomaly detection has the potential to detect unknown attacks; however, it is a very challenging task since its aim is to detect unknown attacks without any priori knowledge about specific intrusions. This technology is still at its early stage. The objective of this paper is that the system can detect anomalous user activity. Existing research in this area focuses either on user activity or on program operation but not on both simultaneously. In this paper, an attempt to look at both concurrently is presented. Based on an intrusion detection framework [1], a novel user anomaly detection system has been implemented and conducted several intrusion detection experiments in a simulated environment by analy...

  3. Secure Web Transaction with Anonymous Mobile Agent over Internet

    Institute of Scientific and Technical Information of China (English)

    WANG ChangJie(王常杰); ZHANG FangGuo(张方国); WANG YuMin(王育民)

    2003-01-01

    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.

  4. The Study and Perspective of Mobile Agent Security

    Institute of Scientific and Technical Information of China (English)

    MU Hong; WANG Ru-chuan; WANG Hai-yan

    2004-01-01

    Security is an important issue for the widespread deployment of applications based on software agent technology. It is generally agreed that without the proper countermeasures in place, use of agent-based applications will be severely impeded. So many projects have focused on the security issues of mobile agent and many mechanisms have been proposed to solve the security problem. This paper discusses the security issues and the countermeasures. Then it points out some directions for the research of the mobile agent security.

  5. Mobile operating system encryption scheme based on virtual disk%基于虚拟磁盘的携带型操作系统加密方案

    Institute of Scientific and Technical Information of China (English)

    覃冠杰; 马建设; 程雪岷

    2014-01-01

    针对移动硬盘的加密系统分区无法被正确辨识而导致误格式化的问题,应用文件系统过滤驱动技术,结合硬盘主引导程序及分区表机理,对现有的基于虚拟磁盘的移动硬盘加解密方案进行了改进,在加密分区包含可运行操作系统的情况下,增加了盘符自动隐藏及恢复的功能。以开源加密软件Truecrypt为例,利用安装了视窗操作系统的固态移动硬盘进行测试。结果表明,在不影响加密操作系统正常运行的同时,盘符自动隐藏及恢复功能避免了用户的误格式化操作,从而提高了移动硬盘加密系统分区的安全性和隐蔽性。%For the problem of accidentally formatting encrypted system partitions within mobile hard disks, which is caused by misidentification of the running operating system, the authors improved the virtual disk encryption and decryption program for mobile hard disks, using file system filter driver technology and the mechanism of master boot program and partition table. Auto-hide-and-recover feature was added to the program in case that the encrypted partition contained an operating system. Taking Truecrypt for example, and using solid-state mobile hard disks which installed Windows system for test, the result shows that auto-hide-and-recover feature can avoid users from formatting the encrypted partition by mistake while the encrypted system can run properly. The result indicates that the improved program can enhance the security and concealment of encrypted system partitions within mobile hard disks.

  6. MODEL-BASED PERFORMANCE EVALUATION APPROACH FOR MOBILE AGENT SYSTEMS

    Institute of Scientific and Technical Information of China (English)

    Li Xin; Mi Zhengkun; Meng Xudong

    2004-01-01

    Claimed as the next generation programming paradigm, mobile agent technology has attracted extensive interests in recent years. However, up to now, limited research efforts have been devoted to the performance study of mobile agent system and most of these researches focus on agent behavior analysis resulting in that models are hard to apply to mobile agent systems. To bridge the gap, a new performance evaluation model derived from operation mechanisms of mobile agent platforms is proposed. Details are discussed for the design of companion simulation software, which can provide the system performance such as response time of platform to mobile agent. Further investigation is followed on the determination of model parameters. Finally comparison is made between the model-based simulation results and measurement-based real performance of mobile agent systems. The results show that the proposed model and designed software are effective in evaluating performance characteristics of mobile agent systems. The proposed approach can also be considered as the basis of performance analysis for large systems composed of multiple mobile agent platforms.

  7. Mobile Agents for Web-Based Systems Management.

    Science.gov (United States)

    Bellavista, Paolo; Corradi, Antonio; Tarantino, Fabio; Stefanelli, Cesare

    1999-01-01

    Discussion of mobile agent technology that overcomes the limits of traditional approaches to the management of global Web systems focuses on the MAMAS (mobile agents for the management of applications and systems) management environment that uses JAVA as its implementation language. Stresses security and interoperability. (Author/LRW)

  8. Key-Insulated Undetachable Digital Signature Scheme and Solution for Secure Mobile Agents in Electronic Commerce

    Directory of Open Access Journals (Sweden)

    Yang Shi

    2016-01-01

    Full Text Available Considering the security of both the customers’ hosts and the eShops’ servers, we introduce the idea of a key-insulated undetachable digital signature, enabling mobile agents to generate undetachable digital signatures on remote hosts with the key-insulated property of the original signer’s signing key. From the theoretical perspective, we provide the formal definition and security notion of a key-insulated undetachable digital signature. From the practical perspective, we propose a concrete scheme to secure mobile agents in electronic commerce. The scheme is mainly focused on protecting the signing key from leakage and preventing the misuse of the signature algorithm on malicious servers. Agents do not carry the signing key when they generate digital signatures on behalf of the original signer, so the key is protected on remote servers. Furthermore, if a hacker gains the signing key of the original signer, the hacker is still unable to forge a signature for any time period other than the key being accessed. In addition, the encrypted function is combined with the original signer’s requirement to prevent the misuse of signing algorithm. The scheme is constructed on gap Diffie–Hellman groups with provable security, and the performance testing indicates that the scheme is efficient.

  9. Agent-based Multimodal Interface for Dynamically Autonomous Mobile Robots

    Science.gov (United States)

    2003-01-01

    Agent-based Multimodal Interface for Dynamically Autonomous Mobile Robots Donald Sofge, Magdalena Bugajska, William Adams, Dennis...computing paradigm for integrated distributed artificial intelligence systems on autonomous mobile robots (Figure 1). Figure 1 – CoABS Grid...Architecture for Dynamically Autonomous Mobile Robots The remainder of the paper is organized as follows. Section 2 describes our integrated AI

  10. Research on Mixed Encryption Authentication

    Institute of Scientific and Technical Information of China (English)

    SUN Zhi-xin; WANG Ru-chuan; WANG Shao-di

    2003-01-01

    With the development of network techniques, the problem of network security is also arising as we enjoy its open convenience. There are many developed methods to overcome this problem. Identity authentication is one of these important measures. The authentication methods of traditional symmetric cryptogram systems and asymmetric cryptogram systems have both advantages and defects. This paper brings forward a Mixed Encryption Model for Authentication (MEMA), which has obvious advantages compared to the two traditional methods. MEMA model can be used widely in opening network environment such as mobile agent systems, multi-agents security safeguard systems and other situations in which identity authentication of users are needed. At last, the paper also presents the MEMA model's structure and implementation of an experimental system.

  11. Mobile Agent Based on Internet%基于Internet的移动Agent

    Institute of Scientific and Technical Information of China (English)

    徐练; 周龙骧; 王翰虎

    2001-01-01

    Mobile Agent is a hybrid of Internet technology and Artificial Intelligence. Today there are tremendous amount of information resources distributing among Internet ,but it's very difficult to find the wanted-thing. Internet has increasingly become a vital compute platform for electron commercial which has highly popular through the world. Developing new Internet-based application programs such as shopping online,e-business,search engine etc pose new task. Mobile Agent proffers new clue and technology. Considering Internet,this thesis conducts a research on architecture,mobile mechanism in mobile Agent system. Based on the Agent theory research and engineering ,the thesis focuses point at researching Mobile Agents,which have the ability to rove through the network. Using OMG's "Mobile Agent Facility Specification" for reference,we design a model architecture of Mobile Agent System. Based on the architecture ,the article analyzes the key technology and gives methods to resolving them ,emphases on mobility mechanism of Agent and implementing it. At last a model of java-based Mobile Agent System is given.

  12. Pivotal Technology Research of Grid Based on Mobile Agent

    Institute of Scientific and Technical Information of China (English)

    CHEN Hong-wei; WANG Ru-chuan

    2004-01-01

    Grid Based on Mobile Agent is a new grid scheme. The purpose of the paper is to solve the pivotal technology of Grid Based on Mobile Agent ( GBMA) combined with thought of Virtual Organization ( VO). In GBMA, virtual organization is viewed as the basic management unit of the grid, and mobile agent is regarded as an important interactive means. Grid architecture, grid resource management and grid task management are the core technology problem of GBMA. The simulation results show that Inter- VO pattern has the obvious advantage because it can make full use of resources from other virtual organizations in GBMA environment.

  13. The mobile agent rendezvous problem in the ring

    CERN Document Server

    Kranakis, Evangelos; Marcou, Euripides

    2010-01-01

    Mobile agent computing is being used in fields as diverse as artificial intelligence, computational economics and robotics. Agents' ability to adapt dynamically and execute asynchronously and autonomously brings potential advantages in terms of fault-tolerance, flexibility and simplicity. This monograph focuses on studying mobile agents as modelled in distributed systems research and in particular within the framework of research performed in the distributed algorithms community. It studies the fundamental question of how to achieve rendezvous, the gathering of two or more agents at the same n

  14. Retrieving Information from the Invisible Web Using Mobile Agents

    Directory of Open Access Journals (Sweden)

    Fabien-Kenzo Sato

    2005-01-01

    Full Text Available This study proposes a model of information retrieval on the invisible Web by using the mobile agent paradigm. The developed architecture uses the power of a search engine to provide a list of sites of the invisible Web which are likely to be relevant and launches a dynamic search on these sites, thanks to mobile agents. To compare and experiment in real conditions, two versions were implemented: a version using the traditional client/server paradigm and a version using mobile agents. Client/server tests on actual Websites generated satisfactory qualitative results. A series of comparative experiments of the two versions implemented were carried out using a test site. Results show that the mobile agent version generates much less traffic and is thus faster than the client/server version, especially with low bandwidth. Moreover, as the mobile agents carry out calculations on the server rather than on the client’s site, this approach relieves the resources of the client terminal. Thus, the mobile agent approach seems particularly advantageous in the case of weak resource terminals such as PDAs.

  15. Adaptive Hybrid Mobile Agent Protocol for Wireless Multihop Internet Access

    Directory of Open Access Journals (Sweden)

    A. Velmurugan

    2006-01-01

    Full Text Available Internet-based Mobile Ad Hoc Networking (MANET is an emerging technology that supports self-organizing mobile networking infrastructures. This is expected to be of great use in commercial applications for the next generation Internet users. A number of technical challenges are faced today due to the heterogeneous, dynamic nature of this hybrid MANET. A new hybrid routing scheme AODV_ALMA is proposed, which act simultaneously combining mobile agents to find path to the gateway to establish connection with Internet host and on-demand distance vector approach to find path in local MANET is one of the unique solution. An adaptive gateway discovery mechanism based on mobile agents making use of pheromone value, pheromone decay time and balance index is used to estimate the path and next hop to the gateway. The mobile nodes automatically configure the address using mobile agents first selecting the gateway and then using the gateway prefix address. The mobile agents are also used to track changes in topology enabling high network connectivity with reduced delay in packet transmission to Internet. The performance tradeoffs and limitations with existing solutions for various mobility conditions are evaluated using simulation."

  16. Fault Tolerance Mobile Agent System Using Witness Agent in 2-Dimensional Mesh Network

    Directory of Open Access Journals (Sweden)

    Ahmad Rostami

    2010-09-01

    Full Text Available Mobile agents are computer programs that act autonomously on behalf of a user or its owner and travel through a network of heterogeneous machines. Fault tolerance is important in their itinerary. In this paper, existent methods of fault tolerance in mobile agents are described which they are considered in linear network topology. In the methods three agents are used to fault tolerance by cooperating to each others for detecting and recovering server and agent failure. Three types of agents are: actual agent which performs programs for its owner, witness agent which monitors the actual agent and the witness agent after itself, probe which is sent for recovery the actual agent or the witness agent on the side of the witness agent. Communication mechanism in the methods is message passing between these agents. The methods are considered in linear network. We introduce our witness agent approach for fault tolerance mobile agent systems in Two Dimensional Mesh (2D-Mesh Network. Indeed Our approach minimizes Witness-Dependency in this network and then represents its algorithm.

  17. A Flexible and Reliable Architecture for Mobile Agent Security

    Directory of Open Access Journals (Sweden)

    Ghossoon M.W. Al-Saadoon

    2009-01-01

    Full Text Available Problem statement: Wireless application protocol is a protocol that makes it possible to surf the Internet from a cellular phone or other handheld wireless. Many of us that surf the Internet from home with a 56 kbps modem think that it is slow and a cell phone only uses 9.6 kbps so WAP has to take the lesser bandwidth into consideration. For this reason, this study proposed a flexible and reliable system to be implemented by using the characteristic of agents “mobile agent” through wireless application protocol for identification of distributed Intruder. The problem appears when the limitation of data transfer when the distributed systems are used (which includes the heterogeneous database through internet. For this reason the suggested approach will be the solution to the problem of WAP for mobile agent. Approach: The purpose of this study was to present the ability for dispatch mobile agent from a host to carry out operations directly to the remote point of interest, thus agent’s scans provide an appropriate response which is faster than a hierarchical IDS that communicates with a central coordinator based elsewhere on the network. Results: The methodology was used in order to understand the mobile agent mechanism and will introduce the distributed computing mechanisms that are intended for large scale distributed systems. Since the distributed security agent models system was built using mobile agent and net, this will develop small applications for data stores, like sequential query language server. The method used the algorithms built refer to each part of the structure and the rules that implemented (users and the security agent system roles. The result was simulating the intended for business roles for both commercial and government modules, which included the solution to the problem and to architecture to be more flexible and reliable. Conclusion/Recommendations: One of main conclusion for the mobile agent used WAP protocol: To make

  18. An Agent-Based Auction Protocol on Mobile Devices

    Directory of Open Access Journals (Sweden)

    Yu-Fang Chung

    2014-01-01

    Full Text Available This paper proposes an English auction protocol to preserve a secure, fair, and effective online auction environment, where the operations are integrated with mobile agent technology for bidders participating in online auctions. The protocol consists of four participants, namely, registration manager, agent house, auction house, and bidder.

  19. Epidemic spreading induced by diversity of agents' mobility

    CERN Document Server

    Zhou, Jie; Chew, Lock Yue; Lai, Choy Heng

    2012-01-01

    In this paper, we study into the impact of the preference of an individual for public transport on the spread of infectious disease, through a quantity known as the public mobility. Our theoretical and numerical results based on a constructed model reveal that if the average public mobility of the agents is fixed, an increase in the diversity of the agents' public mobility reduces the epidemic threshold, beyond which an enhancement in the rate of infection is observed. Our findings provide an approach to improve the resistance of a society against infectious disease, while preserving the utilization rate of the public transportation system.

  20. An authenticated encrypted routing protocol against attacks in mobile ad-hoc networks

    Directory of Open Access Journals (Sweden)

    C.C. Suma

    2017-01-01

    Full Text Available Mobile Ad hoc Network is stated as a cluster that contains Digital data terminals and they are furnished with the wireless transceivers which are able to communicate with each other with no need of any fixed architecture or concentrated authority. Security is one of the major issues in MANETs because of vast applications such as Military Battlefields, emergency and rescue operations[10]. In order to provide anonymous communications and to identify the malicious nodes in MANETs, many authors have proposed different secure routing protocols but each protocol have their own advantages and disadvantages. In MANTE’s each and every node in the communicating network functions like router and transmits the packets among the networking nodes for the purpose of communication[11]. Sometimes nodes may be attacked by the malicious nodes or the legitimate node will be caught by foemen there by controlling and preventing the nodes to perform the assigned task or nodes may be corrupted due to loss of energy. So, due to these drawbacks securing the network under the presence of adversaries is an important thing. The existing protocols were designed with keeping anonymity and the identification of vicious nodes in the network as the main goal. For providing better security, the anonymity factors such as Unidentifiability and Unlinkability must be fully satisfied[1]. Many anonymous routing schemes that concentrate on achieving anonymity are proposed in the past decade and they provides the security at different levels and also provides the privacy protection that is of different cost. In this paper we consider a protocol called Authenticated Secure Routing Protocol proposed which provides both security & anonymity. Anonymity is achieved in this protocol using Group signature. Over all by using this protocol performance in terms of throughput as well as the packet dropping rate is good compared to the other living protocols.

  1. QoS Negotiation and Renegotiation Based on Mobile Agents

    Institute of Scientific and Technical Information of China (English)

    ZHANG Shi-bing; ZHANG Deng-yin

    2006-01-01

    The Quality of Service (QoS) has received more and more attention since QoS becomes increasingly important in the Internet development. Mobile software agents represent a valid alternative to the implementation of strategies for the negotiation. In this paper, a QoS negotiation and renegotiation system architecture based on mobile agents is proposed. The agents perform the task in the whole process. Therefore, such a system can reduce the network load, overcome latency, and avoid frequent exchange information between clients and server. The simulation results show that the proposed system could improve the network resource utility about 10%.

  2. DEVELOPING A NEW MECHANISM FOR LOCATING AND MANAGING MOBILE AGENTS

    Directory of Open Access Journals (Sweden)

    AHMED Y. YOUSUF

    2012-10-01

    Full Text Available There is a trade- off between the agent tracking process and the message delivery process in locating mobile agent systems. In the proposed system we try to strike a balance between these two processes. Communication in Multiagent system requires an efficient mechanism to manage these communications. Reliability and transparency are the design goal for any modern mechanism. In this paper we develop a new mechanism to manage the communication among autonomous mobile agents. This mechanism has the ability to manage agent mobility in an efficient, scalable and transparent way. So no message is lost and all transitions are transparent to the user. The architecture of the proposed mechanism is described and the naming, communication, localization and re-localization ways are given.

  3. Multi-agent cooperative intrusion response in mobile adhoc networks

    Institute of Scientific and Technical Information of China (English)

    Yi Ping; Zou Futai; Jiang Xinghao; Li Jianhua

    2007-01-01

    The nature of adhoc networks makes them vulnerable to security attacks. Many security technologies such as intrusion prevention and intrusion detection are passive in response to intrusions in that their countermeasures are only to protect the networks, and there is no automated network-wide counteraction against detected intrusions. the architecture of cooperation intrusion response based multi-agent is propose. The architecture is composed of mobile agents. Monitor agent resides on every node and monitors its neighbor nodes. Decision agent collects information from monitor nodes and detects an intrusion by security policies. When an intruder is found in the architecture, the block agents will get to the neighbor nodes of the intruder and form the mobile firewall to isolate the intruder. In the end, we evaluate it by simulation.

  4. Secure Mobile Agent from Leakage-Resilient Proxy Signatures

    Directory of Open Access Journals (Sweden)

    Fei Tang

    2015-01-01

    Full Text Available A mobile agent can sign a message in a remote server on behalf of a customer without exposing its secret key; it can be used not only to search for special products or services, but also to make a contract with a remote server. Hence a mobile agent system can be used for electronic commerce as an important key technology. In order to realize such a system, Lee et al. showed that a secure mobile agent can be constructed using proxy signatures. Intuitively, a proxy signature permits an entity (delegator to delegate its signing right to another entity (proxy to sign some specified messages on behalf of the delegator. However, the proxy signatures are often used in scenarios where the signing is done in an insecure environment, for example, the remote server of a mobile agent system. In such setting, an adversary could launch side-channel attacks to exploit some leakage information about the proxy key or even other secret states. The proxy signatures which are secure in the traditional security models obviously cannot provide such security. Based on this consideration, in this paper, we design a leakage-resilient proxy signature scheme for the secure mobile agent systems.

  5. A Secure Mobile Agent System against Tailgating Attacks

    Directory of Open Access Journals (Sweden)

    P. Marikkannu

    2011-01-01

    Full Text Available Problem statement: A lot of real time applications have extended their hands towards Mobile Agents to accomplish various tasks, due to its flexibility in its functionalities. Since Mobile Agent Systems are used in a distributed environment, it is obvious that they may be vulnerable to various security threats. Most of the security threats faced by the mobile agent systems are overcome by existing security algorithms and architectures. One of the major threats which are not of much focus in a mobile agent system is the Tailgating attack. Approach: In this study, mobile agent system architecture has been proposed to overcome Tailgating. The proposed architecture uses the mechanism of Dual Check-point to preclude Tailgating attacks. Also, to support the mechanism, we use fragmentation and defragmentation techniques. This assures a free flow of data within the system. Results: The results obtained prove that the system is much efficient in its operations as well is immune to Tailgating attacks. Conclusion: The security of the system is improved with the implementation of the Dual Check-point method.

  6. A mobile agent approach for secure integrated medical information systems.

    Science.gov (United States)

    Liu, Chia-Hui; Chung, Yu-Fang; Chiang, Te-Wei; Chen, Tzer-Shyong; Wang, Sheng-De

    2012-10-01

    Different patient-related information in medical organizations is the primary reference for medical personnel diagnosing, treating, and caring patients. With the rapid development of information technology, paper-based medical records have gradually been changed to electronic forms. However, different medical organizations present individual system specifications and data-saving formats so that the medical information of the same patient cannot be exchanged, shared, and securely accessed. In order not to largely change the present medical information systems as well as not to increase abundant costs, Virtual Integrated Medical-information Systems (VIMS) is proposed to assist various hospitals in information exchange. Furthermore, with Mobile Agent, the dispersed medical information can be securely integrated. It presents confidentiality, non-repudiation, source authentication, and integrity in network transmission. Virtual Integrated Medical-information Systems (VIMS) is a virtual electronic integration system combined with Mobile Agent technology. With the features of independence, adaptability, mobility, objectives, and autonomy, Mobile Agent is applied to overcome the problems from heterogeneous systems. With the features, the over-dispersed medical records can be integrated. Moreover, Mobile Agent can ensure the instantaneity and usability of medical records from which doctors can make the most appropriate evaluation and diagnoses. It will avoid the waste of medical resources, such as repetition medication, as well as become the reference of further consultation or health check. Not only can it improve the medical care quality, but it can be provided for medical research.

  7. The Geographic Information Grid System Based on Mobile Agent

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    We analyze the deficiencies of current application systems, and discuss the key requirements of distributed Geographic Information service (GIS). We construct the distributed GIS on grid platform. Considering the flexibility and efficiency, we integrate the mobile agent technology into the system. We propose a new prototype system, the Geographic Information Grid System (GIGS) based on mobile agent. This system has flexible services and high performance, and improves the sharing of distributed resources. The service strategy of the system and the examples are also presented.

  8. Mobile Agents需求及体系结构%MOBILE AGENTS' REQUIREMENT AND ARCHITECTURE

    Institute of Scientific and Technical Information of China (English)

    何炎祥; 宋志凯; 李锋

    2000-01-01

    Mobile Agents 是分布系统的一种新体系结构和实现方法.Mobile Agents适用的应用有:网络管理、信息获取、远程设备控制、电子商务、移动计算等.本文主要从底层讨论了Mobile Agents的运行需求和体系结构.

  9. Emergence of metapopulations and echo chambers in mobile agents

    CERN Document Server

    Starnini, Michele; Baronchelli, Andrea

    2016-01-01

    Multi-agent models often describe populations segregated either in the physical space, i.e. subdivided in metapopulations, or in the ecology of opinions, i.e. partitioned in echo chambers. Here we show how the interplay between homophily and social influence controls the emergence of both kinds of segregation in a simple model of mobile agents, endowed with a continuous opinion variable. In the model, physical proximity determines a progressive convergence of opinions but differing opinions result in agents moving away from each others. This feedback between mobility and social dynamics determines to the onset of a stable dynamical metapopulation scenario where physically separated groups of like-minded individuals interact with each other through the exchange of agents. The further introduction of confirmation bias in social interactions, defined as the tendency of an individual to favor opinions that match his own, leads to the emergence of echo chambers where different opinions can coexist also within the ...

  10. Distributed formation stabilization for mobile agents using virtual tensegrity structures

    NARCIS (Netherlands)

    Yang, Qingkai; Cao, Ming; Fang, Hao; Chen, Jie

    2015-01-01

    This paper investigates the distributed formation control problem for a group of mobile Euler-Lagrange agents to achieve global stabilization by using virtual tensegrity structures. Firstly, a systematic approach to design tensegrity frameworks is elaborately explained to confine the interaction rel

  11. Interaction with autonomous, mobile agents in a hazard monitoring context

    NARCIS (Netherlands)

    Cramer, H.; Evers, V.; Winterboer, A.; Pavlin, G.; Maris, M.; Groen, F.; Olsen Jr., D.R.; Arthur, R.B.; Hinckley, K.; Ringel Morris, M.; Hudson, S.E.; Greenberg, S.

    2009-01-01

    This paper discusses our ongoing research on user interaction with autonomous mobile agents. The overarching project, DIADEM, involves the development of a (semi-)autonomous system that detects potential environmental hazards in heavily populated urban-industrial areas by using input from both a

  12. Mobile Agent-Based Directed Diffusion in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Victor C. M. Leung

    2007-01-01

    Full Text Available In the environments where the source nodes are close to one another and generate a lot of sensory data traffic with redundancy, transmitting all sensory data by individual nodes not only wastes the scarce wireless bandwidth, but also consumes a lot of battery energy. Instead of each source node sending sensory data to its sink for aggregation (the so-called client/server computing, Qi et al. in 2003 proposed a mobile agent (MA-based distributed sensor network (MADSN for collaborative signal and information processing, which considerably reduces the sensory data traffic and query latency as well. However, MADSN is based on the assumption that the operation of mobile agent is only carried out within one hop in a clustering-based architecture. This paper considers MA in multihop environments and adopts directed diffusion (DD to dispatch MA. The gradient in DD gives a hint to efficiently forward the MA among target sensors. The mobile agent paradigm in combination with the DD framework is dubbed mobile agent-based directed diffusion (MADD. With appropriate parameters set, extensive simulation shows that MADD exhibits better performance than original DD (in the client/server paradigm in terms of packet delivery ratio, energy consumption, and end-to-end delivery latency.

  13. Smart Agent Based Mobile Tutoring and Querying System

    Directory of Open Access Journals (Sweden)

    Suresh Sankaranarayanan

    2012-08-01

    Full Text Available With our busy schedules today and the rising cost of education there is a need to find a convenient and cost effective means of maximizing our educational/training experiences. New trends in the delivery/access of information are becoming more technology based in all areas of society with education being no exception. The ubiquitous use of mobile devices has led to a boom in m-commerce. Mobile devices provide many services in commercial environments such as mobile banking, mobile purchasing, mobile learning, etc. It is therefore fitting that we seek to use mobile devices as a platform in delivering our convenient and cost effective solution. The proposed agent based Mobile tutoring system seeks to provide a student with a rich learning experience that will provide them with the relevant reading material based on their stage of development which allows them to move at their own pace. The system will allow the user to be able to ask certain questions and get explanations as if they were interacting with a human tutor but with the added benefit of being able to do this anytime in any location via their mobile phone.

  14. High Efficiency and Light Mobile Electronic Business System Based on Mobile Agent Middleware

    Institute of Scientific and Technical Information of China (English)

    ZHANG Yunyong; LIU Jinde

    2004-01-01

    Mobile Network technology has been being the research focus during the 1990's.The middleware technology is imported for the sake of running distributed transaction smoothly.In this paper,a mobile agent based middleware high efficiency mobile electronic business oriented middleware (HEMEBOM) is designed and implemented based on the requirement and background of collaborative electronic business.Its architecture,elements and excellent properties are mainly focused.Then high efficiency mobile electronic business systemμMcommerce is built using HEMEBOM.

  15. Encryption is Useless!?

    CERN Multimedia

    IT Department

    2011-01-01

    This week FTP (the file transfer protocol) celebrated its 40th birthday - and will hopefully retire soon! While a nice and simple means of transferring files, it is totally insecure: both the transferred contents and the authentication password are transfered unencrypted. FTP is not the only protocol that transfers data unencrypted: standard web traffic (“HTTP”) and e-mail (“SMTP”) are not encrypted either. Not an issue? Think again! Nowadays, we all use wireless Ethernet from our laptops and mobile phones. This means that your traffic can be intercepted by anyone*… What if I could your web browsing history, read your last e-mail to your boyfriend/girlfriend, or see which commands you’ve just executed? I could easily intercept your Facebook session… If this worries you, check for secrecy and encryption. Usually this is shown by an “S” in your communication protocol:   · “HTTPS&...

  16. Mobile Agent Based Hierarchical Intrusion Detection System in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Surraya Khanum

    2012-01-01

    Full Text Available Security mechanism is a fundamental requirement of wireless networks in general and Wireless Sensor Networks (WSN in particular. Therefore, it is necessary that this security concern must be articulate right from the beginning of the network design and deployment. WSN needs strong security mechanism as it is usually deployed in a critical, hostile and sensitive environment where human labour is usually not involved. However, due to inbuilt resource and computing restriction, security in WSN needs a special consideration. Traditional security techniques such as encryption, VPN, authentication and firewalls cannot be directly applied to WSN as it provides defence only against external threats. The existing literature shows that there seems an inverse relationship between strong security mechanism and efficient network resource utilization. In this research article, we have proposed a Mobile Agent Based Hierarchical Intrusion Detection System (MABHIDS for WSN. The Proposed scheme performs two levels of intrusion detection by utilizing minimum possible network resources. Our proposed idea enhance network lifetime by reducing the work load on Cluster Head (CH and it also provide enhanced level of security in WSN.

  17. Mobile Agents for Service Personalization in Smart Environments

    Directory of Open Access Journals (Sweden)

    Iván Marsá-Maestre

    2008-05-01

    Full Text Available Service personalization is an important goal for any smart environment. Comfort systems may be adjusted in an automatic way when a given user is present, and multimedia devices may offer a music or movie catalog with favorite contents or may even pick one of them for the user. To achieve this goal, we propose a Service Oriented Architecture implementation based on multiagent systems. We specially take advantage of the mobility features of software agents. In particular, we have developed a hierarchical, agent-based solution intended to be applicable to different smart space scenarios, ranging from small environments, like smart homes or smart offices, to large smart spaces like cities. In this paper we describe the global architecture and focus on our approach to service personalization using mobile agents that follow the users as they move through different smart spaces.

  18. A Mobile Agent-Based Prototype of Heterogeneous Distributed Virtual Environment Systems

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    Mobile agents provide a new method for the distributed computation. This paper presents the advantages of using mobile agents in a distributed virtual environment (DVE) sys tem, and describes the architecture of heterogeneous computer's distributed virtual environment system (HCNVES) designed to populate some mobile agents as well as stationary agents. Finally, the paper introduces how heterogeneous computer network communication is to be realized.

  19. Mobile Agents and Their Security Problems%Mobile Agent及其安全性问题

    Institute of Scientific and Technical Information of China (English)

    刘建勋; 李仁发; 张申生

    2000-01-01

    该文首先简单介绍了mobile agent的概念与mobile agent 所具有的一些优点,并介绍了mobile agent系统的应用领域及研究现状,然后详细分析了mobile agent系统的安全性问题,即(1)保护运行mobile agent的主机或实体不受恶意Agent的攻击;(2)保护mobile agent不受恶意的运行环境以及不协作的或者有敌意的其它Agent的攻击.并对已有的一些解决方案的思想作了分析介绍.

  20. Dynamic encryption method

    DEFF Research Database (Denmark)

    2013-01-01

    Disclosed is a method of transmitting a data set using encryption, wherein the method comprises the steps of: selecting a first encryption technique, wherein said first encryption technique comprises a first encryption algorithm for encrypting plain data into cipher data, and a first decryption...... algorithm for on provision of a specific key, decrypting cipher data and reproduce plain data; encrypting the first data package comprising plain data, using a first encryption program implementing the first encryption algorithm of said first encryption technique, creating a first encrypted data package...... comprising cipher data; obtaining a first decryption program; and transmitting said first decryption program and said first encrypted data package to a receiver, wherein the first decryption, upon provision of the specific key and the first encrypted data package, will decrypt the cipher data in the first...

  1. Control of Synchronization Regimes in Networks of Mobile Interacting Agents

    Science.gov (United States)

    Perez-Diaz, Fernando; Zillmer, Ruediger; Groß, Roderich

    2017-05-01

    We investigate synchronization in a population of mobile pulse-coupled agents with a view towards implementations in swarm-robotics systems and mobile sensor networks. Previous theoretical approaches dealt with range and nearest-neighbor interactions. In the latter case, a synchronization-hindering regime for intermediate agent mobility is found. We investigate the robustness of this intermediate regime under practical scenarios. We show that synchronization in the intermediate regime can be predicted by means of a suitable metric of the phase response curve. Furthermore, we study more-realistic K -nearest-neighbor and cone-of-vision interactions, showing that it is possible to control the extent of the synchronization-hindering region by appropriately tuning the size of the neighborhood. To assess the effect of noise, we analyze the propagation of perturbations over the network and draw an analogy between the response in the hindering regime and stable chaos. Our findings reveal the conditions for the control of clock or activity synchronization of agents with intermediate mobility. In addition, the emergence of the intermediate regime is validated experimentally using a swarm of physical robots interacting with cone-of-vision interactions.

  2. Research on the key technology of mobile ERP

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    A new business management mode-agile & convenient management mode (ACM) was proposed because of large scale mobile computing and mobile business. As an efficient approach to ACM, Mobile ERP(MERP), including its concept and four-tier architecture was introduced firstly. Then, the two key technologies of implementing MERP about message service and wireless WAP service were developed. Meanwhile, an official MERP system was also implemented based on our CERP software system by aglets. And it was applied by Henan Tongli Cement Group in China. In comparison with the traditional ERP system, the new system could improve the efficiency and level of management, and reduce the management cost of enterprise.

  3. Image encryption a communication perspective

    CERN Document Server

    Abd El-Samie, Fathi E; Elashry, Ibrahim F; Shahieen, Mai H; Faragallah, Osama S; El-Rabaie, El-Sayed M; Alshebeili, Saleh A

    2013-01-01

    Presenting encryption algorithms with diverse characteristics, Image Encryption: A Communication Perspective examines image encryption algorithms for the purpose of secure wireless communication. It considers two directions for image encryption: permutation-based approaches encryption and substitution-based approaches.Covering the spectrum of image encryption principles and techniques, the book compares image encryption with permutation- and diffusion-based approaches. It explores number theory-based encryption algorithms such as the Data Encryption Standard, the Advanced Encryption Standard,

  4. Using Mobile Agents and Overlay Networks to Secure Electrical Networks

    Energy Technology Data Exchange (ETDEWEB)

    Dawes, Neal A.; Prosser, Bryan J.; Fulp, Errin W.; McKinnon, Archibald D.

    2013-02-11

    ABSTRACT The use of wandering, mobile agents can provide a robust approach for managing, monitoring, and securing electrical distribution networks. However, the topological structure of electrical networks can affect system performance. For example, if the multi-agent system relies on a regular inspection rate (on average, points of interest are inspected with equal frequency), then locations that are not well connected will on average be inspected less frequently. This paper discusses creation and use of overlay networks that create a virtual grid graph can provide faster coverage and a more uniform average agent sampling rate. Using overlays agents wander a virtual neighborhood consisting of only points of interest that are interconnected in a regular fashion (each point has the same number of neighbors). Experimental results will show that an overlay can often provide better network coverage and a more uniform inspection rate, which can improve cyber security by providing a faster detection of threats.

  5. Using Mobile Agents and Overlay Networks to Secure Electrical Netoworks

    Energy Technology Data Exchange (ETDEWEB)

    Dawes, Neal A.; Prosser, Bryan J.; Fulp, Errin W.; McKinnon, Archibald D.

    2013-04-01

    ABSTRACT The use of wandering, mobile agents can provide a robust approach for managing, monitoring, and securing electrical distribution networks. However, the topological structure of electrical networks can affect system performance. For example, if the multi-agent system relies on a regular inspection rate (on average, points of interest are inspected with equal frequency), then locations that are not well connected will on average be inspected less frequently. This paper discusses creation and use of overlay networks that create a virtual grid graph can provide faster coverage and a more uniform average agent sampling rate. Using overlays agents wander a virtual neighborhood consisting of only points of interest that are interconnected in a regular fashion (each point has the same number of neighbors). Experimental results will show that an overlay can often provide better network coverage and a more uniform inspection rate, which can improve cyber security by providing a faster detection of threats

  6. Swarm Dynamics of a Group of Mobile Autonomous Agents

    Institute of Scientific and Technical Information of China (English)

    LIU Bo; CHU Tian-Guang; WANG Long; WANG Zhan-Feng

    2005-01-01

    @@ We propose a simple swarm model to study collective behaviour ofa group of mobile autonomous agents interact ing through a long range attraction and short range repulsion function. It is shown that the individuals (agents) will aggregate and eventually form a cohesive cluster of finite size around the swarm centre in a finite time, and the size depends only on the parameters of the swarm model. Furthermore, it is also shown that all the individuals will converge to equilibrium positions of the swarm model, and thus the configuration of the swarm converges to a constant constellation. Numerical simulations are also worked out to illustrate the analytical results.

  7. Building Distributed Web GIS: A Mobile-Agent Based Approach

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    The diversity of GISs and the wide-spread availability of WWWhave l e d to an increasing amount of research on integrating a variety of heterogeneous and autonomous GISs in a cooperative environment to construct a new generation o f GIS characterizing in open architecture, distributed computation, interoperabi lity, and extensibility. Our on-going research project MADGI S (Mobile Agent based Distributed Geographic Information System) is reported, in which we pro pose the architecture of MADGIS to meet the requirements of integrating distribu ted GIS applications under Internet environment. We first describe the architect ure of MADGIS, and detailed discussions focusing on the structure of client site , server site and mobile agent in MADGIS. Then we explore key techniques for MAD GIS implementation.

  8. Mobile Agent Based Framework for Integrating Digital Library System

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    Few of the current approaches to achieve the integration of digital library system have considered the influence of network factors on quality of service for the integration system of digital libraries. For this reason, a mobile agent based framework for integrating digital library system is proposed. Based on this framework, a prototype system is implemented and the key technique for it are described. Compared with the current approaches, using mobile agent technique to achieve the integration of digital library system can not only avoid transmitting a lot of data on the network, lower the dependence on network bandwidth for the system, but also improve the quality of service for the integration system of digital libraries in intermitted or unreliable network connection settings.

  9. Applying Web Services with Mobile Agents for Computer Network Management

    Directory of Open Access Journals (Sweden)

    Mydhili K.Nair

    2011-03-01

    Full Text Available The exponential rise in complexity of the underlying network elements of a computer network makes itsManagement an intricate, multifaceted and complex problem to solve. With every passing decade, newtechnologies are developed to ease this problem of Network Management. The last decade of the premillenniumera saw the peak of CORBA and Mobile Agent Based implementations, while the first decadeof post millennium saw the emergence of Web Services. All of these technologies evolved as independent,self-contained implementation streams. There is a genuine dearth in finding authentic research outcomeswhere quantifiable, measureable benefits of convergence of these technologies applied to NetworkManagement are put forth. This paper aims to fill this research gap. Here we put forth the experimentalresults obtained of a framework we developed in-house for Network Management that combined twoseemingly divergent distributed computing technologies, namely, Web Services and Mobile Agents.

  10. The Study of Mobile Agent Technology%移动Agent技术研究

    Institute of Scientific and Technical Information of China (English)

    董红斌; 石纯一

    2000-01-01

    Mobile Agent is a new distributed computing model. This articte introduces the concepts,origin,behavior,development language,general structure of mobile agent,and attempts to present an account of current research efforts.

  11. Load Balancing on Open Networks: A Mobile Agent Approach

    Directory of Open Access Journals (Sweden)

    R. B. Patel

    2006-01-01

    Full Text Available In order to disperse the load on a Web server, generally the server cluster is configured to distribute access requests, or mirror servers are distributed geographically on different networks. Use of the Internet and the World-Wide-Web (WWW has become widespread in recent years and mobile agent technology has proliferated at an equally rapid rate to evenly distribute the requests to web servers through load balancing. There are various loads balancing policies came into picture. Primitive one is Message Passing Interface (MPI. Its wide availability and portability make it an attractive choice, however the communication requirements are sometimes inconventior and inefficient when implementing the primitives provided by MPI. Mobile agent (MA based approach have the merits of high flexibility, efficiency, low network traffic, less communication latency as well as highly asynchronous. In this study we present dynamic load balancing using mobile agent technology in which when a node is overloaded, task migrates to less utilized nodes so as to share the workload. However, the decision of which nodes receive migrating task is made in real-time by design and implementation of a framework called Platform for Load balancing (PLB. It is implemented on PMADE (A Platform for Mobile Agent Distribution and Execution. PLB integrated web servers can dispatch MAs to retrieve load information and accomplish load redistribution on all servers. The performance evaluation demonstrates that the PLB framework provides a foundation to develop efficient load balancing schemes on wide range of web server systems from cluster to open network and the results of a comparison of PLB, with some existing ones, is also reported.

  12. Emergence of metapopulations and echo chambers in mobile agents

    Science.gov (United States)

    Starnini, Michele; Frasca, Mattia; Baronchelli, Andrea

    2016-08-01

    Multi-agent models often describe populations segregated either in the physical space, i.e. subdivided in metapopulations, or in the ecology of opinions, i.e. partitioned in echo chambers. Here we show how both kinds of segregation can emerge from the interplay between homophily and social influence in a simple model of mobile agents endowed with a continuous opinion variable. In the model, physical proximity determines a progressive convergence of opinions but differing opinions result in agents moving away from each others. This feedback between mobility and social dynamics determines the onset of a stable dynamical metapopulation scenario where physically separated groups of like-minded individuals interact with each other through the exchange of agents. The further introduction of confirmation bias in social interactions, defined as the tendency of an individual to favor opinions that match his own, leads to the emergence of echo chambers where different opinions coexist also within the same group. We believe that the model may be of interest to researchers investigating the origin of segregation in the offline and online world.

  13. Employ a Mobile Agent for Making a Payment

    Directory of Open Access Journals (Sweden)

    Yan Wang

    2008-01-01

    Full Text Available The mobile agent paradigm offers flexibility and autonomy to e-commerce applications. But it is challenging to employ a mobile agent to make a payment due to the security consideration. In this paper, we propose a new agent-assisted secure payment protocol, which is based on SET payment protocol and aims at enabling the dispatched consumer-agent to autonomously sign contracts and make the payment on behalf of the cardholder after having found the best merchant, without the possibility of disclosing any secret to any participant. This is realized by adopting the Signature-Share scheme, and employing a Trusted Third Party (TTP. In the proposed protocol, the principle that each participant knows what is strictly necessary for his/her role is followed as in SET. In addition, mechanisms have been devised for preventing and detecting double payment, overspending and overpayment attacks. Finally the security properties of the proposed protocol are studied analytically. In comparison with other existing models, the proposed protocol is more efficient and can detect more attacks.

  14. Percolation and cooperation with mobile agents: Geometric and strategy clusters

    CERN Document Server

    Vainstein, Mendeli H; Arenzon, Jeferson J

    2014-01-01

    We study the conditions for persistent cooperation in an off-lattice model of mobile agents playing the Prisoner's Dilemma game with pure, unconditional strategies. Each agent has an exclusion radius rP, which accounts for the population viscosity, and an interaction radius rint, which defines the instantaneous contact network for the game dynamics. We show that, differently from the rP=0 case, the model with finite-sized agents presents a coexistence phase with both cooperators and defectors, besides the two absorbing phases, in which either cooperators or defectors dominate. We provide, in addition, a geometric interpretation of the transitions between phases. In analogy with lattice models, the geometric percolation of the contact network (i.e., irrespective of the strategy) enhances cooperation. More importantly, we show that the percolation of defectors is an essential condition for their survival. Differently from compact clusters of cooperators, isolated groups of defectors will eventually become extin...

  15. A MOBILE AGENT BASED INTRUSION DETECTION SYSTEM ARCHITECTURE FOR MOBILE AD HOC NETWORKS

    Directory of Open Access Journals (Sweden)

    Binod Kumar Pattanayak

    2014-01-01

    Full Text Available Applications of Mobile Ad Hoc Networks (MANETs have become extensively popular over the years among the researchers. However, the dynamic nature of MANETs imposes a set of challenges to its efficient implementation in practice. One of such challenges represents intrusion detection and prevention procedures that are intended to provide secured performance of ad hoc applications. In this study, we introduce a mobile agent based intrusion detection and prevention architecture for a clustered MANET. Here, a mobile agent resides in each cluster of the ad hoc network and each cluster runs a specific application at any point of time. This application specific approach makes the network more robust to external intrusions directed at the nodes in an ad hoc network.

  16. Optical image encryption topology.

    Science.gov (United States)

    Yong-Liang, Xiao; Xin, Zhou; Qiong-Hua, Wang; Sheng, Yuan; Yao-Yao, Chen

    2009-10-15

    Optical image encryption topology is proposed based on the principle of random-phase encoding. Various encryption topological units, involving peer-to-peer, ring, star, and tree topologies, can be realized by an optical 6f system. These topological units can be interconnected to constitute an optical image encryption network. The encryption and decryption can be performed in both digital and optical methods.

  17. Encrypted integer division

    NARCIS (Netherlands)

    Veugen, P.J.M.

    2010-01-01

    When processing signals in the encrypted domain, homomorphic encryption can be used to enable linear operations on encrypted data. Integer division of encrypted data however requires an additional protocol with the server and will be relatively expensive. We present new solutions for dividing encryp

  18. Application of searchable encryption in mobile learning based on cloud computing%可搜索加密在云计算移动学习中的应用

    Institute of Scientific and Technical Information of China (English)

    刘文哲; 朱文焌; 何恩惠; 翟嫚杰; 岳志芳

    2016-01-01

    Mobile learning based on the cloud computing is a way of learning on the basis of traditional mobile learning, which uses cloud platform to realize the functions of resource retrieval. In order to ensure the security of data, resource publishers upload resources in encrypted form to the cloud server. But the cloud server is unable to effectively manage the encrypted resources, which makes the ciphertext search results can not reach the expected level. In view of the above problems, and on the basis of the cloud computing of mobile learning model, this paper uses searchable encryption method to build a searchable encryption of mobile learning model, so as to ensure privacy of study resources.%基于云计算的移动学习是在传统移动学习的基础上,利用云平台实现资源检索功能的一种学习方式。为了保证数据的安全性,资源发布者将学习资源以密文形式上传至云服务器。但云服务器无法对加密资源进行有效管理,使得密文搜索结果不能到达预期水平。针对以上问题,文章在云计算的移动学习模型基础上,利用可搜索加密的方法,建立可搜索加密的移动学习模型,从而确保学习资源的隐私性。

  19. New Framework for Improving Big Data Analysis Using Mobile Agent

    Directory of Open Access Journals (Sweden)

    Youssef M. ESSA

    2014-01-01

    Full Text Available the rising number of applications serving millions of users and dealing with terabytes of data need to a faster processing paradigms. Recently, there is growing enthusiasm for the notion of big data analysis. Big data analysis becomes a very important aspect for growth productivity, reliability and quality of services (QoS. Processing of big data using a powerful machine is not efficient solution. So, companies focused on using Hadoop software for big data analysis. This is because Hadoop designed to support parallel and distributed data processing. Hadoop provides a distributed file processing system that stores and processes a large scale of data. It enables a fault tolerant by replicating data on three or more machines to avoid data loss.Hadoop is based on client server model and used single master machine called NameNode. However, Hadoop has several drawbacks affecting on its performance and reliability against big data analysis. In this paper, a new framework is proposed to improve big data analysis and overcome specified drawbacks of Hadoop. These drawbacks are replication tasks, Centralized node and nodes failure. The proposed framework is called MapReduce Agent Mobility (MRAM. MRAM is developed by using mobile agent and MapReduce paradigm under Java Agent Development Framework (JADE.

  20. Security in Fog Computing through Encryption

    Directory of Open Access Journals (Sweden)

    Akhilesh Vishwanath

    2016-05-01

    Full Text Available Cloud computing is considered as one of the most exciting technology because of its flexibility and scalability. The main problem that occurs in cloud is security. To overcome the problems or issues of security, a new technique called fog-computing is evolved. As there are security issues in fog even after getting the encrypted data from cloud, we implemented the process of encryption using AES algorithm to check how it works for the fog. So far, to our analysis AES algorithm is the most secured process of encryption for security. Three datasets of different types are considered and applied the analysed encryption technique over those datasets. On validation, entire data over datasets is being accurately encrypted and decrypted back as well. We took android mobile as an edge device and deployed the encryption over datasets into it. Further, performance of encryption is evaluated over selected datasets for accuracy if the entire data is correctly encrypted and decrypted along with the time, User load, Response time, Memory Utilization over file size. Further best and worst cases among the datasets are analysed thereby evaluating the suitability of AES in fog.

  1. Research on Mobile Agent System Construction%移动Agent系统构建研究

    Institute of Scientific and Technical Information of China (English)

    贾志勇; 谢立

    2003-01-01

    Mobile agent technology has strong adaptability to the status of network and executing environment, and provides a flexible and uniform framework for Web and distributed applications.Mobile agent system, as the foundation of agent computing, should provide the basic supports like executing support, agent migration, andcommunication, as well the extensive supports like naming service, security, fault tolerance, interoperation,application development and management tools. Based on the analysis of current mobile agent system, this article discusses these supports deeply, and also points out the main challenges to the development of mobile agent system.

  2. Decentralized formation control of mobile agents: A unified framework

    Science.gov (United States)

    Chen, Fei; Chen, Zengqiang; Liu, Zhongxin; Xiang, Linying; Yuan, Zhuzhi

    2008-08-01

    This paper studies the formation control problem for systems consisting of multiple mobile agents that are described by first-order differential equations and second-order differential equations respectively. The following issues are investigated: bounded input, disturbance, and time delay. In derivation of the main results, a blend of graph-theoretic and system-theoretic tools is employed, where local potential functions and LaSalle’s Invariant Principle play central roles. Finally, numerical examples which support the analytical results very well are also included.

  3. Mobile intelligent agent entity model towards QoS guarantee

    Institute of Scientific and Technical Information of China (English)

    LI Jie; WANG Ru-chuan; BIAN Zhen-gai

    2006-01-01

    Implementing a flexible configuration of the QoS parameter in a distributed computing network has become a problem due to the weak scalability of current approaches.In an effort to solve this problem,an inner basic model of an intelligent agent (IA) is presented.The IA functionality was extended by introducing a primarily mobile agent.A QoS guarantee scheme was subsequently designed and implemented based on the model as well.By utilizing the proposed scheme,the IA can sense,predict and configure the data flow traffic.Since the communicating ability was considered and provided,the competition among different devices could be eliminated effectively and the global traffic can be optimized.The results of the simulations have shown that the proposed model can provide a QoS guarantee.

  4. An Experimental Approach for Optimising Mobile Agent Migrations

    CERN Document Server

    Gavalas, Damianos

    2010-01-01

    The field of mobile agent (MA) technology has been intensively researched during the past few years, resulting in the phenomenal proliferation of available MA platforms, all sharing several common design characteristics. Research projects have mainly focused on identifying applications where the employment of MAs is preferable compared to centralised or alternative distributed computing models. Very little work has been made on examining how MA platforms design can be optimised so as the network traffic and latency associated with MA transfers are minimised. The work presented in this paper addresses these issues by investigating the effect of several optimisation ideas applied on our MA platform prototype. Furthermore, we discuss the results of a set of timing experiments that offers a better understanding of the agent migration process and recommend new techniques for reducing MA transfers delay.

  5. Degradative encryption: An efficient way to protect SPIHT compressed images

    Science.gov (United States)

    Xiang, Tao; Qu, Jinyu; Yu, Chenyun; Fu, Xinwen

    2012-11-01

    Degradative encryption, a new selective image encryption paradigm, is proposed to encrypt only a small part of image data to make the detail blurred but keep the skeleton discernible. The efficiency is further optimized by combining compression and encryption. A format-compliant degradative encryption algorithm based on set partitioning in hierarchical trees (SPIHT) is then proposed, and the scheme is designed to work in progressive mode for gaining a tradeoff between efficiency and security. Extensive experiments are conducted to evaluate the strength and efficiency of the scheme, and it is found that less than 10% data need to be encrypted for a secure degradation. In security analysis, the scheme is verified to be immune to cryptographic attacks as well as those adversaries utilizing image processing techniques. The scheme can find its wide applications in online try-and-buy service on mobile devices, searchable multimedia encryption in cloud computing, etc.

  6. Impact of mobility structure on the optimization of small-world networks of mobile agents

    CERN Document Server

    Lee, Eun

    2015-01-01

    In ad hoc wireless networking, units are connected to each other rather than to a central, fixed, infrastructure. Constructing and maintaining such networks create several trade-off problems between robustness, communication speed, power consumption, etc., that bridges engineering, computer science and the physics of complex systems. In this work, we address the role of mobility patterns of the agents on the optimal tuning of a small-world type network construction method. By this method, the network is updated periodically and held static between the updates. We investigate the optimal updating times for different scenarios of the movement of agents (modeling, for example, the fat-tailed trip distances, and periodicities, of human travel). We find that these mobility patterns affect the power consumption in non-trivial ways and discuss how these effects can best be handled.

  7. Impact of mobility structure on optimization of small-world networks of mobile agents

    Science.gov (United States)

    Lee, Eun; Holme, Petter

    2016-06-01

    In ad hoc wireless networking, units are connected to each other rather than to a central, fixed, infrastructure. Constructing and maintaining such networks create several trade-off problems between robustness, communication speed, power consumption, etc., that bridges engineering, computer science and the physics of complex systems. In this work, we address the role of mobility patterns of the agents on the optimal tuning of a small-world type network construction method. By this method, the network is updated periodically and held static between the updates. We investigate the optimal updating times for different scenarios of the movement of agents (modeling, for example, the fat-tailed trip distances, and periodicities, of human travel). We find that these mobility patterns affect the power consumption in non-trivial ways and discuss how these effects can best be handled.

  8. A Handoff Mechanism in VANET Using Mobile Agent

    Directory of Open Access Journals (Sweden)

    Anshu Garg

    2012-06-01

    Full Text Available Nowadays, everything is moving towards theinfrastructure less wireless environment to bring thesmartness of the society. In this situation, it isnecessary to bring the smart technologies in the adhocnetwork environment. As vehicular traffic is aforemost problem in modern cities and on highway.Huge amount of time and resources are wasted whiletraveling due to traffic congestion. VANET isproviding comfort and safety for passengers.Moreover, various transactions like information onaccident, roadcondition, petrol bank details, menu inthe restaurant, and discount sales can be provided tothe drivers and passengers. The speed and time inwhich the message is sent and received plays anessential part in the Intelligent Transport System(ITS. For this the VANET requires efficient andreliable methods for data communication, gatheringand retrieving information for seamless handoff inVANET. In this paper we discusses the architecture ofVANET consists clusters that’s designed by mobileagents having instantaneous conditions of MobileNodes available in VANET. For efficient datacommunication, an attempt has been made to create anew clustering concept with the help of mobile agentsamong the VANET nodes. Subsequently for smoothand seamless handoff we have considered the calladmission control mechanism with the help of Geneticalgorithms applied over information retrieval systemmanaged by mobile agent with the effect of shadowingfor reducing the data overhead over VANET.

  9. Multimedia encryption and watermarking encryption and watermarking

    CERN Document Server

    Furht, Borko; Socek, Daniel

    2006-01-01

    ""Multimedia Encryption and Watermarking"" presents a comprehensive survey of contemporary multimedia encryption and watermarking techniques, which enable a secure exchange of multimedia intellectual property. Part I, Digital Rights Management (DRM) for Multimedia, introduces DRM concepts and models for multimedia content protection, and presents the key players. Part II, Multimedia Cryptography, provides an overview of modern cryptography, with the focus on modern image, video, speech, and audio encryption techniques. This book also provides an advanced concept of visual and audio sharing tec

  10. Cost-Effective Location Management for Mobile Agents on the Internet

    Directory of Open Access Journals (Sweden)

    Chien-Sheng Chen

    2015-01-01

    Full Text Available Many mobile agent system-related services and applications require interacting with a mobile agent by passing messages. However, an agent’s mobility raises several challenges in delivering messages to a mobile agent accurately. Consisting of tracking and message delivery phases, most mobile agent location management schemes create or receive many update messages and interaction messages to ensure the effectiveness of the schemes. In addition to downgrading the overall performance of a mobile agent location management scheme, excessive transmission of messages increases the network load. The migration locality of a mobile agent and the interaction rate between mobile agents significantly affect the performance of a mobile agent location management scheme with respect to location management cost. This work presents a novel Dual Home based Scheme (DHS that can lower the location management costs in terms of migration locality and interaction rate. While the DHS scheme uniquely adopts dual home location management architecture, a selective update strategy based on that architecture is also designed for cost-effective location management of mobile agents. Moreover, DHS is compared with available schemes based on formulations and simulation experiments from the perspective of location management costs. Simulation results demonstrate that the proposed DHS scheme performs satisfactorily in terms of migration locality and interaction rate.

  11. A Skeleton Based Programming Paradigm for Mobile Multi-Agents on Distributed Systems and Its Realization within the MAGDA Mobile Agents Platform

    Directory of Open Access Journals (Sweden)

    R. Aversa

    2008-01-01

    Full Text Available Parallel programming effort can be reduced by using high level constructs such as algorithmic skeletons. Within the MAGDA toolset, supporting programming and execution of mobile agent based distributed applications, we provide a skeleton-based parallel programming environment, based on specialization of Algorithmic Skeleton Java interfaces and classes. Their implementation include mobile agent features for execution on heterogeneous systems, such as clusters of WSs and PCs, and support reliability and dynamic workload balancing. The user can thus develop a parallel, mobile agent based application by simply specialising a given set of classes and methods and using a set of added functionalities.

  12. SECURING MOBILE ANT AGENT USING CHINESE REMAINDER THEOREM

    Directory of Open Access Journals (Sweden)

    Srinath Doss

    2013-01-01

    Full Text Available Recent days, research in wireless network becomes major area for the past few decades. In wireless routing many routing methods such as table driven, source driven; many characteristics such as reactive routing, proactive routing; many routing algorithms such as dijikstra’s shortest path, distributed bell-man ford algorithm are proposed in the literature. For effective wireless routing, the recent ant colony optimization proves better result than the existing methodologies. The ant colony optimization is a swarm intelligence technique which widely used for combinatorial optimization problems such as travelling salesman, network routing, clustering. The ant colony optimization is a real time routing protocol which offers highly reliable and optimal routing for both single path and multi path routing. As the ant is a small tiny mobile agent, providing security is critical issue. In this study, a secured ant colony optimization using Chinese remainder theorem is proposed.

  13. Simulation of Service Supply Chain Formation Based on Mobile Agent

    Institute of Scientific and Technical Information of China (English)

    YANG Zhe; ZHANG Da-lu; XU Jian

    2005-01-01

    In E-Commerce, consumers and service suppliers can find the services through the searching of Mobile Agents (MA).The suppliers disassemble the service requests of consumers into the sub-requests. Then suppliers respond the subrequests cooperatively. Thus the Service Supply Chain(SSC) can be formed. But the existing bottom-up and upbottom supply chain formation fashions cannot be adapted to the SSC in distributed environment of E-Commerce. Task Dependency Network is exploited to illustrate the service relationship among consumers and suppliers. The formation of SSC with some simulations is elaborated. Then the influence on the formation of SSC caused by the type of service suppliers, the quantities of MA and its variety in number is elucidated.

  14. An Overview of Workflow Management on Mobile Agent Technology

    Directory of Open Access Journals (Sweden)

    Anup Patnaik

    2014-07-01

    Full Text Available Mobile agent workflow management/plugins is quite appropriate to handle control flows in open distributed system; basically it is the emerging technology which can bring the process oriented tasks to run as a single unit from diverse frameworks. This workflow technology offers organizations the opportunity to reshape business processes beyond the boundaries of their own organizations so that instead of static models, modern era incurring dynamic workflows which can respond the changes during its execution, provide necessary security measures, great degree of adaptivity, troubleshoot the running processes and recovery of lost states through fault tolerance. The prototype that we are planning to design makes sure to hold reliability, security, robustness, scalability without being forced to make tradeoffs the performance. This paper is concerned with design, implementation and evaluation of performance on the improved methods of proposed prototype models based on current research in this domain.

  15. 移动代理系统综述%A SURVEY OF MOBILE AGENT SYSTEM

    Institute of Scientific and Technical Information of China (English)

    朱淼良; 邱瑜

    2001-01-01

    Mobile agent technology is a new distributed computation paradigm. With its potential power, the technology aroused a great interest and experienced a rapid development in the last ten years. Various mobile agent systems were made for different targets and were implemented in different means. It is necessary to explore the current mobile agent systems and to summarize the implementation technologies for further research. In this paper a comprehensive explanation of mobile agent systems is given. First the definition and peculiarities of mobile agents and mobile agent systems are stated. Its advantages are enumerated. Then eight representative mobile agent systems are surveyed and the design issues about mobile agent programming language, mobility, communication, fault tolerance and security are discussed. Finally, the deficiencies and the trends of mobile agent technology are pointed out.%移动代理技术是新型的分布计算技术,具有很好的应用前景.移动代理系统是实现移动代理应用的基础框架.简述了移动代理(mobile agent)的定义和特点、移动代理系统(mobile agent system)的定义和基本内容、移动代理技术的优点和应用范围.着重讨论了8个有代表性的移动代理系统,就各自的体系结构和特色作出说明,并且综合分析了实现移动代理系统所需的技术和当前研究中存在的问题及可能的发展趋势.

  16. CACM: A New Coordination Model in Mobile Agent-Based Information Retrieval Applications

    Institute of Scientific and Technical Information of China (English)

    TANGXinhuai; ZHANGYaying; YAOYinxiong; YOUJinyuan

    2005-01-01

    In mobile agent systems, an application may be composed of several mobile agents that cooperatively perform a task. Multiple mobile agents need to communicate and interact with each other to accomplish their cooperative goal. Coordination model aims to provide solutions to interactions between concurrent activities, hiding the computing details and focusing on interaction between activities. A Context-aware coordination model (CACM), which combines mobility and coordination, is proposed for mobile agent applications, i.e. in mobile agent based information retrieval applications. The context-aware coordination model transfers interactions between agents from globally coupling interactions to locally uncoupling tuple space interactions. In addition, programmable tuple space is adopted to solve the problems of context-aware coordination introduced by mobility and data heterogeneity in mobile agent systems. Furthermore, environment specific and application specific coordination policy can be integrated into the programmable tuple space for customized requirements. Finally an application sample system-information retrieval in mobile agent applications is carried out to test the performance of the proposed model.

  17. Design on PKI-Based Anonymous Mobile Agent Security in E-Commerce

    Institute of Scientific and Technical Information of China (English)

    MENG Xiangsong; HAN Fengwu

    2006-01-01

    The security of mobile agent directly decides its usage width in e-commerce. Especially, to protect users' private information is becoming more important now and future. So an anonymous mobile agent security mechanism with the secure authentication infrastructure based on PKI(public key infrastructure) is proposed in the paper. The multi-agent system is programmed by java language and every agent must register itself in CA(certificate authority) before working in the net and express his legit identity which is temptly produced and used only once. The CA ensures the legal of all agents' identity which take part in communicaiton or trade. And every user agent identity only is used once which makes other agents cannot decipher users' private information. The security mechanism of the multi-agent system implements anonymity, integrity, data confidentiality of mobile agent based on the MH(multiple hop) integrity protection regard to PKI limit.

  18. Mobile agent application and integration in electronic anamnesis system.

    Science.gov (United States)

    Liu, Chia-Hui; Chung, Yu-Fang; Chen, Tzer-Shyong; Wang, Sheng-De

    2012-06-01

    Electronic anamnesis is to transform ordinary paper trails to digitally formatted health records, which include the patient's general information, health status, and follow-ups on chronic diseases. Its main purpose is to let the records could be stored for a longer period of time and could be shared easily across departments and hospitals. Which means hospital management could use less resource on maintaining ever-growing database and reduce redundancy, so less money would be spent for managing the health records. In the foreseeable future, building up a comprehensive and integrated medical information system is a must, because it is critical to hospital resource integration and quality improvement. If mobile agent technology is adopted in the electronic anamnesis system, it would help the hospitals to make the medical practices more efficiently and conveniently. Nonetheless, most of the hospitals today are still using paper-based health records to manage the medical information. The reason why the institutions continue using traditional practices to manage the records is because there is no well-trusted and reliable electronic anamnesis system existing and accepted by both institutions and patients. The threat of privacy invasion is one of the biggest concerns when the topic of electronic anamnesis is brought up, because the security threats drag us back from using such a system. So, the medical service quality is difficult to be improved substantially. In this case, we have come up a theory to remove such security threats and make electronic anamnesis more appealing for use. Our theory is to integrate the mobile agent technology with the backbone of electronic anamnesis to construct a hierarchical access control system to retrieve the corresponding information based upon the permission classes. The system would create a classification for permission among the users inside the medical institution. Under this framework, permission control center would distribute an

  19. Image-Text Encryption Techniques in Mobile Communications Based on X-IDEA%基于X-IDEA算法实现手机通信中图文加密

    Institute of Scientific and Technical Information of China (English)

    肖四友

    2011-01-01

    研究手机通信系统中图文数据的加密设计,由于手机设备的有限性能,其运算能力还无法与计算机相提并论.因此文中采用具有高效率和轻量级特点的X-IDEA加密算法,它是对IDEA算法进行改良使之更适合运用于手机图文安全传送,也更适合与当前3G通信中图文大小可变以及存在相同部分的可能性增大的情况.%This paper has studied the encryption of data in mobile's graphic communication, and the computing power cannot be compared with the computer due to the limited performance of mobile devices. Therefore, this paper uses a highly efficient and lightweight characteristics: X-IDEA encryption algorithm, it is a improved IDEA algorithm. This nalgorithm has improved IDEA more suitable transmission used in mobile graphics safe, more suitable the current variable size Photo in 3G, while the presence of an increased possibility of the same part of the case.

  20. Adaptive Remote-Sensing Techniques Implementing Swarms of Mobile Agents

    Energy Technology Data Exchange (ETDEWEB)

    Asher, R.B.; Cameron, S.M.; Loubriel, G.M.; Robinett, R.D.; Stantz, K.M.; Trahan, M.W.; Wagner, J.S.

    1998-11-25

    In many situations, stand-off remote-sensing and hazard-interdiction techniques over realistic operational areas are often impractical "and difficult to characterize. An alternative approach is to implement an adap- tively deployable array of sensitive agent-specific devices. Our group has been studying the collective be- havior of an autonomous, multi-agent system applied to chedbio detection and related emerging threat applications, The current physics-based models we are using coordinate a sensor array for mukivanate sig- nal optimization and coverage as re,alized by a swarm of robots or mobile vehicles. These intelligent control systems integrate'glob"ally operating decision-making systems and locally cooperative learning neural net- works to enhance re+-timp operational responses to dynarnical environments examples of which include obstacle avoidance, res~onding to prevailing wind patterns, and overcoming other natural obscurants or in- terferences. Collectively',tkensor nefirons with simple properties, interacting according to basic community rules, can accomplish complex interconnecting functions such as generalization, error correction, pattern recognition, sensor fusion, and localization. Neural nets provide a greater degree of robusmess and fault tolerance than conventional systems in that minor variations or imperfections do not impair performance. The robotic platforms would be equipped with sensor devices that perform opticaI detection of biologicais in combination with multivariate chemical analysis tools based on genetic and neural network algorithms, laser-diode LIDAR analysis, ultra-wideband short-pulsed transmitting and receiving antennas, thermal im- a:ing sensors, and optical Communication technology providing robust data throughput pathways. Mission scenarios under consideration include ground penetrating radar (GPR) for detection of underground struc- tures, airborne systems, and plume migration and mitigation. We will describe our

  1. Modeling Multi-Mobile Agents System Based on Coalition Signature Mechanism Using UML

    Institute of Scientific and Technical Information of China (English)

    SUNZhixin; HUANGHaiping; WANGRuchuan

    2004-01-01

    With the development of electronic commerce and agent techniques, multi-mobile agents cooperation can not only improve the efficiency of electronic business trade, but more importantly, it has a comprehensive applicative value in solving the security issues of mobile agent system. This paper firstly describes the mechanism of multi-mobile agents coalition signature aiming at the system security. Subsequently it brings forward a basic architecture of Multi-mobile agents system (MMAS) based on the design pattern of multi-mobile agents. The paper uses the diagrs_rn of UML, such as use case diagram, class diagram and sequence diagram to build the detailed model of the coalition signature and multi-mobile agents cooperation results. Through security analysis, we find that multimobile agents cooperation and interaction can solve some security problems of mobile agents in transfer, and also it can improve the efficiency of business trade. These results indicate that MMAS has a high security performance and can be widely used in E-commerce trade.

  2. Reliability of Mobile Agents for Reliable Service Discovery Protocol in MANET

    CERN Document Server

    Neogy, Roshni; Neogy, Sarmistha; 10.5121/ijwmn.2011.3518

    2011-01-01

    Recently mobile agents are used to discover services in mobile ad-hoc network (MANET) where agents travel through the network, collecting and sometimes spreading the dynamically changing service information. But it is important to investigate how reliable the agents are for this application as the dependability issues(reliability and availability) of MANET are highly affected by its dynamic nature.The complexity of underlying MANET makes it hard to obtain the route reliability of the mobile agent systems (MAS); instead we estimate it using Monte Carlo simulation. Thus an algorithm for estimating the task route reliability of MAS (deployed for discovering services) is proposed, that takes into account the effect of node mobility in MANET. That mobility pattern of the nodes affects the MAS performance is also shown by considering different mobility models. Multipath propagation effect of radio signal is considered to decide link existence. Transient link errors are also considered. Finally we propose a metric t...

  3. Research on Applications of Cryptography for Multi-Mobile Agent System

    Institute of Scientific and Technical Information of China (English)

    HUANG Hai-ping; WANG Ru-chuan; XU Xiao-long

    2004-01-01

    With the development of information network and agent technology, Multi-Mobile Agents' Cooperation can not only improve the computing efficiency, but also have a comprehensive applicative value in solving the security issues of mobile agent system. Aiming at the security and flexibility, this paper proposes a kind of basic architecture and the design pattern of Multi-Mobile Agent System (MMAS). Combined with cryptography, it builds the security mechanism on keys' distribution and management and Coalition Signature of MMAS. Through the analysis of security and validity, the introduction and application of cryptography can improve the performance of MMAS.

  4. Access Path Planning of Mobile Agent in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Chaoyu Yang

    2014-02-01

    Full Text Available Adopting the two-stage optimization model and hybrid optimized algorithm based on evolutionary computation, a new two-stage optimization model that more conforms to the actual demand is proposed on the basis of formal description of Mobile Agent access path planning. This new model divides the access path planning problem into two sub problems of integer linear programming --data integration sub paths and return sub paths, which can reduce search space and improve the efficiency of algorithm. Then a hybrid optimized method named GAPSO, combined with GA (Genetic Algorithm and PSO (Particle Swarm Optimization, is advanced to solve this model, which integrates discrete PSO into the interlace operation of GA to avoid infeasible solution and improve search quality. Meanwhile convergence can be accelerated by optimizing the GA population with PSO in search of return sub paths. By means of virtual connected topology graph, the high-quality to-be-accessed candidate node set is acquired, the number of to-be-selected nodes is reduced,and the complexity of solution space is decreased, making planning algorithm performance not rely on network scale directly any more. Simulation results show that the advantages of the optimization model is obvious as the node number increases, and GASPO has a better performance than GA and BPSO in the same model

  5. MAST – A Mobile Agent-based Security Tool

    Directory of Open Access Journals (Sweden)

    Marco Carvalho

    2004-08-01

    Full Text Available One of the chief computer security problems is not the long list of viruses and other potential vulnerabilities, but the vast number of systems that continue to be easy prey, as their system administrators or owners simply are not able to keep up with all of the available patches, updates, or needed configuration changes in order to protect them from those known vulnerabilities. Even up-to-date systems could become vulnerable to attacks, due to inappropriate configuration or combined used of applications and services. Our mobile agent-based security tool (MAST is designed to bridge this gap, and provide automated methods to make sure that all of the systems in a specific domain or network are secured and up-to-date with all patches and updates. The tool is also designed to check systems for misconfigurations that make them vulnerable. Additionally, this user interface is presented in a domain knowledge model known as a Concept Map that provides a continuous learning experience for the system administrator.

  6. Epidemic spreading on dual-structure networks with mobile agents

    Science.gov (United States)

    Yao, Yiyang; Zhou, Yinzuo

    2017-02-01

    The rapid development of modern society continually transforms the social structure which leads to an increasingly distinct dual structure of higher population density in urban areas and lower density in rural areas. Such structure may induce distinctive spreading behavior of epidemics which does not happen in a single type structure. In this paper, we study the epidemic spreading of mobile agents on dual structure networks based on SIRS model. First, beyond the well known epidemic threshold for generic epidemic model that when the infection rate is below the threshold a pertinent infectious disease will die out, we find the other epidemic threshold which appears when the infection rate of a disease is relatively high. This feature of two thresholds for the SIRS model may lead to the elimination of infectious disease when social network has either high population density or low population density. Interestingly, however, we find that when a high density area is connected to a low density may cause persistent spreading of the infectious disease, even though the same disease will die out when it spreads in each single area. This phenomenon indicates the critical role of the connection between the two areas which could radically change the behavior of spreading dynamics. Our findings, therefore, provide new understanding of epidemiology pertinent to the characteristic modern social structure and have potential to develop controlling strategies accordingly.

  7. Mobile Agent Platform and Naming Scheme of Agents%移动代理平台及其代理命名方法

    Institute of Scientific and Technical Information of China (English)

    Sudin SHRESTHA; 徐拾义; Jagath RATNAYEKE

    2004-01-01

    Mobile agent technology has drawn a tremendous amount of attention from researchers in distributed computing recently as it promises to provide an elegant and efficient way of solving complex distributed problems, as well as offering a new approach to human-computer-interaction. In mobile agent systems, the mobile agent travels autonomously from one computer to another within the agent enabled networks, executes itself in the agent execution environment, collects useful information and makes its own decision on behalf of its owner. This mobility nature of mobile agent demands its unique name in the whole network otherwise it gets lost or conflicts with other mobile agent having same name. This paper proposes a naming scheme which promises a unique name for a mobile agent within that network.

  8. Towards Symbolic Encryption Schemes

    DEFF Research Database (Denmark)

    Ahmed, Naveed; Jensen, Christian D.; Zenner, Erik

    2012-01-01

    Symbolic encryption, in the style of Dolev-Yao models, is ubiquitous in formal security models. In its common use, encryption on a whole message is specified as a single monolithic block. From a cryptographic perspective, however, this may require a resource-intensive cryptographic algorithm......, namely an authenticated encryption scheme that is secure under chosen ciphertext attack. Therefore, many reasonable encryption schemes, such as AES in the CBC or CFB mode, are not among the implementation options. In this paper, we report new attacks on CBC and CFB based implementations of the well......-known Needham-Schroeder and Denning-Sacco protocols. To avoid such problems, we advocate the use of refined notions of symbolic encryption that have natural correspondence to standard cryptographic encryption schemes....

  9. Trust Level and Routing Selection for Mobile Agents in a Smart Home

    NARCIS (Netherlands)

    Nasution, Sandy; Hartel, Pieter; Suryana, Nanna; Azman, Nur; Shahib, Shahrin

    2010-01-01

    The central security concern for systems where agents roam is how to establish trust in the agent. We present a Fuzzy Logic mechanism to calculate a level of trust and an optimal route for a mobile agent system in a smart home. The mechanism consists of two parts. The first part calculates a trust l

  10. Trust Level and Routing Selection for Mobile Agents in a Smart Home

    NARCIS (Netherlands)

    Nasution, S.; Hartel, P.H.; Suryana, N.; Azman, N.; Shahib, S.

    2009-01-01

    The central security concern for systems where agents roam is how to establish trust in the agent. We present a Fuzzy Logic mechanism to calculate a level of trust and an optimal route for a mobile agent system in a smart home. The mechanism consists of two parts. The first part calculates a trust l

  11. Encryption for digital content

    CERN Document Server

    Kiayias, Aggelos

    2010-01-01

    Encryption for Digital Content is an area in cryptography that is widely used in commercial productions (e.g., Blu-Ray and HD-DVDs). This book provides a comprehensive mathematical treatment of combinatorial encryption techniques used in digital content distribution systems and related attack models. A complete description of broadcast encryption with various revocation and tracing functionalities is included. ""Encryption for Digital Content"" introduces the subset cover framework (currently used in AACS, Blu-Ray and HD-DVDs,) and tracking/revocation mechanisms in various attack models. Pirat

  12. Optical encryption interface

    Science.gov (United States)

    Jackson, Deborah J. (Inventor)

    1998-01-01

    An analog optical encryption system based on phase scrambling of two-dimensional optical images and holographic transformation for achieving large encryption keys and high encryption speed. An enciphering interface uses a spatial light modulator for converting a digital data stream into a two dimensional optical image. The optical image is further transformed into a hologram with a random phase distribution. The hologram is converted into digital form for transmission over a shared information channel. A respective deciphering interface at a receiver reverses the encrypting process by using a phase conjugate reconstruction of the phase scrambled hologram.

  13. On Fully Homomorphic Encryption

    OpenAIRE

    Fauzi, Prastudy

    2012-01-01

    Fully homomorphic encryption is an encryption scheme where a party can receive encrypted data and perform arbitrary operations on this data efficiently.The data remains encrypted throughout, but the operations can be done regardless, without having to know the decryption key.Such a scheme would be very advantageous, for example in ensuring the privacy of data that is sent to a third-party service.This is in contrast with schemes like Paillier where you can not perform a multiplication of encr...

  14. Key Management and Authentication in Ad Hoc Network based on Mobile Agent

    Directory of Open Access Journals (Sweden)

    Yi Zhang

    2009-08-01

    Full Text Available Key management and authentication is important to security of Mobile Ad Hoc network (MANET. Based on the (t, n threshold cryptography, this paper introduced mobile agents to exchange private key and network topological information with nodes in the network. This method avoids a centralized certification authority to distribute the public keys and the certificates, thus enhances security. Carrying private key and some state variables, mobile agents navigate in the network according to visitsbalance policy, namely, node with the least visits would be first visited by mobile agent. Any t nodes in the network can cooperate to perform an authentication upon a new node wanting to join the network. Experimental results show that the mobile agent performs very well for improving the success ratio of authentication and enhance security while reducing the communication overhead and resource consumption.

  15. Adaptive Remote-Sensing Techniques Implementing Swarms of Mobile Agents

    Energy Technology Data Exchange (ETDEWEB)

    Cameron, S.M.; Loubriel, G.M.; Rbinett, R.D. III; Stantz, K.M.; Trahan, M.W.; Wagner, J.S.

    1999-04-01

    This paper focuses on our recent work at Sandia National Laboratories toward engineering a physics-based swarm of mobile vehicles for distributed sensing applications. Our goal is to coordinate a sensor array that optimizes sensor coverage and multivariate signal analysis by implementing artificial intelligence and evolutionary computational techniques. These intelligent control systems integrate both globally operating decision-making systems and locally cooperative information-sharing modes using genetically-trained neural networks. Once trained, neural networks have the ability to enhance real-time operational responses to dynamical environments, such as obstacle avoidance, responding to prevailing wind patterns, and overcoming other natural obscurants or interferences (jammers). The swarm realizes a collective set of sensor neurons with simple properties incorporating interactions based on basic community rules (potential fields) and complex interconnecting functions based on various neural network architectures, Therefore, the swarm is capable of redundant heterogeneous measurements which furnishes an additional degree of robustness and fault tolerance not afforded by conventional systems, while accomplishing such cognitive tasks as generalization, error correction, pattern recognition, and sensor fission. The robotic platforms could be equipped with specialized sensor devices including transmit/receive dipole antennas, chemical or biological sniffers in combination with recognition analysis tools, communication modulators, and laser diodes. Our group has been studying the collective behavior of an autonomous, multi-agent system applied to emerging threat applications. To accomplish such tasks, research in the fields of robotics, sensor technology, and swarms are being conducted within an integrated program. Mission scenarios under consideration include ground penetrating impulse radar (GPR) for detection of under-ground structures, airborne systems, and plume

  16. Computational Analysis of .NET Remoting and Mobile agent in Distributed Environment

    CERN Document Server

    Tiwari, Vivek; Tiwari, Renu; Kirar, Malam

    2010-01-01

    A mobile agent is a program that is not bound to the system on which it began execution, but rather travels amongst the hosts in the network with its code and current execution state (i.e. Distributed Environment).The implementation of distributed applications can be based on a multiplicity of technologies, e.g. plain sockets, Remote Procedure Call (RPC), Remote Method Invocation (RMI), Java Message Service (JMS), .NET Remoting, or Web Services. These technologies differ widely in complexity, interoperability, standardization, and ease of use. The Mobile Agent technology is emerging as an alternative to build a smart generation of highly distributed systems. In this work, we investigate the performance aspect of agent-based technologies for information retrieval. We present a comparative performance evaluation model of Mobile Agents versus .Net remoting by means of an analytical approach. A quantitative measurements are performed to compare .Net remoting and mobile agents using communication time, code size (...

  17. Integration of a mobile autonomous robot in a surveillance multi-agent system

    OpenAIRE

    Dias, Bruno Miguel Morais

    2014-01-01

    This dissertation aims to guarantee the integration of a mobile autonomous robot equipped with many sensors in a multi-agent distributed and georeferenced surveillance system. The integration of a mobile autonomous robot in this system leads to new features that will be available to clients of surveillance system may use. These features may be of two types: using the robot as an agent that will act in the environment or by using the robot as a mobile set of sensors. As an agent in the syst...

  18. Study of the Security in Network Management Based on Mobile Agents

    Institute of Scientific and Technical Information of China (English)

    CHEN Zhi; WANG Ru-chuan

    2004-01-01

    Security of mobile-agent based network management must be considered due to the widespread adoption of mobile agents in network management, which involves the protections of mobile agents, management station and managed devices. The integrated security model proposed in our paper incorporates the effective security countermeasures of these entities into a trusted execution environment and two security protection layers. Sandbox based on Java virtual machine and Java card independent on the network devices also with the cryptography technology in this model together protect the network management process.

  19. Distributed Searchable Symmetric Encryption

    NARCIS (Netherlands)

    Bösch, Christoph; Peter, Andreas; Leenders, Bram; Lim, Hoon Wei; Tang, Qiang; Wang, Huaxiong; Hartel, Pieter; Jonker, Willem

    2014-01-01

    Searchable Symmetric Encryption (SSE) allows a client to store encrypted data on a storage provider in such a way, that the client is able to search and retrieve the data selectively without the storage provider learning the contents of the data or the words being searched for. Practical SSE schemes

  20. On the Migration Mechanism of Mobile Agent System%移动Agent系统的迁移机制研究

    Institute of Scientific and Technical Information of China (English)

    张冠群; 陶先平; 李新; 冯新宇; 吕建

    2001-01-01

    Mobility is inherent in Internet,traditional message passing,RPC,or Remote Evaluation,can not meet more and more various mobility requirements. Mobile Agent implements computation migration,including data,code and control,is a good way to suit Internet. Migration mechanism is the key technology of mobile Agent. We discuss it from the perspective of both system programmer and application programmer and introduce migration mechanisms of some famous Java based mobile Agent system.At last,present the structured migration mechanism of self-designed mobile Agent system Mogent.

  1. An Intelligent Mobile-Agent Based Scalable Network Management Architecture for Large-Scale Enterprise System

    CERN Document Server

    Sharma, A K; Singh, Vijay

    2012-01-01

    Several Mobile Agent based distributed network management models have been proposed in recent times to address the scalability and flexibility problems of centralized (SNMP or CMIP management models) models. Though the use of Mobile Agents to distribute and delegate management tasks comes handy in dealing with the previously stated issues, many of the agent-based management frameworks like initial flat bed models and static mid-level managers employing mobile agents models cannot efficiently meet the demands of current networks which are growing in size and complexity. Moreover, varied technologies, such as SONET, ATM, Ethernet, DWDM etc., present at different layers of the Access, Metro and Core (long haul) sections of the network, have contributed to the complexity in terms of their own framing and protocol structures. Thus, controlling and managing the traffic in these networks is a challenging task. This paper presents an intelligent scalable hierarchical agent based model for the management of large-scal...

  2. Ion mobility spectrometry and its applications in detection of chemical warfare agents.

    Science.gov (United States)

    Mäkinen, Marko A; Anttalainen, Osmo A; Sillanpää, Mika E T

    2010-12-01

    When fast detection of chemical warfare agents in the field is required, the ion mobility spectrometer may be the only suitable option. This article provides an essential survey of the different ion mobility spectrometry detection technologies. (To listen to a podcast about this feature, please go to the Analytical Chemistry multimedia page at pubs.acs.org/page/ancham/audio/index.html.).

  3. Changes of lymphocyte kinetics in the normal rat, induced by the lymphocyte mobilizing agent polymethacrylic acid

    NARCIS (Netherlands)

    Ormai, S.; Hagenbeek, A.; Palkovits, M.; Bekkum, D.W. van

    1973-01-01

    The changes in lymphocyte kinetics induced by the lymphocyte mobilizing agent polymethacrylic acid (PMAA) were studied in the normal rat. Quantitative data are presented concerning the degree of lymphocyte mobilization in the spleen and in various lymph nodes at different times after PMAA administra

  4. An Agent Driven Human-centric Interface for Autonomous Mobile Robots

    Science.gov (United States)

    2003-01-01

    An Agent Driven Human-centric Interface for Autonomous Mobile Robots Donald Sofge, Dennis Perzanowski, Magdalena Bugajska, William Adams...Human-centric, Multimodal, Dynamic Autonomy, CoABS Grid, Mobile Robots 1. INTRODUCTION One of the challenges in implementing dynamically...autonomous behaviors in mobile robots is achieving a truly human-centric interface so that human operators can interact with the robots as naturally as they

  5. Domain-Partitioned Element Management Systems Employing Mobile Agents for Distributed Network Management

    Directory of Open Access Journals (Sweden)

    Anish Saini

    2014-06-01

    Full Text Available Network management systems based on mobile agents are efficiently a better alternative than typicalclient / server based architectures. Centralized management models like SNMP or CMIP based management models suffer from scalability and flexibility issues which are addressed to great extent by flat bed or static mid-level manager models based on mobile agents, yet the use of mobile agents to distribute and delegate management tasks for above stated agent-based management frameworks like initial flat bed models and static mid-level managers cannot efficiently meet the demands of current networks which are growing in size and complexity. In view of the above mentioned limitations, we proposed a domain partitioned network management model based-on mobile agent & Element Management Systems in order to minimize management data flow to a centralized server. Intelligent agent allocated to specific EMS performs local network management and reports the results to the superior manager and finally the global manager performs global network management using those submitted management results. Experimental results of various scenarios of the proposed model have been presented to support the arguments given in favor of the prototype system based on mobile agents..

  6. Identity-based encryption

    CERN Document Server

    Chatterjee, Sanjit

    2011-01-01

    Identity Based Encryption (IBE) is a type of public key encryption and has been intensely researched in the past decade. Identity-Based Encryption summarizes the available research for IBE and the main ideas that would enable users to pursue further work in this area. This book will also cover a brief background on Elliptic Curves and Pairings, security against chosen Cipher text Attacks, standards and more. Advanced-level students in computer science and mathematics who specialize in cryptology, and the general community of researchers in the area of cryptology and data security will find Ide

  7. Investigating Encrypted Material

    Science.gov (United States)

    McGrath, Niall; Gladyshev, Pavel; Kechadi, Tahar; Carthy, Joe

    When encrypted material is discovered during a digital investigation and the investigator cannot decrypt the material then s/he is faced with the problem of how to determine the evidential value of the material. This research is proposing a methodology of extracting probative value from the encrypted file of a hybrid cryptosystem. The methodology also incorporates a technique for locating the original plaintext file. Since child pornography (KP) images and terrorist related information (TI) are transmitted in encrypted format the digital investigator must ask the question Cui Bono? - who benefits or who is the recipient? By doing this the scope of the digital investigation can be extended to reveal the intended recipient.

  8. Stable Flocking Motion of Mobile Agents Following a Leader in Fixed and Switching Networks

    Institute of Scientific and Technical Information of China (English)

    Hui Yu; Yong-Ji Wang

    2006-01-01

    Multiple mobile agents with double integrator dynamics, following a leader to achieve a flocking motion formation, are studied in this paper. A class of local control laws for a group of mobile agents is proposed. From a theoretical proof, the following conclusions are reached: (i) agents globally align their velocity vectors with a leader, (ii) they converge their velocities to the leaders velocity, (iii) collisions among interconnected agents are avoided, and (iv) agent's artificial potential functions are minimized. We model the interaction and/or communication relationship between agents by algebraic graph theory. Stability analysis is achieved by using classical Lyapunov theory in a fixed network topology, and differential inclusions and nonsmooth analysis in a switching network topology respectively. Simulation examples are provided.

  9. Architecture for Intrusion Detection System with Fault Tolerance Using Mobile Agent

    Directory of Open Access Journals (Sweden)

    Chintan Bhatt

    2011-10-01

    Full Text Available This paper is a survey of the work, done for making an IDS fault tolerant.Architecture of IDS that usesmobile Agent provides higher scalability. Mobile Agent uses Platform for detecting Intrusions using filterAgent, co-relater agent, Interpreter agent and rule database. When server (IDS Monitor goes down,other hosts based on priority takes Ownership. This architecture uses decentralized collection andanalysis for identifying Intrusion. Rule sets are fed based on user-behaviour or applicationbehaviour.This paper suggests that intrusion detection system (IDS must be fault tolerant; otherwise, theintruder may first subvert the IDS then attack the target system at will.

  10. A Mobile Agent-based Web Page Constructing Framework MiPage

    Science.gov (United States)

    Fukuta, Naoki; Ozono, Tadachika; Shintani, Toramatsu

    In this paper, we present a programming framework, `MiPage', for realizing intelligent WWW applications based on the mobile agent technology. On the framework, an agent is programmed by using hyper text markup language and logic programming language. To realize the framework, we designed a new logic programming environment `MiLog', and an agent program compiler `MiPage Compiler'. The framework enables us to enhance both richness of the services and manageability of the application.

  11. 二维码加密的手机签到系统设计%The Design of Mobile Check-in System Based on RSA and QR Code Encryption

    Institute of Scientific and Technical Information of China (English)

    曹记东; 和斌涛

    2016-01-01

    This mobile check-in system can realize notice, check, records and query four functions. Based on RSA and QR code encryption technology, at the same time, considering time ,area and identity when using QR code sign in which can effectively prevent the long-distance scanning and the check by other.%文章设计的手机签到系统集会议通知、会议签到、记录报表、记录查询四大功能于一身。基于RSA和二维码加密技术,同时在利用二维码扫码签到时合理地考虑了扫码时间、扫码地址、扫码身份识别等因素,可以有效地防止异地扫描和现场代签等情况。

  12. Research on Mobile Agent Security%移动Agent安全性研究

    Institute of Scientific and Technical Information of China (English)

    董春冻; 王聪; 周星; 李戈

    2013-01-01

    Mobile Agent technology is a distributed network-computing mode,it combines the characteristic of Agent with the idea of mobile and solves the problem of task assigning and cooperation between network. It makes the use of network technology more and more extensive. But at the same time,the security problems of mobile Agent become more and more important. On the basis of simply introdu-cing mobile Agent technology,analyze its security requirements,and emphasize on security problems of mobile Agent and security policy of mobile Agent,give the solution for mobile Agent security.%移动Agent技术是一种分布式的网络计算模式,它将Agent的特点和移动的思想相结合,很好地解决了网络间任务分配与合作问题,使得一些网络技术的应用越来越广泛。但与此同时,移动Agent安全性问题的重要性也显得更为突出。文中在简要介绍移动Agent技术的基础上,分析了移动Agent的安全需求,重点讨论了移动Agent在安全性方面的问题,并给出了针对移动Agent安全问题的解决方法。

  13. A lossless encryption method for medical images using edge maps.

    Science.gov (United States)

    Zhou, Yicong; Panetta, Karen; Agaian, Sos

    2009-01-01

    Image encryption is an effective approach for providing security and privacy protection for medical images. This paper introduces a new lossless approach, called EdgeCrypt, to encrypt medical images using the information contained within an edge map. The algorithm can fully protect the selected objects/regions within medical images or the entire medical images. It can also encrypt other types of images such as grayscale images or color images. The algorithm can be used for privacy protection in the real-time medical applications such as wireless medical networking and mobile medical services.

  14. Multi-agent Optimal Control of Ball Balancing on a Mobile

    Directory of Open Access Journals (Sweden)

    Adel Akbarimajd

    2015-12-01

    Full Text Available Multi-agent systems have origin in computer engineering however, they have found applications in different field. One of the newly emerged problems in multi-agent systems is multi-agent control. In multi-agent control it is desired that the control is done in distributed manner. That is the controller of each agent should be implemented based on local feedback. In this a mechanism is introuded as a test bed for multi-agent control systems. The introduced mechanism is balancing of a ball on link located on a planar mobile robot. Dynamic equations of the mechanism is derived and the control task is distributed among two agents. For each agent a two loop controller designed wherein external loop is a LQR controller and inner loop is a simple proportional controller. Regulation and fault tolerance performance of controller scheme is evaluated by simulations.

  15. Cooperative mobile agents search using beehive partitioned structure and Tabu Random search algorithm

    Science.gov (United States)

    Ramazani, Saba; Jackson, Delvin L.; Selmic, Rastko R.

    2013-05-01

    In search and surveillance operations, deploying a team of mobile agents provides a robust solution that has multiple advantages over using a single agent in efficiency and minimizing exploration time. This paper addresses the challenge of identifying a target in a given environment when using a team of mobile agents by proposing a novel method of mapping and movement of agent teams in a cooperative manner. The approach consists of two parts. First, the region is partitioned into a hexagonal beehive structure in order to provide equidistant movements in every direction and to allow for more natural and flexible environment mapping. Additionally, in search environments that are partitioned into hexagons, mobile agents have an efficient travel path while performing searches due to this partitioning approach. Second, we use a team of mobile agents that move in a cooperative manner and utilize the Tabu Random algorithm to search for the target. Due to the ever-increasing use of robotics and Unmanned Aerial Vehicle (UAV) platforms, the field of cooperative multi-agent search has developed many applications recently that would benefit from the use of the approach presented in this work, including: search and rescue operations, surveillance, data collection, and border patrol. In this paper, the increased efficiency of the Tabu Random Search algorithm method in combination with hexagonal partitioning is simulated, analyzed, and advantages of this approach are presented and discussed.

  16. Homomorphic encryption and applications

    CERN Document Server

    Yi, Xun; Bertino, Elisa

    2014-01-01

    This book introduces the fundamental concepts of homomorphic encryption. From these foundations, applications are developed in the fields of private information retrieval, private searching on streaming data, privacy-preserving data mining, electronic voting and cloud computing. The content is presented in an instructional and practical style, with concrete examples to enhance the reader's understanding. This volume achieves a balance between the theoretical and the practical components of modern information security. Readers will learn key principles of homomorphic encryption as well as their

  17. Encrypting Analytical Web Applications

    OpenAIRE

    Fuhry, Benny; Tighzert, Walter; Kerschbaum. Florian

    2016-01-01

    The software-as-a-service (SaaS) market is growing very fast, but still many clients are concerned about the confidentiality of their data in the cloud. Motivated hackers or malicious insiders could try to steal the clients’ data. Encryption is a potential solution, but supporting the necessary functionality also in existing applications is difficult. In this paper, we examine encrypting analytical web applications that perform extensive number processing operations in the database. Existing ...

  18. Encryption Switching Protocols

    OpenAIRE

    Couteau, Geoffroy; Peters, Thomas; Pointcheval, David

    2016-01-01

    International audience; We formally define the primitive of encryption switching protocol (ESP), allowing to switch between two encryption schemes. Intuitively, this two-party protocol converts given ciphertexts from one scheme into ciphertexts of the same messages under the other scheme, for any polynomial number of switches, in any direction. Although ESP is a special kind of two-party computation protocol, it turns out that ESP implies general two-party computation (2-PC) under natural con...

  19. Algoritmi selektivnog šifrovanja - pregled sa ocenom performansi / Selective encryption algorithms: Overview with performance evaluation

    Directory of Open Access Journals (Sweden)

    Boriša Ž. Jovanović

    2010-10-01

    name says, it consists of encrypting only a subset of the data. The aim of selective encryption is to reduce the amount of data to encrypt while preserving a sufficient level of security. Theoretical foundation of selective encryption The first theoretical foundation of selective encryption was given indirectly by Claude Elwood Shannon in his work about communication theory of secrecy systems. It is well known that statistics for image and video data differ much from classical text data. Indeed, image and video data are strongly correlated and have strong spatial/temporal redundancy. Evaluation criteria for selective encryption algorithm performance evaluation We need to define a set of evaluation criteria that will help evaluating and comparing selective encryption algorithms. - Tunability - Visual degradation - Cryptographic security - Encryption ratio - Compression friendliness - Format compliance - Error tolerance Classification of selective encryption algorithms One possible classification of selective encryption algorithms is relative to when encryption is performed with respect to compression. This classification is adequate since it has intrinsic consequences on selective encryption algorithms behavior. We consider three classes of algorithms as follows: - Precompression - Incompression - Postcompression Overview of selective encryption algorithms In accordance with their precedently defined classification, selective encryption algorithms were compared, briefly described with advantages and disadvantages and their quality was assessed. Applications Selective encryption mechanisms became more and more important and can be applied in many different areas. Some potential application areas of this mechanism are: - Monitoring encrypted content - PDAs (PDA - Personal Digital Assistant, mobile phones, and other mobile terminals - Multiple encryptions - Transcodability/scalability of encrypted content Conclusion As we can see through foregoing analysis, we can notice

  20. Mobile Agents: A Distributed Voice-Commanded Sensory and Robotic System for Surface EVA Assistance

    Science.gov (United States)

    Clancey, William J.; Sierhuis, Maarten; Alena, Rick; Crawford, Sekou; Dowding, John; Graham, Jeff; Kaskiris, Charis; Tyree, Kim S.; vanHoof, Ronnie

    2003-01-01

    A model-based, distributed architecture integrates diverse components in a system designed for lunar and planetary surface operations: spacesuit biosensors, cameras, GPS, and a robotic assistant. The system transmits data and assists communication between the extra-vehicular activity (EVA) astronauts, the crew in a local habitat, and a remote mission support team. Software processes ("agents"), implemented in a system called Brahms, run on multiple, mobile platforms, including the spacesuit backpacks, all-terrain vehicles, and robot. These "mobile agents" interpret and transform available data to help people and robotic systems coordinate their actions to make operations more safe and efficient. Different types of agents relate platforms to each other ("proxy agents"), devices to software ("comm agents"), and people to the system ("personal agents"). A state-of-the-art spoken dialogue interface enables people to communicate with their personal agents, supporting a speech-driven navigation and scheduling tool, field observation record, and rover command system. An important aspect of the engineering methodology involves first simulating the entire hardware and software system in Brahms, and then configuring the agents into a runtime system. Design of mobile agent functionality has been based on ethnographic observation of scientists working in Mars analog settings in the High Canadian Arctic on Devon Island and the southeast Utah desert. The Mobile Agents system is developed iteratively in the context of use, with people doing authentic work. This paper provides a brief introduction to the architecture and emphasizes the method of empirical requirements analysis, through which observation, modeling, design, and testing are integrated in simulated EVA operations.

  1. Embeded Mobile Database Based on Mobile Agent%基于Mobile Agent的嵌入式移动数据库

    Institute of Scientific and Technical Information of China (English)

    王乐; 杨永福

    2009-01-01

    With the development of mobile computing technology, Mobile Database is moving towards the application gradually,and disphying its superiority in Embedded Operating System.There are so many characteristics in Mobile Environment, such as mobility,frequent breaking receiver,low bandwidth,limited battery power and so on,which determined there must be some differences between Computing Environment of Mobile Database and Distributed Database and put forward a number of new requirements to the Mobile Database. This article introduces the Development Status of embedded Mobile Database,analyses characteristics of Mobile Database and its architecture and introduces the technology of Agent and the application of Mobile Agent in Mobile Database.%随着移动计算技术的发展,移动数据库逐步走向应用,在嵌入式操作系统中移动数据库更显示出其优越性.移动环境中所具有移动性、频繁断接收、低带宽、电池电量有限性等特性,决定了移动数据库中计算环境不同于分布式数据库,给移动数据库研究提出了许多新的要求.该文从分析移动数据库特点、体系结构;介绍移动数据库系统中一些关键性技术;Agent技术及移动Agent在移动数据库中的应用.

  2. Control of the mobile robot based on the Mobile-C mobile agent%基于Mobile-C移动代理的移动机器人的控制

    Institute of Scientific and Technical Information of China (English)

    张楠; 葛为民

    2011-01-01

    本文提出一种使用Mobile-C移动代理控制移动机器人的方法,详细介绍了Mobile-C的结构和报文格式,以及与Ch结合的优势.机器人通过Mobile-C移动代理的控制,可以在运行中动态地切换成新的算法,来处理意料之外的情况.文章最后用一个分布式应用的实验说明了Mobile-C移动代理控制机器人的方法.%This article presents a method of controlling mobile robot using the Mobile-C mobile agent, details of the Mobile-Cs structure and message format, and the advantages of combined with Ch. By the control of Mobile-C mobile agent, the ro-bot can dynamically switch to the new algorithm at runtime to deal with unexpected situations. At last, the distributed appli-cation experiment illustrates the Mobile-C mobile agent approach to control the robot.

  3. Investigation of oil recovery improvement by coupling an interfacial tension agent and a mobility control agent in light oil reservoirs. Final report

    Energy Technology Data Exchange (ETDEWEB)

    Pitts, M.

    1995-12-01

    This research studied the oil recovery potential of flooding light oil reservoirs by combining interfacial tension reducing agent(s) with a mobility control agent. The specific objectives were: To define the mechanisms and limitations of co-injecting interfacial tension reduction agent(s) and a mobility control agent to recover incremental oil. Specifically, the study focused on the fluid-fluid and fluid-rock interactions. To evaluate the economics of the combination technology and investigate methods to make the process more profitable. Specific areas of study were to evaluate different chemical concentration tapers and the volume of chemical injection required to give optimal oil recovery.

  4. Disinfection of biological agents in the field using a mobile ...

    Science.gov (United States)

    Report The Army’s Net Zero Initiative is an energy-conservation program that focuses on energy as well as water and waste usage procedures. All Net Zero projects are geared toward helping the military installation or community become more sustainable and resilient, with an emphasis on taking a systems approach. Net Zero projects must advance the state of the science and are focused on three general topic areas: water, energy, and waste, and the nexuses among them. This project examined the inactivation and/or removal of biological contaminants in dirty wash water using a portable ozone-UV AOP process. The strain of E. coli used in these experiments is not a biological warfare agent, but acts as a surrogate for certain of the vegetative biological agents such as the enterohemorrhagic strain designated E. coli 0157:H7.

  5. Control of group of mobile autonomous agents via local strategies

    Institute of Scientific and Technical Information of China (English)

    Lixin GAO; Daizhan CHENG; Yiguang HONG

    2008-01-01

    This paper considers the formation control problem of multi-agent systems in a distributed fashion.Two cases of the information propagating topologies among multiple agents,characterized by graphics model,are considered.One is fixed topology.The other is switching topology which represents the limited and less reliable information exchange.The local formation control strategies established in this paper are based on a simple modification of the existing consensus control strategies.Moreover,some existing convergence conditions ale shown to be a special case of our model even in the continuous-time consensus case.Therefore.the results of this paper extend the existing results about the consensus problem.

  6. Searching dynamic agents with a team of mobile robots.

    Science.gov (United States)

    Juliá, Miguel; Gil, Arturo; Reinoso, Oscar

    2012-01-01

    This paper presents a new algorithm that allows a team of robots to cooperatively search for a set of moving targets. An estimation of the areas of the environment that are more likely to hold a target agent is obtained using a grid-based Bayesian filter. The robot sensor readings and the maximum speed of the moving targets are used in order to update the grid. This representation is used in a search algorithm that commands the robots to those areas that are more likely to present target agents. This algorithm splits the environment in a tree of connected regions using dynamic programming. This tree is used in order to decide the destination for each robot in a coordinated manner. The algorithm has been successfully tested in known and unknown environments showing the validity of the approach.

  7. Searching Dynamic Agents with a Team of Mobile Robots

    Directory of Open Access Journals (Sweden)

    Miguel Juliá

    2012-06-01

    Full Text Available This paper presents a new algorithm that allows a team of robots to cooperatively search for a set of moving targets. An estimation of the areas of the environment that are more likely to hold a target agent is obtained using a grid-based Bayesian filter. The robot sensor readings and the maximum speed of the moving targets are used in order to update the grid. This representation is used in a search algorithm that commands the robots to those areas that are more likely to present target agents. This algorithm splits the environment in a tree of connected regions using dynamic programming. This tree is used in order to decide the destination for each robot in a coordinated manner. The algorithm has been successfully tested in known and unknown environments showing the validity of the approach.

  8. An Anonymous Payment Protocol with Mobile Agents in Hostile Environments

    Institute of Scientific and Technical Information of China (English)

    LIU Yi; XIANG Ming-sen; WANG Yu-min

    2005-01-01

    By using Pedersen' s verifiable secret sharing scheme and the theory of cross validation, we propose an anonymous payment protocol which have following features:protecting the confidentiality of sensitive payment information from spying by malicious hosts; using a trusted third party in a minimal way; verifying the validity of the share by the merchant; allowing agent to verify that the product which it is about to receive is the one it is paying for; keeping the customer anonymous.

  9. Mobile Agent-Based Software Systems Modeling Approaches: A Comparative Study

    Directory of Open Access Journals (Sweden)

    Aissam Belghiat

    2016-06-01

    Full Text Available Mobile agent-based applications are special type of software systems which take the advantages of mobile agents in order to provide a new beneficial paradigm to solve multiple complex problems in several fields and areas such as network management, e-commerce, e-learning, etc. Likewise, we notice lack of real applications based on this paradigm and lack of serious evaluations of their modeling approaches. Hence, this paper provides a comparative study of modeling approaches of mobile agent-based software systems. The objective is to give the reader an overview and a thorough understanding of the work that has been done and where the gaps in the research are.

  10. A mobile-agent based wireless sensing network for structural monitoring applications

    Energy Technology Data Exchange (ETDEWEB)

    Taylor, Stuart G [Los Alamos National Laboratory; Farinholt, Kevin M [Los Alamos National Laboratory; Figueiredo, Eloi [Los Alamos National Laboratory; Park, Gyuhae [Los Alamos National Laboratory; Farrar, Charles R [Los Alamos National Laboratory; Flynn, Eric B [UCSD; Mascarenas, David L [UCSD; Todd, Michael D [UCSD

    2008-01-01

    A new wireless sensing network paradigm is presented for structural monitoring applications. In this approach, both power and data interrogation commands are conveyed via a mobile agent that is sent to sensor nodes to perform intended interrogations, which can alleviate several limitations of the traditional sensing networks. Furthermore, the mobile agent provides computational power to make near real-time assessments on the structural conditions. This paper will discuss such prototype systems, which are used to interrogate impedance-based sensors for structural health monitoring applications. Our wireless sensor node is specifically designed to accept various energy sources, including wireless energy transmission, and to be wirelessly triggered on an as-needed basis by the mobile agent or other sensor nodes. The capabilities of this proposed sensing network paradigm are demonstrated in the laboratory and the field.

  11. Research and Application of Mobile Agents Based CORBA%基于CORBA的移动Agent研究及其应用

    Institute of Scientific and Technical Information of China (English)

    王建国; 李增智

    2000-01-01

    Current CORBA and Mobile Agents are two new technologies. They have own characteristics and shortcoming or the difference of implementation. This article analyzes their compensatory relation each other,and tries integrating them to construct tile architecture for network management with mobile agents based CORBA. At the same time,this paper expatiates how mobile agents work in the architecture,and summarizes the new characteristics brought with by this combinative technology.

  12. Mobile agent-enabled framework for structuring and building distributed systems on the internet

    Institute of Scientific and Technical Information of China (English)

    CAO Jiannong; ZHOU Jingyang; ZHU Weiwei; LI Xuhui

    2006-01-01

    Mobile agent has shown its promise as a powerful means to complement and enhance existing technology in various application areas. In particular, existing work has demonstrated that MA can simplify the development and improve the performance of certain classes of distributed applications, especially for those running on a wide-area, heterogeneous, and dynamic networking environment like the Internet. In our previous work, we extended the application of MA to the design of distributed control functions, which require the maintenance of logical relationship among and/or coordination of processing entities in a distributed system. A novel framework is presented for structuring and building distributed systems, which use cooperating mobile agents as an aid to carry out coordination and cooperation tasks in distributed systems. The framework has been used for designing various distributed control functions such as load balancing and mutual exclusion in our previous work. In this paper, we use the framework to propose a novel approach to detecting deadlocks in distributed system by using mobile agents, which demonstrates the advantage of being adaptive and flexible of mobile agents. We first describe the MAEDD (Mobile Agent Enabled Deadlock Detection) scheme, in which mobile agents are dispatched to collect and analyze deadlock information distributed across the network sites and, based on the analysis, to detect and resolve deadlocks. Then the design of an adaptive hybrid algorithm derived from the framework is presented. The algorithm can dynamically adapt itself to the changes in system state by using different deadlock detection strategies. The performance of the proposed algorithm has been evaluated using simulations. The results show that the algorithm can outperform existing algorithms that use a fixed deadlock detection strategy.

  13. Mobile Agent as an Approach to Improve QoS in Vehicular Ad Hoc Network

    CERN Document Server

    Kumar, Rakesh

    2011-01-01

    Vehicular traffic is a foremost problem in modern cities. Huge amount of time and resources are wasted while traveling due to traffic congestion. With the introduction of sophisticated traffic management systems, such as those incorporating dynamic traffic assignments, more stringent demands are being placed upon the available real time traffic data. In this paper we have proposed mobile agent as a mechanism to handle the traffic problem on road. Mobile software agents can be used to provide the better QoS (Quality of Service) in vehicular ad hoc network to improve the safety application and driver comfort.

  14. An Autonomous Attestation Token to Secure Mobile Agents in Disaster Response

    Science.gov (United States)

    Hein, Daniel M.; Toegl, Ronald

    Modern communication and computing devices have the potential to increase the efficiency of disaster response. Mobile agents are a decentralized and flexible technology to leverage this potential. While mobile agent platforms suffer from a greater variety of security risks than the classic client-server approach, Trusted Computing is capable of alleviating these problems. Unfortunately, Remote Attestation, a core concept of Trusted Computing, requires a powerful networked entity to perform trust decisions. The existence and availability of such a service in a disaster response scenario cannot be relied upon.

  15. Instance-oriented delegation: A solution for providing security to Grid-based mobile agent middleware

    Institute of Scientific and Technical Information of China (English)

    MA Tian-chi; LI Shan-ping

    2005-01-01

    New challenges are introduced when people try to build a general-purpose mobile agent middleware in Grid environment. In this paper, an instance-oriented security mechanism is proposed to deal with possible security threats in such mobile agent systems. The current security support in Grid Security Infrastructure (GSI) requires the users to delegate their privileges to certain hosts. This host-oriented solution is insecure and inflexible towards mobile agent applications because it cannot prevent delegation abuse and control well the diffusion of damage. Our proposed solution introduces security instance, which is an encapsulation of one set of authorizations and their validity specifications with respect to the agent's specific code segments, or even the states and requests. Applications can establish and configure their security framework flexibly on the same platform, through defining instances and operations according to their own logic. Mechanisms are provided to allow users delegating their identity to these instances instead of certain hosts. By adopting this instance-oriented security mechanism, a Grid-based general-purpose MA middleware, Everest, is developed to enhance Globus Toolkit's security support for mobile agent applications.

  16. A Multi-Agent Emotion Generating System for Mobile Robots System

    Science.gov (United States)

    Nair, Shivashankar B.; Kim, Dong Hwa

    Emotions are a complex phenomenon and are in constant research for so long. Emotions can be presupposed as a dynamic association of cells on elicitation. The use of agents for emotions generation and emotion modeling are on the rise in the recent years. In this work, we propose a dynamic emotion generation system based on multiple agents. A Multi-Agent System (MAS) to generate emotions targeted towards a mobile robot has been implemented. The agent-robot communication is still being investigated. An illustration of the use of this emotion generation module is explained in the context of the emotion system. Some ancillary investigations performed in using mobile robots for localization and terrain mapping have also been described.

  17. Polarisation Encryption/Decryption Module

    DEFF Research Database (Denmark)

    2002-01-01

    A polarisation encryption/decryption module comprising at least two array based modulating devices, preferably spatial light modulators (SLMs), at least one array based intensity detector, and at least one source of electromagnetic radiation. A local region of information displayed on a first of ...... rapidly. May be used for real time encryption/decryption of motion pictures. Further, a method of polarisation encrypting and decrypting information. The encryption/decryption is performed optically while the communication is performed electronically....

  18. Secure Mobile Agent for Telemedicine Based on P2P Networks

    OpenAIRE

    Hsu, Wen-Shin; Pan, Jiann-I

    2013-01-01

    Exploring intelligent mobile agent (MA) technology for assisting medical services or transmitting personal patient-health information in telemedicine applications has been widely investigated. Conversely, peer-to-peer (P2P) networking has become one of the most popular applications used in the Internet because of its benefits for easy-to-manage resources and because it balances workloads. Therefore, constructing an agent-based telemedicine platform based on P2P networking architecture is nece...

  19. Research and Design of Network Management Construction Based on Mobile AGENT

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    The technical characters of mobile agent (MA) originated in the distributional artificial intelligence domain is introduced. A network management construc- tion based on agent (NMCA) is then proposed. The NMCA structure features are elaborated in detail. A prototype design of NMCA is given by using the jKQML programming. The establishment of NMCA platform will be helpful to reduce the correspondence load of network management and improves the efficiency and the expansion ability of network management systems.

  20. Auto-agent: a behavior-based architecture for mobile navigation

    Science.gov (United States)

    Hwang, Kaoshing; Ju, Ming-Yi

    1998-10-01

    The design and construction of mobile robots is as much art as a science. In hardware architecture, researchers tend to construct a low-cost and reliable platform which equips with various sensory system for sensing the change of the environment to offer useful information to the navigation system. An autonomous navigation system plays a role in an mobile robot as the brain in human being. It generates action command according to those sensory data from the perception system to direct the mobile robot to go to desired positions or accomplish useful tasks without human intervention in real-world. An important problem in autonomous navigation is the need to cope with the large amount of uncertainty that is inherent of natural environment. Therefore the development of techniques for autonomous navigation in real-world environments constitutes one of the major trends in the current research on robotics. Inspired with the concept of software agents, reactive control and behavior-based control, a modular architecture, called Auto-agent, for mobile navigation is proposed. The main characteristic of Auto-agent is as following: Behavioral agents cooperate by means of communicating with other behavioral agents intermittently to achieve their local goal and the goals of the community as a whole because no one individually has sufficient competence, resources and information to solve the entire problem. Auto-agent gains advantages from the characteristics of distributed system, it offers the possibility to find an acceptable solution with a reasonable time and complexity range. Besides, the modular structure is convenient for an engineer to construct a new behavioral agent and to add it into Auto-agent.

  1. Flocking Control of Multiple Mobile Agents with the Rules of Avoiding Collision

    Directory of Open Access Journals (Sweden)

    Hongtao Zhou

    2015-01-01

    Full Text Available This paper investigates the flocking and the coordinative control problems of multiple mobile agents with the rules of avoiding collision. We propose a set of control laws using hysteresis in adding new links and applying new potential function to guarantee that the fragmentation of the network can be avoided, under which all agents approach a common velocity vector, and asymptotically converge to a fixed value of interagent distances and collisions between agents can be avoided throughout the motion. Furthermore, we extend the flocking algorithm to solve the flocking situation of the group with a virtual leader agent. The laws can make all agents asymptotically approach the virtual leader and collisions can be avoided between agents in the motion evolution. Finally, some numerical simulations are showed to illustrate the theoretical results.

  2. Computationally Efficient Searchable Symmetric Encryption

    NARCIS (Netherlands)

    Liesdonk, van Peter; Sedghi, Saeed; Doumen, Jeroen; Hartel, Pieter; Jonker, Willem; Jonker, Willem; Petkovic, Milan

    2010-01-01

    Searchable encryption is a technique that allows a client to store documents on a server in encrypted form. Stored documents can be retrieved selectively while revealing as little information as possible to the server. In the symmetric searchable encryption domain, the storage and the retrieval are

  3. Multilevel Image Encryption

    CERN Document Server

    Rakesh, S; Shadakshari, B C; Annappa, B

    2012-01-01

    With the fast evolution of digital data exchange and increased usage of multi media images, it is essential to protect the confidential image data from unauthorized access. In natural images the values and position of the neighbouring pixels are strongly correlated. The method proposed in this paper, breaks this correlation increasing entropy of the position and entropy of pixel values using block shuffling and encryption by chaotic sequence respectively. The plain-image is initially row wise shuffled and first level of encryption is performed using addition modulo operation. The image is divided into blocks and then block based shuffling is performed using Arnold Cat transformation, further the blocks are uniformly scrambled across the image. Finally the shuffled image undergoes second level of encryption by bitwise XOR operation, and then the image as a whole is shuffled column wise to produce the ciphered image for transmission. The experimental results show that the proposed algorithm can successfully enc...

  4. Homomorphic encryption from codes

    CERN Document Server

    Bogdanov, Andrej

    2011-01-01

    We propose a new homomorphic encryption scheme based on the hardness of decoding under independent random noise from certain affine families of codes. Unlike in previous lattice-based homomorphic encryption schemes, where the message is hidden in the noisy part of the ciphertext, our scheme carries the message in the affine part of the transformation and applies noise only to achieve security. Our scheme can tolerate noise of arbitrary magnitude, as long as the noise vector has sufficiently small hamming weight (and its entries are independent). Our design achieves "proto-homomorphic" properties in an elementary manner: message addition and multiplication are emulated by pointwise addition and multiplication of the ciphertext vectors. Moreover, the extremely simple nature of our decryption makes the scheme easily amenable to bootstrapping. However, some complications are caused by the inherent presence of noticeable encryption error. Our main technical contribution is the development of two new techniques for...

  5. Batch Attribute-Based Encryption for Secure Clouds

    Directory of Open Access Journals (Sweden)

    Chen Yang

    2015-10-01

    Full Text Available Cloud storage is widely used by organizations due to its advantage of allowing universal access with low cost. Attribute-based encryption (ABE is a kind of public key encryption suitable for cloud storage. The secret key of each user and the ciphertext are associated with an access policy and an attribute set, respectively; in addition to holding a secret key, one can decrypt a ciphertext only if the associated attributes match the predetermined access policy, which allows one to enforce fine-grained access control on outsourced files. One issue in existing ABE schemes is that they are designed for the users of a single organization. When one wants to share the data with the users of different organizations, the owner needs to encrypt the messages to the receivers of one organization and then repeats this process for another organization. This situation is deteriorated with more and more mobile devices using cloud services, as the ABE encryption process is time consuming and may exhaust the power supplies of the mobile devices quickly. In this paper, we propose a batch attribute-based encryption (BABE approach to address this problem in a provably-secure way. With our approach, the data owner can outsource data in batches to the users of different organizations simultaneously. The data owner is allowed to decide the receiving organizations and the attributes required for decryption. Theoretical and experimental analyses show that our approach is more efficient than traditional encryption implementations in computation and communication.

  6. Formation Control of Mobile Agents with Second-order Nonlinear Dynamics in Unknown Environments Containing Obstacles

    NARCIS (Netherlands)

    Huang, Jie; Cao, Ming; Zhou, Ning

    2016-01-01

    This paper investigates the formation control problem of multiple mobile agents with second-order nonlinear dynamics in complex environments containing multiple obstacles. By employing the null-space-based behavioral (NSB) control architecture, a novel fast terminal sliding mode based adaptive contr

  7. A Context-Aware Self-Adaptive Fractal Based Generalized Pedagogical Agent Framework for Mobile Learning

    Science.gov (United States)

    Boulehouache, Soufiane; Maamri, Ramdane; Sahnoun, Zaidi

    2015-01-01

    The Pedagogical Agents (PAs) for Mobile Learning (m-learning) must be able not only to adapt the teaching to the learner knowledge level and profile but also to ensure the pedagogical efficiency within unpredictable changing runtime contexts. Therefore, to deal with this issue, this paper proposes a Context-aware Self-Adaptive Fractal Component…

  8. Quantization effects on synchronized motion of teams of mobile agents with second-order dynamics

    NARCIS (Netherlands)

    Liu, Hui; Cao, Ming; De Persis, Claudio

    2012-01-01

    For a team of mobile agents governed by second-order dynamics, this paper studies how different quantizers affect the performances of consensus-type schemes to achieve synchronized collective motion. It is shown that when different types of quantizers are used for the exchange of relative position a

  9. Cryptanalysis of the One- Time Proxy Signature Scheme Used in Mobile Agents

    Institute of Scientific and Technical Information of China (English)

    FU Xiao-tong; XIAO Hong; XIAO Guo-zhen

    2005-01-01

    We cryptanalyze Kim et al ' s one-time proxy signature scheme used in mobile agents, and then a successful forgery is introduced. It is showed that a dishonest customer can successfully forge a valid one-time proxy signature by impersonating the server. Furthermore, he can request the server with responsibility for the forged bidding information.

  10. An Agent Based Intrusion Detection Model for Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    B. M. Reshmi

    2006-01-01

    Full Text Available Intrusion detection has over the last few years, assumed paramount importance within the broad realm of network security, more so in case of wireless mobile ad hoc networks. The inherently vulnerable characteristics of wireless mobile ad hoc networks make them susceptible to attacks in-spite of some security measures, and it may be too late before any counter action can take effect. As such, there is a need to complement traditional security mechanisms with efficient intrusion detection and response systems. This paper proposes an agent-based model to address the aspect of intrusion detection in cluster based mobile wireless ad hoc network environment. The model comprises of a set of static and mobile agents, which are used to detect intrusions, respond to intrusions, and distribute selected and aggregated intrusion information to all other nodes in the network in an intelligent manner. The model is simulated to test its operation effectiveness by considering the performance parameters such as, detection rate, false positives, agent overheads, and intrusion information distribution time. Agent based approach facilitates flexible and adaptable security services. Also, it supports component based software engineering components such as maintainability, reachability, reusability, adaptability, flexibility, and customization.

  11. 'Do you smell rotten eggs?' Evaluating interactions with mobile agents in crisis response situations

    NARCIS (Netherlands)

    A. Winterboer; H.S.M. Cramer; G. Pavlin; F.C.A. Groen; V. Evers

    2009-01-01

    In this paper, we present ongoing research concerning the interaction between users and autonomous mobile agents in the environmental monitoring domain. The overarching project, DIADEM, deals with developing a system that detects potentially hazardous situations in populated industrial areas using i

  12. MAPPS: A Framework of Peer-to-Peer Systems Based on JXTA and Mobile Agents

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    Due to the success of Napster, Gnutella and Freenet, peer to peer (P2P) computing has suddenly emerged at the forefront of Internet computing. And a lot of problems including security, reliability and rooting are urgent to be solved.Unfortunately, traditional techniques are not directly applicable to P2P systems. This paper presents a new framework called MAPPS for designing P2P applications based on JXTA and mobile agents. The MAPPS framework is structured as three layers:the MAPPS infiastmcture based on mobile agents, MAPPS services and MAPPS applications. In this way, MAPPS not only follows the ootstanding architecture of JXTA, but also enhances the mobility and flexibility of P2P systems. Using MAPPS,developers of new P2P systems can design and implement P2P systems more efficiently.

  13. Sub-head Transmission of Heterogeneous Data by Cloned Agent to Android Mobile

    Directory of Open Access Journals (Sweden)

    S. Karthikeyan

    2014-07-01

    Full Text Available The occurrence of an event can be detected using sensor nodes. The eminent constraint of these sensor nodes is the non-replenishing battery. Conservation of energy is an important aspect due to its limited battery power. Energy utilization using cloned mobile agents is the ultimate aim in this proposed work. The network is divided into clusters and 2 subheads are elected from each cluster. The event occurred is sensed by a sensor and is transmitted to the subhead. The cloned mobile agent collects data from the subhead and transmits it to the sink. The gathered data from sink is then transferred to android mobile. The advantages of this mechanism are less delay and reduced energy consumption. When the energy of existing subhead is reduced to half of its initial energy, new subhead is selected. Thus energy utilization is minimized and overall lifetime of network is increased.

  14. Multiple Servers - Queue Model for Agent Based Technology in Cache Consistence Maintenance of Mobile Environment

    Directory of Open Access Journals (Sweden)

    G.Shanmugarathinam

    2013-01-01

    Full Text Available Caching is one of the important techniques in mobile computing. In caching, frequently accessed data is stored in mobile clients to avoid network traffic and improve the performance in mobile computing. In a mobile computing environment, the number of mobile users increases and requests the server for any updation, but most of the time the server is busy and the client has to wait for a long time. The cache consistency maintenance is difficult for both client and the server. This paper is proposes a technique using a queuing system consisting of one or more servers that provide services of some sort to arrive mobile hosts using agent based technology. This services mechanism of a queuing system is specified by the number of servers each server having its own queue, Agent based technology will maintain the cache consistency between the client and the server .This model saves wireless bandwidth, reduces network traffic and reduces the workload on the server. The simulation result was analyzed with previous technique and the proposed model shows significantly better performance than the earlier approach.

  15. AN INTELLIGENT MOBILE-AGENT BASED SCALABLE NETWORK MANAGEMENT ARCHITECTURE FOR LARGE-SCALE ENTERPRISE SYSTEM

    Directory of Open Access Journals (Sweden)

    A.K. Sharma

    2012-02-01

    Full Text Available Several Mobile Agent based distributed network management models have been proposed in recent times toaddress the scalability and flexibility problems of centralized (SNMP or CMIP management modelsmodels. Though the use of Mobile Agents to distribute and delegate management tasks comes handy indealing with the previously stated issues, many of the agent-based management frameworks like initial flatbed models and static mid-level managers employing mobile agents models cannot efficiently meet thedemands of current networks which are growing in size and complexity. Moreover, varied technologies,such as SONET, ATM, Ethernet, DWDM etc., present at different layers of the Access, Metro and Core(long haul sections of the network, have contributed to the complexity in terms of their own framing andprotocol structures. Thus, controlling and managing the traffic in these networks is a challenging task. Thispaper presents an intelligent scalable hierarchical agent based model for the management of large-scalecomplex networks to address aforesaid issues. The cost estimation, carried out with a view to compute theoverall management cost in terms of management data overhead, is being presented. The results obtainedthereafter establish the usefulness of the presented architecture as compare to centralized and flat bedagent based models.

  16. Chaos based encryption system for encrypting electroencephalogram signals.

    Science.gov (United States)

    Lin, Chin-Feng; Shih, Shun-Han; Zhu, Jin-De

    2014-05-01

    In the paper, we use the Microsoft Visual Studio Development Kit and C# programming language to implement a chaos-based electroencephalogram (EEG) encryption system involving three encryption levels. A chaos logic map, initial value, and bifurcation parameter for the map were used to generate Level I chaos-based EEG encryption bit streams. Two encryption-level parameters were added to these elements to generate Level II chaos-based EEG encryption bit streams. An additional chaotic map and chaotic address index assignment process was used to implement the Level III chaos-based EEG encryption system. Eight 16-channel EEG Vue signals were tested using the encryption system. The encryption was the most rapid and robust in the Level III system. The test yielded superior encryption results, and when the correct deciphering parameter was applied, the EEG signals were completely recovered. However, an input parameter error (e.g., a 0.00001 % initial point error) causes chaotic encryption bit streams, preventing the recovery of 16-channel EEG Vue signals.

  17. ATM encryption testing

    Science.gov (United States)

    Capell, Joyce; Deeth, David

    1996-01-01

    This paper describes why encryption was selected by Lockheed Martin Missiles & Space as the means for securing ATM networks. The ATM encryption testing program is part of an ATM network trial provided by Pacific Bell under the California Research Education Network (CalREN). The problem being addressed is the threat to data security which results when changing from a packet switched network infrastructure to a circuit switched ATM network backbone. As organizations move to high speed cell-based networks, there is a break down in the traditional security model which is designed to protect packet switched data networks from external attacks. This is due to the fact that most data security firewalls filter IP packets, restricting inbound and outbound protocols, e.g. ftp. ATM networks, based on cell-switching over virtual circuits, does not support this method for restricting access since the protocol information is not carried by each cell. ATM switches set up multiple virtual connections, thus there is no longer a single point of entry into the internal network. The problem is further complicated by the fact that ATM networks support high speed multi-media applications, including real time video and video teleconferencing which are incompatible with packet switched networks. The ability to restrict access to Lockheed Martin networks in support of both unclassified and classified communications is required before ATM network technology can be fully deployed. The Lockheed Martin CalREN ATM testbed provides the opportunity to test ATM encryption prototypes with actual applications to assess the viability of ATM encryption methodologies prior to installing large scale ATM networks. Two prototype ATM encryptors are being tested: (1) `MILKBUSH' a prototype encryptor developed by NSA for transmission of government classified data over ATM networks, and (2) a prototype ATM encryptor developed by Sandia National Labs in New Mexico, for the encryption of proprietary data.

  18. Performance Analysis of a Highly Available Home Agent in Mobile Networks

    Directory of Open Access Journals (Sweden)

    Abdelgadir T. Abdelgadir

    2011-01-01

    Full Text Available Problem statement: Network Mobility as a service is provided by the NEMO protocol in IPv6 environments. NEMO is an extension to MIPv6 and thus inherits the same reliability problems of MIPv6. MIPv6 is not reliable because the Home Agent (HA is a single point of failure. In order to provide real-time services for MIPv6 networks, reliability should be considered as part of any high availability solution used to deploy Mobile IPv6 networks. Approach: Many approaches have been taken to solve the problem of HA as a single point of failure. In our proposed solution, failure detection and recovery is handled by the home agent. Therefore, recovery is transparent to the mobile network. Results: In this study we opted for using HA redundancy to provide a highly available home agent solution which achieves recovery times suitable for real-time applications. Conclusion: The results show that achieving high availability in IPv6 based mobile networks which support NEMO is possible.

  19. Agent based User Interface Design for Mobile Cloud Computing Environment (AUID

    Directory of Open Access Journals (Sweden)

    A. Viswanatha Reddy

    2012-06-01

    Full Text Available Mobility is the need of the hour and the Mobile Clouds are becoming popular and are able to meet the needs of the current day customers. Cloud computing being the state of art technology enables the individuals, entrepreneurs, small and medium companies to carry on their personal and business activities at all levels, without any interruption. Provisioning and offering an exactly matching service to the highly demanding customer has been a night mare and will continue to be the same in the mobile environment. In this paper, we propose an Interactive Multi Agent based User Interface that interacts with the end user on one side and with the mobile network cloud on the other side and offers an optimal solution so as to balance the interests of both the parties. Here the Mobile Agent Manager with its simple architecture and interactive capability, understands, analyzes and organizes the services being offered by the cloud to achieve customer satisfaction always and every time and on demand to meet explicit needs

  20. Electrophoretic mobilities of dissolved polyelectrolyte charging agent and suspended non-colloidal titanium during electrophoretic deposition

    Energy Technology Data Exchange (ETDEWEB)

    Lau, Kok-Tee [School of Materials Science and Engineering, University of New South Wales, Sydney, NSW 2052 (Australia); Faculty of Manufacturing Engineering, Universiti Teknikal Malaysia Melaka, 76109 Durian Tunggal, Melaka (Malaysia); Sorrell, C.C., E-mail: C.Sorrell@unsw.edu.au [School of Materials Science and Engineering, University of New South Wales, Sydney, NSW 2052 (Australia)

    2011-03-25

    Coarse ({<=}20 {mu}m) titanium particles were deposited on low-carbon steel substrates by cathodic electrophoretic deposition (EPD) with ethanol as suspension medium and poly(diallyldimethylammonium chloride) (PDADMAC) as polymeric charging agent. Preliminary data on the electrophoretic mobilities and electrical conductivities on the suspensions of these soft particles as well as the solutions themselves as a function of PDADMAC level were used as the basis for the investigation of the EPD parameters in terms of the deposition yield as a function of five experimental parameters: (a) PDADMAC addition level, (b) solids loading, (c) deposition time, (d) applied voltage, and (e) electrode separation. These data were supported by particle sizing by laser diffraction and deposit surface morphology by scanning electron microscopy (SEM). The preceding data demonstrated that Ti particles of {approx}1-12 {mu}m size, electrosterically modified by the PDADMAC charging agent, acted effectively as colloidal particles during EPD. Owing to the non-colloidal nature of the particles and the stabilization of the Ti particles by electrosteric forces, the relevance of the zeta potential is questionable, so the more fundamental parameter of electrophoretic mobility was used. A key finding from the present work is the importance of assessing the electrophoretic mobilities of both the suspensions and solutions since the latter, which normally is overlooked, plays a critical role in the ability to interpret the results meaningfully. Further, algebraic uncoupling of these data plus determination of the deposit yield as a function of charging agent addition allow discrimination between the three main mechanistic stages of the electrokinetics of the process, which are: (1) surface saturation; (2) compression of the diffuse layer, growth of polymer-rich layer, and/or competition between the mobility of Ti and PDADMAC; and (3) little or no decrease in electrophoretic mobility of Ti

  1. Reversible Data Hiding In Encrypted Images Using Improved Encryption Technique

    Directory of Open Access Journals (Sweden)

    Balika J. Chelliah

    2015-11-01

    Full Text Available Recently more and more attention is paid to reversible data hiding (RDH in encrypted images, since it maintains the excellent property that the original cover can be losslessly recovered after embedded data is extracted while protecting the image content‟s confidentiality. All previous methods embed data by reversibly vacating room from the encrypted images, which may be some errors on data extraction and/or image restoration. In this paper we propose a different scheme which attains real reversibility by reserving room before encryption with a traditional RDH algorithm, and then encrypting the data and embedding the data in the encrypted image, which is encrypted using a new proposed algorithm. The proposed method can achieve real reversibility that is data extraction and image recoveries are free of any error.

  2. Reversible Data Hiding In Encrypted Images Using Improved Encryption Technique

    Directory of Open Access Journals (Sweden)

    Mr. Balika J. Chelliah

    2014-03-01

    Full Text Available Recently more and more attention is paid to reversible data hiding (RDH in encrypted images, since it maintains the excellent property that the original cover can be losslessly recovered after embedded data is extracted while protecting the image content‟s confidentiality. All previous methods embed data by reversibly vacating room from the encrypted images, which may be some errors on data extraction and/or image restoration. In this paper we propose a different scheme which attains real reversibility by reserving room before encryption with a traditional RDH algorithm, and then encrypting the data and embedding the data in the encrypted image, which is encrypted using a new proposed algorithm. The proposed method can achieve real reversibility that is data extraction and image recoveries are free of any error.

  3. A Solution Model to Protect Mobile Agents Against Malicious Host Attack

    Institute of Scientific and Technical Information of China (English)

    迈克尔; 徐良贤

    2003-01-01

    Within an agent server, the model introduces a trusted third party entity called Secure Service Station(SSS). The SSS is a non-hardware component and is intended to prevent most attacks performed by malicioushosts, by providing mechanisms that ensure attack detection and provide integrity to mobile agents. This nobletechnique involves encapsulating partial results obtained on each intermediate host and binding these results togeth-er using a hash function, thus forming a strong bonded chain that cannot be compromised. An analytical model toexplore the system performance was also developed.

  4. Establishing Efficient C2C E-alliance Based on Mobile Agent

    Institute of Scientific and Technical Information of China (English)

    YU Xiao-bing; GUO Shun-sheng; GUO Jun

    2010-01-01

    In order to alleviate difficulties of conducting consumer-to-consumer(C2C)e-commerce transaction,establishing efficient e-alliance was proposed.E-alliance is the union of e-commerce sites.It is constructed by mobile agents.The mobile agent architecture was discussed.The process of selecting suitable e-commerce site to e-alliance was presented based on support vector machine(SVM)and fuzzy method.A prototype of the proposed system is implemented on a web platform.To enable data exchange between e-alliance and e-commerce,the system employs XML as data format.The prototype has demonstrated that the efficient C2C e-alliance is reasonable.

  5. Study of the Improvement on Network Management Performance with Mobile Agent

    Institute of Scientific and Technical Information of China (English)

    LI Jie; WANG Ru-chuan

    2003-01-01

    Owing to the increasing great complexity, computer network systems require more sophisticated management strategies to be adopted so as to guarantee adequate levels of performance. The classic centralized paradigm, adopted by SNMP, which was once appropriate in the prevenient phrase, has posed problems with the explosive expansion of networks, as well as other centralized models. Mobile Agent (MA), owing to its capability of implementing a distributed system, represents a challenging approach to provide network management with high performance. In this paper we analyze the network management structure model based on MA at first, and then we put forward a reference scenario based on MA and compare it with the traditional model. We also describe a prototype implementation based on our mobile agent system named MAS. Finally, we do some experiments to verify the performance of our framework prototype.

  6. Enhancement of QoS in Mobile Network through Channel Allocation using Software Agents

    Directory of Open Access Journals (Sweden)

    Nitin Muchhal

    2011-05-01

    Full Text Available In the last two decades the demand for mobile hosts is increasing rapidly. One of the biggest challenges in cellular systems is to fulfill the mobile user demand under the constraint of the limited spectrum. Some of the most common methods to increase the channel allocation and utilization are resource allocation schemes. Various channel allocation schemes have been proposed to provide Quality of Service (QoS and efficient channel utilization in cellular networks. This paper proposes architecture of Multi-agent system consisting of software agents to implement distributed dynamic channel allocation strategy. The strategy is based on the channel reassignment within the cell boundary and chained channel borrowing in neighboring cell areas. The QoS parameters analyzed are Call dropping probability and Call blocking probability.

  7. Secure mobile agent for telemedicine based on P2P networks.

    Science.gov (United States)

    Hsu, Wen-Shin; Pan, Jiann-I

    2013-06-01

    Exploring intelligent mobile agent (MA) technology for assisting medical services or transmitting personal patient-health information in telemedicine applications has been widely investigated. Conversely, peer-to-peer (P2P) networking has become one of the most popular applications used in the Internet because of its benefits for easy-to-manage resources and because it balances workloads. Therefore, constructing an agent-based telemedicine platform based on P2P networking architecture is necessary. The main purpose of this paper is to construct a safe agent-based telemedicine that based on P2P networking architecture. Two themes are addressed in this paper: (a) the P2P network architecture for an agent-based telemedicine service, and (b) the security mechanisms for the proposed telemedicine networking architecture. When an MA contains patient information and migrates from one host to another through the Internet, it can be attacked by other software agents or agent platforms that can illegally access patient information. The proposed P2P network architecture is based on the JXTA protocol and provides two types of telemedicine service models: the predictable service model and unpredictable service model. This architecture employs a two-layer safety mechanism for MAs (i.e., time-limited black boxes and RSA undetachable signature technologies), to provide a secure solution for agent-based telemedicine services.

  8. 移动Agent互操作性研究%The Research of the Interoperability of Mobile Agent

    Institute of Scientific and Technical Information of China (English)

    张云勇; 刘锦德

    2001-01-01

    Mobile Agent has taken a very momentous influence on some fields such as collaborative system and workflow management system because of its unique technical advantages. Until today,a large number of mobile Agent platforms have been developed but it is very difficult to collaborate those different Agent systems since the difference among their design structure and the technology which they take. Solving the interoperability of mobile Agent becomes the primary task. In this paper, the specification of MASIF is studied in detail,a clue of solving the interoperability is put forward and an addon for the interoperability of mobile Agent system called MASIF addon is developed by ourselves based on the specification.

  9. Computational Research on Mobile Pastoralism Using Agent-Based Modeling and Satellite Imagery.

    Directory of Open Access Journals (Sweden)

    Takuto Sakamoto

    Full Text Available Dryland pastoralism has long attracted considerable attention from researchers in diverse fields. However, rigorous formal study is made difficult by the high level of mobility of pastoralists as well as by the sizable spatio-temporal variability of their environment. This article presents a new computational approach for studying mobile pastoralism that overcomes these issues. Combining multi-temporal satellite images and agent-based modeling allows a comprehensive examination of pastoral resource access over a realistic dryland landscape with unpredictable ecological dynamics. The article demonstrates the analytical potential of this approach through its application to mobile pastoralism in northeast Nigeria. Employing more than 100 satellite images of the area, extensive simulations are conducted under a wide array of circumstances, including different land-use constraints. The simulation results reveal complex dependencies of pastoral resource access on these circumstances along with persistent patterns of seasonal land use observed at the macro level.

  10. The end of encryption

    CERN Multimedia

    Computer Security Team

    2013-01-01

    Sigh! Pandora’s box has been opened (once again). Recent documents leaked by whistle-blower Edward Snowden have revealed that the NSA project “Bullrun” is intruding deeply into the confidentiality of our documents and the privacy of our lives.   In their continuous effort to kill privacy on the Internet, the US National Security Agency (NSA) and the British Government Communications Headquarters (GCHQ) have made significant progress in breaking almost every basic encryption protocol or have developed the means to bypass them. “US and British intelligence agencies have successfully cracked much of the online encryption relied upon by hundreds of millions of people to protect the privacy of their personal data, online transactions and e-mails.” - The Guardian So what’s left? With “Prism” and “Tempora”, our public communication on the Internet was already filtered and analysed (see our Bulletin ar...

  11. Primal implication as encryption

    OpenAIRE

    Krupski, Vladimir

    2013-01-01

    We propose a "cryptographic" interpretation for the propositional connectives of primal infon logic introduced by Y. Gurevich and I. Neeman and prove the corresponding soundness and completeness results. Primal implication $\\imp{\\varphi}{\\psi}$ corresponds to the encryption of $\\psi$ with a secret key $\\varphi$, primal disjunction $\\vp{\\varphi}{\\psi}$ is a group key and $\\bot$ reflects some backdoor constructions such as full superuser permissions or a universal decryption key. For the logic ...

  12. On the Feasibility of Attribute-Based Encryption on Smartphone Devices

    OpenAIRE

    Ambrosin, Moreno; Conti, Mauro; Dargahi, Tooska

    2015-01-01

    Attribute-Based Encryption (ABE) is a powerful cryptographic tool that allows fine-grained access control over data. Due to its features, ABE has been adopted in several applications, such as encrypted storage or access control systems. Recently, researchers argued about the non acceptable performance of ABE when implemented on mobile devices. Indeed, the non feasibility of ABE on mobile devices would hinder the deployment of novel protocols and services--that could instead exploit the full p...

  13. Overview on Selective Encryption of Image and Video: Challenges and Perspectives

    Directory of Open Access Journals (Sweden)

    Massoudi A

    2008-01-01

    Full Text Available In traditional image and video content protection schemes, called fully layered, the whole content is first compressed. Then, the compressed bitstream is entirely encrypted using a standard cipher (DES, AES, IDEA, etc.. The specific characteristics of this kind of data (high-transmission rate with limited bandwidth make standard encryption algorithms inadequate. Another limitation of fully layered systems consists of altering the whole bitstream syntax which may disable some codec functionalities. Selective encryption is a new trend in image and video content protection. It consists of encrypting only a subset of the data. The aim of selective encryption is to reduce the amount of data to encrypt while preserving a sufficient level of security. This computation saving is very desirable especially in constrained communications (real-time networking, high-definition delivery, and mobile communications with limited computational power devices. In addition, selective encryption allows preserving some codec functionalities such as scalability. This tutorial is intended to give an overview on selective encryption algorithms. The theoretical background of selective encryption, potential applications, challenges, and perspectives is presented.

  14. Mobile-Agent的空洞避免路由算法%Hole Avoiding Routing Algorithm with Mobile-Agent

    Institute of Scientific and Technical Information of China (English)

    杨云; 顾沈君; 徐文春; 田浩澄; 韩龙生

    2012-01-01

    为了解决空洞恢复路由算法在能耗、路由开销及可扩展性等方面的问题,提出了使用移动代理(mobileagent,MA)进行网间处理来避免“路由空洞”的算法(hole avoiding routing algorithm with mobile-agent,HAMA).HAMA将网络中的节点分为“空洞相关节点”或“空洞无关节点”,通过采用MA方式,对“空洞相关节点”进行路由处理,为其找到一个最优下一跳节点,最终成功建立到Sink节点的路由,从而达到避免“路由空洞”的目的.HAMA使节点提前意识到“路由空洞”的存在,尽可能绕开路由空洞,从而降低网络能耗,均衡网络负载.与经典空洞路由算法GPSR(greedy perimeter stateless routing)相比,HAMA能够成功避免“路由空洞”,即使遇到“空洞相关节点”,也能较为成功地启用各种恢复机制绕过空洞,具有低成本、高性能的特点.%To solve problems such as energy consumption, routing efficiency and scalability in routing recovery algorithms, this paper proposes a hole avoiding routing algorithm with mobile-agent (HAMA). For the purpose of avoiding routing hole, HAMA divides the routing nodes into "hole relevant nodes" or "hole irrelevant nodes", deals with hole relevant nodes by routing algorithm with mobile-agent to find their optimal next node, and finally sets up a routing path to the Sink. The HAMA nodes are aware of the existence of "routing hole" in advance as much as possible to bypass the routing hole. The proposed algorithm is superior to other hole avoiding algorithms in reducing energy consumption and balancing network load. Compared with classic hole routing algorithm GPSR (greedy perimeter stateless routing), HAMA with low cost and high performance characteristics, can avoid hole successfully, and even has recovery mechanism when encountering hole relevant node.

  15. A mobile-agent-based approach to software coordination inthe HOOPE system

    Institute of Scientific and Technical Information of China (English)

    马晓星; 吕建; 陶先平; 李英军; 胡昊

    2002-01-01

    Software coordination is central to the construction of large-scale high-performance distributed applications with software services scattered over the decentralized Internet. In this paper, a new mobile-agent-based architecture is proposed for the utilization and coordination of geographically distributed computing resources. Under this architecture, a user application is built with a set of software agents that can travel across the network autonomously. These agents utilize the distributed resources and coordinate with each other to complete their task. This approach's advantages include the natural expression and flexible deployment of the coordination logic, the dynamic adaptation to the network environment and the potential of better application performance. This coordination architecture, together with an object-oriented hierarchical parallel application framework and a graphical application construction tool, is implemented in the HOOPE environment, which provides a systematic support for the development and execution of Internet-based distributed and parallel applications in the petroleum exploration industry.

  16. Behaviour Study of a Multi-Agent Mobile Robot System during Potential Field Building

    Directory of Open Access Journals (Sweden)

    István Nagy

    2009-12-01

    Full Text Available In this paper a multi-agent based mobile robot simulation system will bepresented where the behaviour of the system is studied with different number of agents (1,3,6 and also with different number of ultrasonic range sensors on agents (8 or 16 USsensors on individual agents. The task of the autonomous agents is to create the potentialfield (PF of an unknown environment. The classic problems of PF building, like oscillationand trapping, are not the focus of the article, but instead, the article is concerned with theagents’ self-organizing ability where self-organizing is controlled by a genetic algorithm(GA. The GA is equipped with two fitness functions where one “maintains” the distancesbetween certain agents (spat distr, while another “watches” the area coverage (areacover. In fact, the paper can be divided into three main parts. The first part describes theultrasonic sensing and range measuring with systematic errors, the potential field (PFbuilding and the moving strategies. The second part contains description of the GA, theoperation of the GA, the structure of the system, the fitness functions and a general systemerrordetermination. In the final third part, the obtained results are analyzed and presentedin the appendices.

  17. Designing a meta-level architecture in Java for adaptive parallelism by mobile software agents

    Science.gov (United States)

    Dominic, Stephen Victor

    Adaptive parallelism refers to a parallel computation that runs on a pool of processors that may join or withdraw from a running computation. In this dissertation, a functional system of agents and agent behaviors for adaptive parallelism is developed. Software agents have the properties of robustness and have capacity for fault-tolerance. Adaptation and fault-tolerance emerge from the interaction of self-directed autonomous software agents for a parallel computation application. The multi-agent system can be considered an object-oriented system with a higher-level architectural component, i.e., a meta level for agent behavior. The meta-level object architecture is based on patterns of behavior and communication for mobile agents, which are developed to support cooperative problem solving in a distributed-heterogeneous computing environment. Although parallel processing is a suggested application domain for mobile agents implemented in the Java language, the development of robust agent behaviors implemented in an efficient manner is an active research area. Performance characteristics for three versions of a pattern recognition problem are used to demonstrate a linear speed-up with efficiency that is compared to research using a traditional client-server protocol in the C language. The best ideas from existing approaches to adaptive parallelism are used to create a single general-purpose paradigm that overcomes problems associated with nodefailure, the use of a single-centralized or shared resource, requirements for clients to actively join a computation, and a variety of other limitations that are associated with existing systems. The multi-agent system, and experiments, show how adaptation and parallelism can be exploited by a meta-architecture for a distributed-scientific application that is of particular interest to design of signal-processing ground stations. To a large extent the framework separates concern for algorithmic design from concern for where and

  18. Emergence of a snake-like structure in mobile distributed agents: an exploratory agent-based modeling approach.

    Science.gov (United States)

    Niazi, Muaz A

    2014-01-01

    The body structure of snakes is composed of numerous natural components thereby making it resilient, flexible, adaptive, and dynamic. In contrast, current computer animations as well as physical implementations of snake-like autonomous structures are typically designed to use either a single or a relatively smaller number of components. As a result, not only these artificial structures are constrained by the dimensions of the constituent components but often also require relatively more computationally intensive algorithms to model and animate. Still, these animations often lack life-like resilience and adaptation. This paper presents a solution to the problem of modeling snake-like structures by proposing an agent-based, self-organizing algorithm resulting in an emergent and surprisingly resilient dynamic structure involving a minimal of interagent communication. Extensive simulation experiments demonstrate the effectiveness as well as resilience of the proposed approach. The ideas originating from the proposed algorithm can not only be used for developing self-organizing animations but can also have practical applications such as in the form of complex, autonomous, evolvable robots with self-organizing, mobile components with minimal individual computational capabilities. The work also demonstrates the utility of exploratory agent-based modeling (EABM) in the engineering of artificial life-like complex adaptive systems.

  19. 基于Mobile-C移动代理的函数库封装与应用%Encapsulation and apply of the function library based on the Mobile-C mobile agent

    Institute of Scientific and Technical Information of China (English)

    李闯; 葛为民; 王肖峰

    2012-01-01

    本文基于Mobile-C移动代理控制移动机器人,简述了Mobile-C与Ch的优势,详细介绍了Mobile-C移动代理函数库的原理机制与封装调用.移动机器人通过Mobile-C移动代理来实现控制,可以在运行中动态地切换成新的算法,函数库的使用使得代理传送的代码量大大减少,减少网络延时,同时使程序的结构简单明了,为复杂控制的实现做好基础.文章最后用一个简单的实验验证了Mobile-C移动代理函数库封装的正确性.%This paper, based on the control of mobile robot by the Mobile-C mobile agent, introduces the advantages of mobile agent combined with Cb, details the mechanism and encapsulation of the Mobile-C function library. By the control of Mobile-C mobile agent, robots can dynamically switch to the new algorithm at runtime. The function library makes the agent transfer code decrease greatly, reduce the network time delay, at the same time makes program structure simple and clear, it does a good job in basic for the realization of complex control. At last, a simple experiment verifies the correctness of the Mobile-C mobile agent function library encapsulation.

  20. Substring-Searchable Symmetric Encryption

    Directory of Open Access Journals (Sweden)

    Chase Melissa

    2015-06-01

    Full Text Available In this paper, we consider a setting where a client wants to outsource storage of a large amount of private data and then perform substring search queries on the data – given a data string s and a search string p, find all occurrences of p as a substring of s. First, we formalize an encryption paradigm that we call queryable encryption, which generalizes searchable symmetric encryption (SSE and structured encryption. Then, we construct a queryable encryption scheme for substring queries. Our construction uses suffix trees and achieves asymptotic efficiency comparable to that of unencrypted suffix trees. Encryption of a string of length n takes O(λn time and produces a ciphertext of size O(λn, and querying for a substring of length m that occurs k times takes O(λm+k time and three rounds of communication. Our security definition guarantees correctness of query results and privacy of data and queries against a malicious adversary. Following the line of work started by Curtmola et al. (ACM CCS 2006, in order to construct more efficient schemes we allow the query protocol to leak some limited information that is captured precisely in the definition. We prove security of our substring-searchable encryption scheme against malicious adversaries, where the query protocol leaks limited information about memory access patterns through the suffix tree of the encrypted string.

  1. Homomorphic encryption and secure comparison

    DEFF Research Database (Denmark)

    Damgård, Ivan Bjerre; Geisler, Martin; Krøigaard, Mikkel

    2008-01-01

    We propose a protocol for secure comparison of integers based on homomorphic encryption.We also propose a homomorphic encryption scheme that can be used in our protocol, makes it more efficient than previous solutions, and can also be used as the basis of efficient and general secure Multiparty C...

  2. Phase-only optical encryption

    DEFF Research Database (Denmark)

    Mogensen, P.C.; Glückstad, J.

    2000-01-01

    We have implemented a phase-only optical encryption and decryption system with a readout based on the generalized phase-contrast method. The experimental system has been implemented with Liquid-crystal spatial light modulators to generate binary phase-encrypted masks and a decrypting key. A phase...

  3. Migration Mechanism for the Mobile Agent Based on .Net%.NET环境下的移动代理迁移机制

    Institute of Scientific and Technical Information of China (English)

    王丹; 于戈; 王国仁

    2003-01-01

    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.

  4. Location Privacy Preservation in Mobile P2P Encryption Based on Non-trusted Users%基于非可信用户的P2P加密位置隐私保护

    Institute of Scientific and Technical Information of China (English)

    周红亚; 张倩

    2016-01-01

    近年来,随着移动互联网及智能移动设备的飞速发展,位置服务给人们的生活带来了极大的便利,但是,用户的位置隐私也受到了极大的威胁.文中从LBS位置隐私保护的实际应用出发,根据现有的位置隐私保护模型,分析不同LBS隐私保护的系统结构的优缺点,介绍了在移动分布式P2 P结构的构造方法,提出了基于非可信用户的P2 P加密位置隐私保护方案.该方案建立在所有角色都不可信的基础上,通过使用将位置隐私和用户隐私分开处理的方式及采用加密的方法来保护用户的隐私.该方案能提供精确地理位置服务,获得精确查询结果的同时还能抵御各种恶意角色攻击,包括恶意邻居节点、恶意LBS服务器、两者的合谋攻击以及连续查询攻击和区域密度攻击,有效地保护了用户的隐私信息.%In recent years,with the rapid development of mobile Internet and portable devices,location services has brought great conven-ience to people' s lives,but user privacy has also been a lot of threats. Based on the practical application of LBS location privacy protec-tion,according to the existing location privacy protection model,it analyzes the pros and cons of the system structure of different LBS pri-vacy in this paper,and briefly describes mobile construction method of distributed P2P architecture,then an encrypted location scheme of privacy protection for P2P based on non-trusted user has been put forward. The scheme builds on all the roles are not credible,through location on privacy and privacy of users be handled separately,and uses encryption method to protect users' privacy. The program not on-ly can provide a precise location for precise query results but also safeguard against different kinds of malicious attacks,including mali-cious neighbor nodes,malicious LBS servers,the two conspired to attack,continuous queries and regional density attack,which protect privacy of the user' s

  5. An Agent Location Transparent Communication Method in Mobile Agent System%可移动agent系统位置透明通信的一种实现

    Institute of Scientific and Technical Information of China (English)

    王红; 林守勋; 曾广周

    2001-01-01

    在可移动的软件Agent(Mobile Software Agent,MSA)的应用中, Agent并不是孤立地完成计算任务,它们需要不断地与其它agent进行信息交换,而agent的位置又是经常变动的.文中提出了一种实现agent位置透明通信的方法,主要解决agent位置追踪问题和agent迁移时的消息处理问题.%Mobile Software Agent (MSA) is a new computing model that is more suitable for current distributed computing environment. In a MSA system, an agent is not isolate in accomplishing computing tasks. It needs to exchange some information with other agents continuously. But the location of an agent is often changed, so two problems have to be solved. First is the Agent Location Tracking, that is how to inform the current location of an agent to other agents when it migrates. Second is the message storage and transfer, that is how to handle the information that is sent to an agent when it is in the procedure of migration. This paper presents a Location Transparent Agent Communication method by using the AgentTracer and the AgentShadow. The AgentTracer is a mapping of each agent ID and its current location. When an agent is created, it gets an AgentShadow which mainly records the agent ID and the address of the AgentTracer to which it belongs. By using the AgentTracer and the AgentShadow, an agent can be traced all through its lifetime. In this paper we first describe the structure of the AgentTracer and the AgentShadow, then we present the procedure of message storage and transfer by using the AgentProxy. It has been realized in a MSA system based on Java.

  6. A mobile multi-agent information system for ubiquitous fetal monitoring.

    Science.gov (United States)

    Su, Chuan-Jun; Chu, Ta-Wei

    2014-01-02

    Electronic fetal monitoring (EFM) systems integrate many previously separate clinical activities related to fetal monitoring. Promoting the use of ubiquitous fetal monitoring services with real time status assessments requires a robust information platform equipped with an automatic diagnosis engine. This paper presents the design and development of a mobile multi-agent platform-based open information systems (IMAIS) with an automated diagnosis engine to support intensive and distributed ubiquitous fetal monitoring. The automatic diagnosis engine that we developed is capable of analyzing data in both traditional paper-based and digital formats. Issues related to interoperability, scalability, and openness in heterogeneous e-health environments are addressed through the adoption of a FIPA2000 standard compliant agent development platform-the Java Agent Development Environment (JADE). Integrating the IMAIS with light-weight, portable fetal monitor devices allows for continuous long-term monitoring without interfering with a patient's everyday activities and without restricting her mobility. The system architecture can be also applied to vast monitoring scenarios such as elder care and vital sign monitoring.

  7. 15 CFR 742.15 - Encryption items.

    Science.gov (United States)

    2010-01-01

    ... 15 Commerce and Foreign Trade 2 2010-01-01 2010-01-01 false Encryption items. 742.15 Section 742... BASED CONTROLS § 742.15 Encryption items. Encryption items can be used to maintain the secrecy of... export and reexport of encryption items. As the President indicated in Executive Order 13026 and in his...

  8. 47 CFR 90.553 - Encryption.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 5 2010-10-01 2010-10-01 false Encryption. 90.553 Section 90.553...-805 MHz Bands § 90.553 Encryption. (a) Encryption is permitted on all but the two nationwide Interoperability calling channels. Radios employing encryption must have a readily accessible switch or other...

  9. Improve information retrieval and e-learning using mobile agent based on semantic web technology

    Directory of Open Access Journals (Sweden)

    Maged Elazony

    2015-07-01

    Full Text Available The Web-based education and E-Learning has become a very important branch of new educational technology. E-learning and Web-based courses offer advantages for learners by making access to resources and learning objects very fast, just-in-time and relevance, at any time or place. Web based Learning Management Systems should focus on how to satisfy the e-learners needs and it may advise a learner with most suitable resources and learning objects. But Because of many limitations using web 2.0 for creating E-learning management system, now-a-days we use Web 3.0 which is known as Semantic web. It is a platform to represent E-learning management system that recovers the limitations of Web 2.0.In this paper we present “improve information retrieval and e-learning using mobile agent based on semantic web technology”. This paper focuses on design and implementation of knowledge-based industrial reusable, interactive, web-based training activities at the sea ports and logistics sector and use e-learning system and semantic web to deliver the learning objects to learners in an interactive, adaptive and flexible manner. We use semantic web and mobile agent to improve Library and courses Search. The architecture presented in this paper is considered an adaptation model that converts from syntactic search to semantic search. We apply the training at Damietta port in Egypt as a real-world case study. we present one of possible applications of mobile agent technology based on semantic web to management of Web Services, this model improve the information retrieval and E-learning system.

  10. Research of Network Security Situational Assessment Quantization Based on Mobile Agent

    Science.gov (United States)

    Xiaorong, Cheng; Su, Lang; Mingxuan, Li

    As the security situational assessment widely applying to the computer network field, scholars have designed and implemented a large number of network security situational assessment methods. However, most works are based on local area network and single host, which is hardly to meet the demand of large-scale network security assessment. In this paper, we based on quantitative hierarchical network security situational assessment model, introduced the mobile agent technology, designed the distributed computing for large-scale network and evaluated the whole network security situation for future prediction.

  11. A Schelling model with switching agents: decreasing segregation via random allocation and social mobility

    Science.gov (United States)

    Hazan, Aurélien; Randon-Furling, Julien

    2013-10-01

    We study the behaviour of a Schelling-class system in which a fraction f of spatially-fixed switching agents is introduced. This new model allows for multiple interpretations, including: (i) random, non-preferential allocation (e.g. by housing associations) of given, fixed sites in an open residential system, and (ii) superimposition of social and spatial mobility in a closed residential system. We find that the presence of switching agents in a segregative Schelling-type dynamics can lead to the emergence of intermediate patterns (e.g. mixture of patches, fuzzy interfaces) as the ones described in [E. Hatna, I. Benenson, J. Artif. Soc. Social. Simul. 15, 6 (2012)]. We also investigate different transitions between segregated and mixed phases both at f = 0 and along lines of increasing f, where the nature of the transition changes.

  12. AN AGENT BASED APPROACH TO AVOID SELFISH NODE DYNAMICALLY IN MOBILE NETWORKS

    Directory of Open Access Journals (Sweden)

    Radhika Garg

    2012-09-01

    Full Text Available Mobile Networks is one of the busy networks on which lotof data is transferred at very high speed. Security andefficiency are the main challenges for such open network.One of the common attacks on such network is themisbehavior of a node as a Selfish Node. A selfish nodeitself utilizes the communication medium and will not helpin forwarding the packet. The proposed work is the agentbased analysis of network. For this work, an Agent is setupwhich will perform the analysis while communicating overthe network. The agent will observe the averagecommunication of each node and based on analysis, adynamic fuzzy rule will be decided. Now each nodetransmission will be checked on this fuzzy rule. A specificrule will be decided to identify the selfish node. The workis about to decide the compromising node that will replacethe selfish node to improve the throughput over thenetwork.

  13. An Active Networks Architecture Based on Mobile Agent%一种基于移动Agent的主动网络体系结构

    Institute of Scientific and Technical Information of China (English)

    张君雁; 闵帆; 杨国纬

    2003-01-01

    This paper proposes an active networks architecture which supports both integrated and discrete operationmodel based on mobile Agent technology. Mobile Agent is the component for customized function transferring, activenode provides software application layer, and Agent server processes mobile Agent specific customization. For devel-opment and deployment of specific application protocol, this paper also proposes an abstract protocol framework and aprotocol loading mechanism to enhance network performance.

  14. Mobile Banking Short Message BCH - NAF - RSA Fast Compilation and Encryption and Security Implementation%手机银行短信息的BCH-NAF-RSA快速编译与加密及其安全实现

    Institute of Scientific and Technical Information of China (English)

    邓从政

    2015-01-01

    The rapid spread of the mobile communication technology promotes the communication operators continue to develop new value-added business such as mobile phone banking to increase profits. These operations are often completed by fast compiled code through the short message center. This paper improved traditional binary multiplication algorithm, and presents an optimized low storage NAF point compression multiplication algorithm. It greatly reduces the running time of point multiplication operation, and saves storage space. Here introduces an optimization of BCH iterative decoding algorithm for the design and realization of mobile phone short message paging decoder. The error rate of this decoder algorithm is small. That can greatly enhance the error correcting ability, and improve the quality of short message sending. Through twice compilation of NAF and BCH, it can use conic curve cryptography to encrypt fastly. The velocity of mobile phone SMS paging signal outgoing and incoming will get greatly improved. It can make sure the safety of mobile phone short message bank business transactions and implementation speed.%智能手机的快速普及推动着通信运营商不断开发新的诸如手机银行类的增值业务以增长利润, 这些业务往往通过短信中心来完成. 为了安全快速的实现这些业务, 这里改进了信号发射台短信息的编译码算法, 引入一种优化的 BCH 迭代译码算法, 来设计和实现手机短信寻呼台译码器, 这种译码算法错码率较小, 能大大增强纠错能力, 提高了短信的发送质量. 同时对短信息的加密和解密算法进行了优化, 提出了一种优化的低存储NAF点压缩数乘算法, 大大地缩短了点乘运算的运行时间, 节约了存储空间, 经过 NAF 和 BCH 快速编译后, 利用安全性较高的基于圆锥曲线的 RSA 公钥密码来进行加密, 以提高手机短信寻呼台信号呼出和呼入的速度及其安全性, 保证了手机银行短

  15. Design of a Mobile Agent-Based Adaptive Communication Middleware for Federations of Critical Infrastructure Simulations

    Science.gov (United States)

    Görbil, Gökçe; Gelenbe, Erol

    The simulation of critical infrastructures (CI) can involve the use of diverse domain specific simulators that run on geographically distant sites. These diverse simulators must then be coordinated to run concurrently in order to evaluate the performance of critical infrastructures which influence each other, especially in emergency or resource-critical situations. We therefore describe the design of an adaptive communication middleware that provides reliable and real-time one-to-one and group communications for federations of CI simulators over a wide-area network (WAN). The proposed middleware is composed of mobile agent-based peer-to-peer (P2P) overlays, called virtual networks (VNets), to enable resilient, adaptive and real-time communications over unreliable and dynamic physical networks (PNets). The autonomous software agents comprising the communication middleware monitor their performance and the underlying PNet, and dynamically adapt the P2P overlay and migrate over the PNet in order to optimize communications according to the requirements of the federation and the current conditions of the PNet. Reliable communications is provided via redundancy within the communication middleware and intelligent migration of agents over the PNet. The proposed middleware integrates security methods in order to protect the communication infrastructure against attacks and provide privacy and anonymity to the participants of the federation. Experiments with an initial version of the communication middleware over a real-life networking testbed show that promising improvements can be obtained for unicast and group communications via the agent migration capability of our middleware.

  16. Device Data Protection in Mobile Healthcare Applications

    Science.gov (United States)

    Weerasinghe, Dasun; Rajarajan, Muttukrishnan; Rakocevic, Veselin

    The rapid growth in mobile technology makes the delivery of healthcare data and services on mobile phones a reality. However, the healthcare data is very sensitive and has to be protected against unauthorized access. While most of the development work on security of mobile healthcare today focuses on the data encryption and secure authentication in remote servers, protection of data on the mobile device itself has gained very little attention. This paper analyses the requirements and the architecture for a secure mobile capsule, specially designed to protect the data that is already on the device. The capsule is a downloadable software agent with additional functionalities to enable secure external communication with healthcare service providers, network operators and other relevant communication parties.

  17. Homomorphic Encryption Schemes and Applications for a Secure Digital World

    Directory of Open Access Journals (Sweden)

    Diana Stefania Maimut

    2013-01-01

    Full Text Available As stated by NIST in "Guidelines on Security and Privacy in Public Cloud Computing", lowering costs for computing resources made Cloud Computing attractive for different organizations and users. Modern software applications that run on desktops, Cloud or mobile device ecosystems are exposed to many security threats. For instance, there are security issues that affect the processing of confidential data in the Cloud because the providers of Cloud services have full access to the hardware, storage, software and as a result, to confidential data. Furthermore malicious software can be ran in the Cloud or and attack other Cloud services to retrieve confidential information. Mainly the mobile device ecosystem is vulnerable because the digital assets and confidential data they contain represent an attractive target for the attackers. Assuming fully homomorphic encryption schemes, which allow computing any function over encrypted data, will become fast enough to be considered practical, privacy concerns with respect to desktop, Cloud or mobile services could be solved.

  18. Image Encryption Using a Lightweight Stream Encryption Algorithm

    Directory of Open Access Journals (Sweden)

    Saeed Bahrami

    2012-01-01

    Full Text Available Security of the multimedia data including image and video is one of the basic requirements for the telecommunications and computer networks. In this paper, we consider a simple and lightweight stream encryption algorithm for image encryption, and a series of tests are performed to confirm suitability of the described encryption algorithm. These tests include visual test, histogram analysis, information entropy, encryption quality, correlation analysis, differential analysis, and performance analysis. Based on this analysis, it can be concluded that the present algorithm in comparison to A5/1 and W7 stream ciphers has the same security level, is better in terms of the speed of performance, and is used for real-time applications.

  19. Agent based Bandwidth Reservation Routing Technique in Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Vishnu Kumar Sharma,

    2011-12-01

    Full Text Available In mobile ad hoc networks (MANETs, inefficient resource allocation causes heavy losses to the service providers and results in inadequate user proficiency. For improving and automating the quality of service of MANETs, efficient resource allocation techniques are required. In this paper, we propose an agent based bandwidth reservation technique for MANET. The mobile agent from the source starts forwarding the data packets through the path which has minimum cost, congestion and bandwidth. The status of every node is collected which includes the bottleneck bandwidth field and the intermediate node computes the available bandwidth on the link. At the destination, after updating the new bottleneck bandwidth field, the data packet is feedback to the source. In resource reservation technique, if the available bandwidth is greater than bottleneck bandwidth, then bandwidth reservation for the flow is done. Using rate monitoring and adjustment methodologies, rate control is performed for the congested flows. By simulation results, we show that the resource allocation technique reduces the losses and improves the network performance.

  20. Application of sustainable foaming agents to control the mobility of carbon dioxide in enhanced oil recovery

    Directory of Open Access Journals (Sweden)

    Roozbeh Rafati

    2012-12-01

    Full Text Available Carbon dioxide (CO2 flooding is a conventional process in which the CO2 is injected into the oil reservoir to increase the quantity of extracting oil. This process also controls the amount of released CO2 as a greenhouse gas in the atmosphere which is known as CO2 sequestration process. However, the mobility of the CO2 inside the hydrocarbon reservoir is higher than the crude oil and always viscous fingering and gravity override problems occur during a CO2 injection. The most common method to overcome these problems is to trap the gas bubbles in the liquid phase in the form of aqueous foam prior to CO2 injection. Although, the aqueous foams are not thermodynamically stable, special care should be considered to ensure bulk foam preparation and stability. Selection of a proper foaming agent from a large number of available surfactants is the main step in the bulk foam preparation. To meet this purpose, many chemical and crude oil based surfactants have been reported but most of them are not sustainable and have disposal problems. The objective of this experimental study is to employ Lignosulfonate and Alkyl Polyglucosides (APGs as two sustainable foaming agents for the bulk foam stability investigations and foam flooding performance in porous media. In the initial part, the bulk foam stability results showed that APGs provided more stable foams in comparison with Lignosulfonate in all surfactant concentrations. In the second part, the results indicated that the bulk foam stability measurements provide a good indication of foam mobility in porous media. The foaming agent’s concentration which provided the maximum foam stability also gave the highest value of mobility reduction in porous media.

  1. Distributed Resource Exploitation for Autonomous Mobile Sensor Agents in Dynamic Environments

    Science.gov (United States)

    Doumit, Sarjoun; Minai, Ali

    This paper studies the distributed resource exploitation problem (DREP) where many resources are distributed across an unknown environment, and several agents move around in it with the goal to exploit/visit the resources. A resource may be anything that can be harvested/sensed/acted upon by an agent when the agent visits that resource's physical location. A sensory agent (SA) is a mobile and autonomous sensory entity that has the capability of sensing a resource's attribute and therefore determining the exploitatory gain factor or profitability when this resource is visited. This type of problem can be seen as a combination of two well-known problems: the Dynamic Traveling Salesman Problem (DTSP) [8] and the Vehicle Routing Problem (VRP) [1]. But the DREP differs significantly from these two. In the DTSP we have a single agent that needs to visit many fixed cities that have costs associated to their pairwise links, so it is an optimization of paths on a static graph with time-varying costs. In VRP on the other hand, we have a number of vehicles with uniform capacity, a common depot, and several stationary customers scattered around an environment, so the goal is to find the set of routes with overall minimum route cost to service all the customers. In our problem, we have multiple SAs deployed in an unknown environment with multiple dynamic resources each with a dynamically varying value. The goal of the SAs is to adapt their paths collaboratively to the dynamics of the resources in order to maximize the general profitability of the system.

  2. 基于Mobile Agent聚类挖掘算法研究%Study on Data Mining Clustering Algorithm Based on Mobile Agent

    Institute of Scientific and Technical Information of China (English)

    魏爽

    2014-01-01

    Mobile Agent技术是随着网络应用的日益深入而发展起来的一项新兴技术。Mobile Agent技术的智能性和移动性,不仅降低了网络负载,而且提高了通信效率;此外,其支持异步自主交互、支持断连操作,具有安全性、并行性,具有学习、容错、智能化路由能力等优点,使得Mobile Agent技术在复杂的分布式问题求解方面表现出非凡的优势,因此,将Mobile Agent技术应用于数据挖掘系统中,具有很好的研究及应用前景。%Mobile Agent technology is a entity which can autonomously move from one host to another in a heterogeneous net⁃work and communicate with other Agent and resources. The intelligence and mobility of Mobile Agent technology not only re⁃duce the network load, but improve communication efficiency. Supporting asynchronous autonomous interaction, breakpoint op⁃eration and concurrent calculation and being secure and capable of learning, fault-tolerance and intelligent routing, Mobile Agent, applied to distributed Web data mining system, technology has a great research and application prospect.

  3. Quantum computing on encrypted data.

    Science.gov (United States)

    Fisher, K A G; Broadbent, A; Shalm, L K; Yan, Z; Lavoie, J; Prevedel, R; Jennewein, T; Resch, K J

    2014-01-01

    The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here, we present an efficient solution to the quantum analogue of this problem that enables arbitrary quantum computations to be carried out on encrypted quantum data. We prove that an untrusted server can implement a universal set of quantum gates on encrypted quantum bits (qubits) without learning any information about the inputs, while the client, knowing the decryption key, can easily decrypt the results of the computation. We experimentally demonstrate, using single photons and linear optics, the encryption and decryption scheme on a set of gates sufficient for arbitrary quantum computations. As our protocol requires few extra resources compared with other schemes it can be easily incorporated into the design of future quantum servers. These results will play a key role in enabling the development of secure distributed quantum systems.

  4. The Lure of Wireless Encryption

    CERN Multimedia

    Computer Security Team

    2013-01-01

    Following our article entitled “Jekyll or Hyde? Better browse securely” in the last issue of the Bulletin, some people wondered why the CERN wireless network is not encrypted…   There are many arguments why it is not. The simplest is usability: the communication and management of the corresponding access keys would be challenging given the sheer number of wireless devices the CERN network hosts. Keys would quickly become public, e.g. at conferences, and might be shared, written on whiteboards, etc. Then there are all the devices which cannot be easily configured to use encryption protocols - a fact which would create plenty of calls to the CERN Service Desk… But our main argument is that wireless encryption is DECEPTIVE. Wireless encryption is deceptive as it only protects the wireless network against unauthorised access (and the CERN network already has other means to protect against that). Wireless encryption however, does not really help you. You ...

  5. Quantum computing on encrypted data

    Science.gov (United States)

    Fisher, K. A. G.; Broadbent, A.; Shalm, L. K.; Yan, Z.; Lavoie, J.; Prevedel, R.; Jennewein, T.; Resch, K. J.

    2014-01-01

    The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here, we present an efficient solution to the quantum analogue of this problem that enables arbitrary quantum computations to be carried out on encrypted quantum data. We prove that an untrusted server can implement a universal set of quantum gates on encrypted quantum bits (qubits) without learning any information about the inputs, while the client, knowing the decryption key, can easily decrypt the results of the computation. We experimentally demonstrate, using single photons and linear optics, the encryption and decryption scheme on a set of gates sufficient for arbitrary quantum computations. As our protocol requires few extra resources compared with other schemes it can be easily incorporated into the design of future quantum servers. These results will play a key role in enabling the development of secure distributed quantum systems.

  6. Stream Deniable-Encryption Algorithms

    Directory of Open Access Journals (Sweden)

    N.A. Moldovyan

    2016-04-01

    Full Text Available A method for stream deniable encryption of secret message is proposed, which is computationally indistinguishable from the probabilistic encryption of some fake message. The method uses generation of two key streams with some secure block cipher. One of the key streams is generated depending on the secret key and the other one is generated depending on the fake key. The key streams are mixed with the secret and fake data streams so that the output ciphertext looks like the ciphertext produced by some probabilistic encryption algorithm applied to the fake message, while using the fake key. When the receiver or/and sender of the ciphertext are coerced to open the encryption key and the source message, they open the fake key and the fake message. To disclose their lie the coercer should demonstrate possibility of the alternative decryption of the ciphertext, however this is a computationally hard problem.

  7. Mobile Agent的迁移与定位机制%On Principles of Migration and Location of Mobile Agent

    Institute of Scientific and Technical Information of China (English)

    朱传宇; 周键; 袁兆山; 孔磊

    2001-01-01

    本文首先介绍了Agent的基本概念、模型,以及Mobile Agent的概念、技术特点与应用领域,主要论述了Mobile Agent的迁移方式,Mobile Agent的定位机制以及其存在的问题.

  8. Investigation of oil recovery improvement by coupling an interfacial tension agent and a mobility control agent in light oil reservoirs. Annual report, October 1992--September 1993

    Energy Technology Data Exchange (ETDEWEB)

    Pitts, M.J.

    1994-06-01

    Investigation of Oil Recovery Improvement by Coupling and Interfacial Tension Agent and a Mobility Control Agent in Light Oil Reservoirs will study two major areas concerning co-injecting an interfacial tension reduction agent(s) and a mobility control agent. The first area defines the interactions of alkaline agent, surfactants, and polymers on a fluid-fluid and fluid-rock basis. The second area concerns the economic improvement of the combined technology. This report examines the interactions of different alkaline agents, surfactants, and polymer combinations on a fluid-fluid basis. Alkali and surfactant combine to reduce the interfacial tension between a low acid number, 42 API gravity crude oil and the aqueous solution to values lower than either agent alone. Surfactant structure can vary from linear chain sulfonates to alkyl aryl sulfonates to produce low interfacial tension values when combined with alkali. However as a class, the alkyl aryl sulfonates were the most effective surfactants. Surfactant olefinic character appears to be critical in developing low interfacial tensions. For the 42 API gravity crude oil, surfactants with molecular weights ranging from 370 to 450 amu are more effective in lowering interfacial tension. Ultra low interfacial tensions were achieved with all of the alkaline agents evaluated when combined with appropriate surfactants. Different interfacial tension reduction characteristics with the various alkali types indicates alkali interacts synergistically with the surfactants to develop interfacial tension reduction. The solution pH is not a determining factor in lowering interfacial tension. Surfactant is the dominant agent for interfacial tension reduction.

  9. Stegano-Crypto Hiding Encrypted Data in Encrypted Image Using Advanced Encryption Standard and Lossy Algorithm

    Directory of Open Access Journals (Sweden)

    Ari Shawakat Tahir

    2015-12-01

    Full Text Available The Steganography is an art and science of hiding information by embedding messages within other, seemingly harmless messages and lots of researches are working in it. Proposed system is using AES Algorithm and Lossy technique to overcome the limitation of previous work and increasing the process’s speed. The sender uses AES Algorithm to encrypt message and image, then using LSB technique to hide encrypted data in encrypted message. The receive get the original data using the keys that had been used in encryption process. The proposed system has been implemented in NetBeans 7.3 software uses image and data in different size to find the system’s speed.

  10. A Method of Security Authentication for Mobile Agent%移动Agent的一种安全认证机制

    Institute of Scientific and Technical Information of China (English)

    丁建国; 白英彩; 柳惠琳; 陈涵生

    2001-01-01

    Mobile agent and its security are analyzed in this paper. Before the mobile agents are brought to actual application, enough security is meeded. A security authentication method is provided and a detail description is given in the paper. And further research about security for mobile agent is pointed out.%就移动Agent安全性进行了分析,移动Agent要真正走向实际应用的前提是能提供足够的安全性.提出并详细描述了移动Agent和代理服务器之间的一种安全认证机制,并指出进一步研究的方向和内容.

  11. 基于JavaCard的移动代理系统安全性研究%Research on Security of JavaCard based Mobile Agent System

    Institute of Scientific and Technical Information of China (English)

    陈志贤; 王绍棣; 王汝传; 孙知信

    2003-01-01

    With wide and increasing range applications of mobile agent technology, the security problem has gottenmore 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.

  12. Research on cultural algorithm for solving routing problem of mobile agent

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    The key idea behind cultural algorithm is to explicitly acquire problem-solving knowledge from the evolving population and in return apply that knowledge to guide the search. In this article, cultural algorithm-simulated annealing is proposed to solve the routing problem of mobile agent. The optimal individual is accepted to improve the belief space's evolution of cultural algorithms by simulated annealing. The step size in search is used as situational knowledge to guide the search of optimal solution in the population space. Because of this feature, the search time is reduced. Experimental results show that the algorithm proposed in this article can ensure the quality of optimal solutions, and also has better convergence speed. The operation efficiency of the system is considerably improved.

  13. INTELLIGENT PRODUCT BASED ON MOBILE AGENT TO ACCELERATE THE NEW PRODUCT DEVELOPMENT PROCESS

    Directory of Open Access Journals (Sweden)

    Abdelhak Boulaalam

    2013-01-01

    Full Text Available To improve the ever-increasing demands products that are customized, all business activities performed along the product life cycle must be coordinated and efficiently managed along the extended enterprise. For this, enterprise had wanted to retain control over the whole product lifecycle especially when the product is in use/repair/recycling (End of Life phase. Although there have been many previous research works about product lifecycle management in the Beginning of Life (BOL and Middle of Life (MOL phases, few addressed the End of Life (EOL phase, in particular. In this study, based on Auto-ID combined with mobile multi-agent system technologies, we will try to improve innovation: (a by minimize the lunch phase, (b and the involvement of the customer in product lifecycle (voice of customer."

  14. Research of Anti-spam System Basing on Immunity System and Mobile Agent

    Institute of Scientific and Technical Information of China (English)

    HUI Bei; WU Yue; JI Lin; CHEN Jia

    2007-01-01

    The human immune system has the function of self-discern.It can identify the non-self antigen and clear it through the immune response automatically.So,human body has the power of resisting disease.The anti-spam system basing on immune system is proposed by using immune system's theory,and it is introduced in the mail service of enterprise VPN.Regard VPN as the human body,the mobile agent is simulated the antibody because of its movable and intelligent,and the spam is simulated the antigen.It can clear the spam by using immune mechanism.This method is a new thinking of anti-spam mail.The advantage is overcoming the weakness on independence of traditional anti-spam system.

  15. FOREST GUARD: A complete safety for Wildlife using Mobile Agents and Sensor Clouds in WSN

    Directory of Open Access Journals (Sweden)

    Sumit Kumar Tetarave

    2012-11-01

    Full Text Available With growing human population and search for new habitus and unsustainable use of natural resources, over exploitation of forests and wildlife is taking place world over. This is resulting in drastic decline in the number of essential flora and fauna. We propose a complete safe guard model named Forest Guard, for saving wildlife from human as well as their own collisions. This model will not guard them directly; rather it will help in collecting vital information about their real-time condition and will alert the institutional mechanisms to take corrective initiatives. The paper mentions this indirect support in the form of wireless sensor networks (WSN. In WSN, our proposed model uses mobile agents (MAs for handling huge area communication and injecting them for different guarding issues of different species of wildlife. A novel concept of Virtual Sensor Cloud (VSC is being discussed to trace different group of endangered wild animals such as Tigers, Lions, Elephants, etc.

  16. Active defense scheme against DDoS based on mobile agent and network control in network confrontation

    Science.gov (United States)

    Luo, Rong; Li, Junshan; Ye, Xia; Wang, Rui

    2013-03-01

    In order to effective defend DDoS attacks in network confrontation, an active defense scheme against DDoS is built based on Mobile Agent and network control. A distributed collaborative active defense model is constructed by using mobile agent technology and encapsulating a variety of DDoS defense techniques. Meanwhile the network control theory is applied to establish a network confrontation's control model for DDoS to control the active defense process. It provides a new idea to solve the DDoS problem.

  17. An information potential approach for tracking and surveilling multiple moving targets using mobile sensor agents

    Science.gov (United States)

    Lu, W.; Zhang, G.; Ferrari, S.; Fierro, R.; Palunko, I.

    2011-05-01

    The problem of surveilling moving targets using mobile sensor agents (MSAs) is applicable to a variety of fields, including environmental monitoring, security, and manufacturing. Several authors have shown that the performance of a mobile sensor can be greatly improved by planning its motion and control strategies based on its sensing objectives. This paper presents an information potential approach for computing the MSAs' motion plans and control inputs based on the feedback from a modified particle filter used for tracking moving targets. The modified particle filter, as presented in this paper implements a new sampling method (based on supporting intervals of density functions), which accounts for the latest sensor measurements and adapts, accordingly, a mixture representation of the probability density functions (PDFs) for the target motion. It is assumed that the target motion can be modeled as a semi-Markov jump process, and that the PDFs of the Markov parameters can be updated based on real-time sensor measurements by a centralized processing unit or MSAs supervisor. Subsequently, the MSAs supervisor computes an information potential function that is communicated to the sensors, and used to determine their individual feedback control inputs, such that sensors with bounded field-of-view (FOV) can follow and surveil the target over time.

  18. HH-MIP: An Enhancement of Mobile IP by Home Agent Handover

    Directory of Open Access Journals (Sweden)

    Jeng-Yueng Chen

    2010-01-01

    Full Text Available We propose an enhancement of Mobile IP (MIP called MIP with Home Agent Handover (HH-MIP to enjoy most of the advantages of Route Optimization MIP (ROMIP but with only a small increase of signaling overhead. In HH-MIP, the concept of Temporary HA (THA is proposed and the mobile host (MH registers the new CoA with its THA rather than its original HA. Since the THA of an MH is selected to be close to the current location of MH, HH-MIP reduces the handoff latency and shortens the signaling path of registration as well. Moreover, HH-MIP adopts an aggressive approach in selecting THA for an MH, that is, whenever an MH is moving away from its HA or previous THA, the MH triggers the handover of THA. Theoretical analysis demonstrates that the proposed scheme enjoys small handoff latency as well as routing efficiency, and the signaling cost of the proposed scheme is significantly less than that in ROMIP.

  19. Clone-Based Mobile Agent Itinerary Planning Using Separate Trees For Data Fusion In WSNS

    Directory of Open Access Journals (Sweden)

    Soheil Javadi

    2012-09-01

    Full Text Available Recent studies demonstrate that Mobile Agent (MA approach could be more effective than conventional client-server model in Wireless Sensor Network (WSN. Particularly, itinerary planning for MAs is a significant aspect of these approaches. Tree-based methods have been widely used for this purpose where many agents are dispatched simultaneously. Most of tree-based methods try to construct an optimal/suboptimal tree in terms of an objective function. In contrast, in this paper we introduce a new approach that tries to separate the MA dispatching and data fusion operations by considering two itinerary trees which results in more flexibility to regulate the itinerary plan. Based on this idea, we propose an algorithm called Two Trees Clone-based Itinerary (TTCI which constructs two trees, one serves to distribute MA in the network and another to fuse back the sensed data. By experimental results, we demonstrate the performance improvement of TTCI algorithm in terms of overall energy consumption in comparison with the previous schemes. Meanwhile, the TTCI keeps the delay low.

  20. Encryption and Decryption of Messages on Android using NFC Tags

    Directory of Open Access Journals (Sweden)

    Andrei Dragan

    2015-09-01

    Full Text Available Working with NFC technology and mobile devices brings a faster and more secure way of doing things like giving out contact information, automating certain tasks or transmitting data, as easy as touching the two. What this article focuses on is the use of NFC tags on the Android platform to store random generated keys and automate the encryption and decryption of messages.

  1. 基于移动Agent的移动云计算系统构建方法%Construction method of mobile cloud computing system based on mobile Agent

    Institute of Scientific and Technical Information of China (English)

    王素贞; 杜治娟

    2013-01-01

    This paper proposed a mobile cloud computing architecture based on mobile Agent paradigm concerning the problems faced by the mobile cloud computing, such as application migration on network, network latency and non-persistent connection issues caused by execution on the remote device, cross-cloud service problems, and security risks and privacy issues. In this architecture, break-point saving ideas and events replay mechanism were introduced in application migration issues, optimized contract net protocol was used in the synergy between the mobile Agents, and mobile Agent exchange keys for authentication. What's more, this paper described the workflow of this architecture using colored nested Petri nets, and designed a system of mobile e-book sales based on the architecture.%针对移动云计算面临的一系列问题,如应用程序在网络上迁移问题、远程设备上执行时的网络延迟和非持续连接问题、跨云服务问题以及安全风险和隐私问题,提出了一种基于移动Agent范型的移动云计算架构,其中,在应用程序迁移中引入断点保存思想和事件重播机制,在移动Agent协同过程中使用优化过的合同网协议,利用移动Agent交换密钥进行身份认证.用有色嵌套Petri网描述了此架构的执行流程,并在此基础上设计了移动电子图书销售系统.

  2. Encryption And Portable Data Storage

    Directory of Open Access Journals (Sweden)

    Cynthia L. Knott

    2011-04-01

    Full Text Available The protection of data is key issue in today’s world. The wide of availability and use of portable technologies such as USB flash has increased concern about securing the data resides on these devices. Because USB flash drives are small, relatively inexpensive, and easy to use, the security of the information stored on these thumb drives is on-going concern. A number of approaches to safeguarding the information stored on these drives are available. This paper examines one approach to this goal through the use of encryption. This method encrypts all the data on the drive. In addition the fact the data on the drive is encrypted is not visually obvious when viewing the contents of the disk. The proposed approach uses publically available and free encryption algorithms. A user password is needed to view and access the data that has been encrypted.  The proposed methodology is quick and easy to use. Individuals who routinely carry around their USB drives need to be able to decrypt and encrypt the device quickly and conveniently. Furthermore, if the device is lost, it is still possible with the method advocated in this paper to include information about how to return the device to the owner without compromising the secured data on the drive. Without encrypting the data on portable drives, the user risks the disclosure of information. This paper argues that portable storage should be secured and suggests a way to secure the data through password and encryption that further enhances the usability and flexibility of the USB flash drive.  The paper includes the results and analysis of an undergraduate student survey that determined what habits and practices they followed with respect to securing their personal data and files.  Some of the questions included in the analysis are the following: Do you encrypt your USB flash drive?Do you use any type of security for your USB flash drive?How important do you think security is for a flash drive? (A

  3. Testing a Variety of Encryption Technologies

    Energy Technology Data Exchange (ETDEWEB)

    Henson, T J

    2001-04-09

    Review and test speeds of various encryption technologies using Entrust Software. Multiple encryption algorithms are included in the product. Algorithms tested were IDEA, CAST, DES, and RC2. Test consisted of taking a 7.7 MB Word document file which included complex graphics and timing encryption, decryption and signing. Encryption is discussed in the GIAC Kickstart section: Information Security: The Big Picture--Part VI.

  4. A Brief Study of Video Encryption Algorithms

    Directory of Open Access Journals (Sweden)

    Pranali Pasalkar,

    2015-02-01

    Full Text Available Video is a set of images .Video encryption is encrypting those set of images .Thus video encryption is simply hiding your video from prying eyes .Video monitoring has always been in concerned .Multimedia security is very important for multimedia commerce on Internet such as video on demand and Real time video multicast. There are various video encryption algorithm. All have some kind of weakness .In this paper classification of various existing algorithm, its advantages and disadvantages is discussed.

  5. Securing Information with Complex Optical Encryption Networks

    Science.gov (United States)

    2015-08-11

    Encryption Networks 5a. CONTRACT NUMBER FA2386-13-1-4106 5b. GRANT NUMBER Grant AOARD-134106 5c. PROGRAM ELEMENT NUMBER 61102F 6. AUTHOR(S...configure complex optical encryption networks for securing information. The goal is to study/develop the architectures for a number of complex optical... encryption networks, and to provide effective and reliable solutions for information security. 15. SUBJECT TERMS Optical Encryption

  6. Selective Document Retrieval from Encrypted Database

    NARCIS (Netherlands)

    Bösch, Christoph; Tang, Qiang; Hartel, Pieter; Jonker, Willem

    2012-01-01

    We propose the concept of selective document retrieval (SDR) from an encrypted database which allows a client to store encrypted data on a third-party server and perform efficient search remotely. We propose a new SDR scheme based on the recent advances in fully homomorphic encryption schemes. The p

  7. Private predictive analysis on encrypted medical data.

    Science.gov (United States)

    Bos, Joppe W; Lauter, Kristin; Naehrig, Michael

    2014-08-01

    Increasingly, confidential medical records are being stored in data centers hosted by hospitals or large companies. As sophisticated algorithms for predictive analysis on medical data continue to be developed, it is likely that, in the future, more and more computation will be done on private patient data. While encryption provides a tool for assuring the privacy of medical information, it limits the functionality for operating on such data. Conventional encryption methods used today provide only very restricted possibilities or none at all to operate on encrypted data without decrypting it first. Homomorphic encryption provides a tool for handling such computations on encrypted data, without decrypting the data, and without even needing the decryption key. In this paper, we discuss possible application scenarios for homomorphic encryption in order to ensure privacy of sensitive medical data. We describe how to privately conduct predictive analysis tasks on encrypted data using homomorphic encryption. As a proof of concept, we present a working implementation of a prediction service running in the cloud (hosted on Microsoft's Windows Azure), which takes as input private encrypted health data, and returns the probability for suffering cardiovascular disease in encrypted form. Since the cloud service uses homomorphic encryption, it makes this prediction while handling only encrypted data, learning nothing about the submitted confidential medical data.

  8. Adaptively Secure Computationally Efficient Searchable Symmetric Encryption

    NARCIS (Netherlands)

    Sedghi, S.; Liesdonk, van P.; Doumen, J.M.; Hartel, P.H.; Jonker, W.

    2009-01-01

    Searchable encryption is a technique that allows a client to store documents on a server in encrypted form. Stored documents can be retrieved selectively while revealing as little information as possible to the server. In the symmetric searchable encryption domain, the storage and the retrieval are

  9. Conjunctive Wildcard Search over Encrypted Data

    NARCIS (Netherlands)

    Bösch, Christoph; Brinkman, Richard; Hartel, Pieter; Jonker, Willem; Jonker, Willem; Petkovic, Milan

    2011-01-01

    Searchable encryption allows a party to search over encrypted data without decrypting it. Prior schemes in the symmetric setting deal only with exact or similar keyword matches. We describe a scheme for the problem of wildcard searches over encrypted data to make search queries more flexible, provid

  10. A survey of provably secure searchable encryption

    NARCIS (Netherlands)

    Bösch, Christoph; Hartel, Pieter; Jonker, Willem; Peter, Andreas

    2014-01-01

    We survey the notion of provably secure Searchable Encryption (SE) by giving a complete and comprehensive overview of the two main SE techniques: Searchable Symmetric Encryption (SSE) and Public Key Encryption with Keyword Search (PEKS). Since the pioneering work of Song, Wagner and Perrig (IEEE S&P

  11. Towards provably secure efficiently searchable encryption

    NARCIS (Netherlands)

    Sedghi, Saeed

    2012-01-01

    Traditional encryption systems are designed in such a way that either the whole data is decrypted, if the encryption and decryption keys match, or nothing is decrypted otherwise. However, there are applications that require a more flexible encryption system which supports decrypting data partially.

  12. Towards Provably Secure Efficiently Searchable Encryption

    NARCIS (Netherlands)

    Sedghi, S.

    2012-01-01

    Traditional encryption systems are designed in such a way that either the whole data is decrypted, if the encryption and decryption keys match, or nothing is decrypted otherwise. However, there are applications that require a more flexible encryption system which supports decrypting data partially.

  13. Selective Document Retrieval from Encrypted Database

    NARCIS (Netherlands)

    Bösch, C.T.; Tang, Qiang; Hartel, Pieter H.; Jonker, Willem

    We propose the concept of selective document retrieval (SDR) from an encrypted database which allows a client to store encrypted data on a third-party server and perform efficient search remotely. We propose a new SDR scheme based on the recent advances in fully homomorphic encryption schemes. The

  14. Dual Watermarking Scheme with Encryption

    CERN Document Server

    Dhanalakshmi, R

    2010-01-01

    Digital Watermarking is used for copyright protection and authentication. In the proposed system, a Dual Watermarking Scheme based on DWT SVD with chaos encryption algorithm, will be developed to improve the robustness and protection along with security. DWT and SVD have been used as a mathematical tool to embed watermark in the image. Two watermarks are embedded in the host image. The secondary is embedded into primary watermark and the resultant watermarked image is encrypted using chaos based logistic map. This provides an efficient and secure way for image encryption and transmission. The watermarked image is decrypted and a reliable watermark extraction scheme is developed for the extraction of the primary as well as secondary watermark from the distorted image.

  15. Research on asymmetric searchable encryption

    Science.gov (United States)

    Yu, Zonghua; Wu, Yudong

    2017-05-01

    Cloud server side to ease the user's local storage pressure at the same time, there are hidden data on the hidden dangers, the user often choose to upload the data in the form of cipher text to the cloud server. However, the classic data encryption and decryption algorithms are not provided search function, affecting the user's efficiency. To this end, an asymmetric searchable encryption scheme is proposed. The scheme can be used for any person can generate a trapdoor, cipher text can be free modified, the key pair generated by the user themselves, encrypt the identity, S-shaped virtual and other five loopholes to improve. The analysis results show that the scheme solves the above five vulnerabilities in the original scheme, so that the information semantics of both parties of communication can be guaranteed.

  16. 在移动计算环境中基于移动代理的缓存失效方案%A Cache Invalidation Scheme Based on Mobile Agent in Mobile Computing Environments

    Institute of Scientific and Technical Information of China (English)

    吴劲; 卢显良; 任立勇

    2003-01-01

    Caching can reduce the bandwidth requirement in a mobile computing environment as well as minimize the energy consumption of mobile hosts. To affirm the validity of mobile host' cache content, servers periodically broadcast cache invalidation reports that contain information of data that has been updated. However, as mobile hosts may operate in sleeping mode (disconnected mode), it is possible that some reports may be missed and the clients are forced to discard the entire cache content. In this paper, we present a cache invalidation scheme base on mobile agent in mobile computing environments, which can manage consistency between mobile hosts and servers, to avoid losing cache invalidation reports.

  17. Multichanneled puzzle-like encryption

    Science.gov (United States)

    Amaya, Dafne; Tebaldi, Myrian; Torroba, Roberto; Bolognini, Néstor

    2008-07-01

    In order to increase data security transmission we propose a multichanneled puzzle-like encryption method. The basic principle relies on the input information decomposition, in the same way as the pieces of a puzzle. Each decomposed part of the input object is encrypted separately in a 4 f double random phase mask architecture, by setting the optical parameters in a determined status. Each parameter set defines a channel. In order to retrieve the whole information it is necessary to properly decrypt and compose all channels. Computer simulations that confirm our proposal are presented.

  18. Benaloh's Dense Probabilistic Encryption Revisited

    CERN Document Server

    Fousse, Laurent; Alnuaimi, Mohamed

    2010-01-01

    In 1994, Josh Benaloh proposed a probabilistic homomorphic encryption scheme, enhancing the poor expansion factor provided by Goldwasser and Micali's scheme. Since then, numerous papers have taken advantage of Benaloh's homomorphic encryption function, including voting schemes, non-interactive verifiable secret sharing, online poker... In this paper we show that the original description of the scheme is incorrect, possibly resulting in ambiguous decryption of ciphertexts. We give a corrected description of the scheme, provide a complete proof of correctness and an analysis of the probability of failure in the initial description.

  19. A Method of Homomorphic Encryption

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    The existing homomorphic encryption scheme is based on ring of the integer, and the possible operators are restricted to addition and multiplication only. In this paper, a new operation is defined--Similar Modul. Base on the Similar Modul, the number sets of the homomorphic encryption scheme is extended to real number, and the possible operators are extended to addition, subtraction, multiplication and division. Our new approach provides a practical ways of implementation because of the extension of the operators and the number sets.

  20. Enhancement of utilization of encryption engine

    Energy Technology Data Exchange (ETDEWEB)

    Robertson, Robert J. (Albuquerque, NM); Witzke, Edward L. (Edgewood, NM)

    2008-04-22

    A method of enhancing throughput of a pipelined encryption/decryption engine for an encryption/decryption process has a predetermined number of stages and provides feedback around the stages (and of such an encryption/decryption engine) by receiving a source datablock for a given stage and encryption/decryption context identifier; indexing according to the encryption/decryption context identifier into a bank of initial variables to retrieve an initial variable for the source datablock; and generating an output datablock from the source datablock and its corresponding initial variable.

  1. Enhancement of utilization of encryption engine

    Science.gov (United States)

    Robertson, Robert J.; Witzke, Edward L.

    2008-04-22

    A method of enhancing throughput of a pipelined encryption/decryption engine for an encryption/decryption process has a predetermined number of stages and provides feedback around the stages (and of such an encryption/decryption engine) by receiving a source datablock for a given stage and encryption/decryption context identifier; indexing according to the encryption/decryption context identifier into a bank of initial variables to retrieve an initial variable for the source datablock; and generating an output datablock from the source datablock and its corresponding initial variable.

  2. Digital image encryption with chaotic map lattices

    Institute of Scientific and Technical Information of China (English)

    Sun Fu-Yan; Lü Zong-Wang

    2011-01-01

    This paper proposes a secure approach for encryption and decryption of digital images with chaotic map lattices.In the proposed encryption process, eight different types of operations are used to encrypt the pixels of an image and one of them will be used for particular pixels decided by the outcome of the chaotic map lattices. To make the cipher more robust against any attacks, the secret key is modified after encrypting each block of sixteen pixels of the image.The experimental results and security analysis show that the proposed image encryption scheme achieves high security and efficiency.

  3. Holographic memories with encryption-selectable function

    Science.gov (United States)

    Su, Wei-Chia; Lee, Xuan-Hao

    2006-03-01

    Volume holographic storage has received increasing attention owing to its potential high storage capacity and access rate. In the meanwhile, encrypted holographic memory using random phase encoding technique is attractive for an optical community due to growing demand for protection of information. In this paper, encryption-selectable holographic storage algorithms in LiNbO 3 using angular multiplexing are proposed and demonstrated. Encryption-selectable holographic memory is an advance concept of security storage for content protection. It offers more flexibility to encrypt the data or not optionally during the recording processes. In our system design, the function of encryption and non-encryption storage is switched by a random phase pattern and a uniform phase pattern. Based on a 90-degree geometry, the input patterns including the encryption and non-encryption storage are stored via angular multiplexing with reference plane waves at different incident angles. Image is encrypted optionally by sliding the ground glass into one of the recording waves or removing it away in each exposure. The ground glass is a key for encryption. Besides, it is also an important key available for authorized user to decrypt the encrypted information.

  4. Identity-based Broadcast Encryption with Shorter Transmissions

    Institute of Scientific and Technical Information of China (English)

    ZHANG Le-you; HU Yu-pu; MU Ning-bo

    2008-01-01

    This paper describes two identity-based broadcast encryption (IBBE) schemes for mobile ad hoc networks.The first scheme proposed achieves sub-linear size cipertexts and the second scheme achieves O(1)-size ciphertexts.Furthermore,when the public keys are transmitted,the two schemes have short transmissions and achieve O(1) user storage cost,which are important for a mobile ad hoc network.Finally,the proposed schemes are provable security under the decision generalized bilinear Diffi-Hellman (GBDH) assumption in the random oracles model.

  5. Mediated Encryption: Analysis and Design

    Directory of Open Access Journals (Sweden)

    I. Elashry1

    2015-01-01

    Full Text Available Boneh, Ding and Tsudik presented identity-based mediated RSA encryption and signature systems in which the users are not allowed to decrypt/sign messages without the authorisation of a security mediator.We show that ID-MRSA is not secure and we present a secure modified version of it which is as efficient as the original system. We also propose a generic mediated encryption that translates any identity based encryption to a mediated version of this IBE. It envelops an IBE encrypted message using a user’s identity into an IBE envelope using the identity of the SEM. We present two security models based on the role of the adversary whether it is a revoked user or a hacked SEM. We prove that GME is as secure as the SEM’s IBE against a revoked user and as secure as the user’s IBE against a hacked SEM. We also present two implementations of GME based on Boneh-Franklin FullIBE system which is a pairing-based system and Boneh, Gentry and Hamburg (BGH system which is pairing-free system.

  6. A Spawn Mobile Agent Itinerary Planning Approach for Energy-Efficient Data Gathering in Wireless Sensor Networks.

    Science.gov (United States)

    Qadori, Huthiafa Q; Zulkarnain, Zuriati A; Hanapi, Zurina Mohd; Subramaniam, Shamala

    2017-06-03

    Mobile agent (MA), a part of the mobile computing paradigm, was recently proposed for data gathering in Wireless Sensor Networks (WSNs). The MA-based approach employs two algorithms: Single-agent Itinerary Planning (SIP) and Multi-mobile agent Itinerary Planning (MIP) for energy-efficient data gathering. The MIP was proposed to outperform the weakness of SIP by introducing distributed multi MAs to perform the data gathering task. Despite the advantages of MIP, finding the optimal number of distributed MAs and their itineraries are still regarded as critical issues. The existing MIP algorithms assume that the itinerary of the MA has to start and return back to the sink node. Moreover, each distributed MA has to carry the processing code (data aggregation code) to collect the sensory data and return back to the sink with the accumulated data. However, these assumptions have resulted in an increase in the number of MA's migration hops, which subsequently leads to an increase in energy and time consumption. In this paper, a spawn multi-mobile agent itinerary planning (SMIP) approach is proposed to mitigate the substantial increase in cost of energy and time used in the data gathering processes. The proposed approach is based on the agent spawning such that the main MA is able to spawn other MAs with different tasks assigned from the main MA. Extensive simulation experiments have been conducted to test the performance of the proposed approach against some selected MIP algorithms. The results show that the proposed SMIP outperforms the counterpart algorithms in terms of energy consumption and task delay (time), and improves the integrated energy-delay performance.

  7. An Agent-Based Model for the Development of Intelligent Mobile Services

    NARCIS (Netherlands)

    Koch, F.L.

    2009-01-01

    The next generation of mobile services must invisible, convenient, and useful. It requires new techniques to design and develop mobile computing applications, based on user-centred, environment-aware, adaptive behaviour. I propose an alternative technology for the development of intelligent mobile s

  8. Performance study of selective encryption in comparison to full encryption for still visual images

    Institute of Scientific and Technical Information of China (English)

    Osama A.KHASHAN; Abdullah M.ZIN; Elankovan A.SUNDARARAJAN

    2014-01-01

    Securing digital images is becoming an important concern in today’s information security due to the extensive use of secure images that are either transmitted over a network or stored on disks. Image encryption is the most effective way to fulfil confidentiality and protect the privacy of images. Nevertheless, owing to the large size and complex structure of digital images, the computational overhead and processing time needed to carry out full image encryption prove to be limiting factors that inhibit it of being used more heavily in real time. To solve this problem, many recent studies use the selective encryption approach to encrypt significant parts of images with a hope to reduce the encryption overhead. However, it is necessary to realistically evaluate its performance compared to full encryption. In this paper, we study the performance and efficiency of image segmentation methods used in the selective encryption approach, such as edges and face detection methods, in determining the most important parts of visual images. Experiments were performed to analyse the computational results obtained by selective image encryption compared to full image encryption using symmetric encryption algorithms. Experiment results have proven that the selective encryption approach based on edge and face detection can significantly reduce the time of encrypting still visual images as compared to full encryption. Thus, this approach can be considered a good alternative in the implementation of real-time applications that require adequate security levels.

  9. Mobile communication security

    NARCIS (Netherlands)

    Broek, F.M.J. van den

    2016-01-01

    Security of the mobile network Fabian van den Broek We looked at the security of the wireless connection between mobile phone and cell towers and suggested possible improvements. The security was analysed on a design level, by looking at the protocols and encryption techniques, but also on an impl

  10. Mobile communication security

    NARCIS (Netherlands)

    Broek, F.M.J. van den

    2016-01-01

    Security of the mobile network Fabian van den Broek We looked at the security of the wireless connection between mobile phone and cell towers and suggested possible improvements. The security was analysed on a design level, by looking at the protocols and encryption techniques, but also on an impl

  11. Information Retrieval Agent System Based on Mobile Agent Technology%基于Mobile Agent技术的搜索引擎IRAS

    Institute of Scientific and Technical Information of China (English)

    王命延; 孙春华; 孙恒

    2004-01-01

    介绍了基于Mobile Agent的软件技术,利用该技术设计了一个搜索引擎IRAS,描述了其设计思想、组成和工作流程.此外,通过与传统Robot搜索方式进行对比,分析了IRAS搜索引擎系统的性能优势.

  12. AN APPLICATION OF MOBILE AGENTS TO NETWORK MANAGEMENT%移动代理在网络管理中的应用

    Institute of Scientific and Technical Information of China (English)

    胥光辉; 李子全; 谢希仁; 徐永森

    2000-01-01

    Conventional network management, such as SNMP and CMIP, adopts a centralized, client-sercer modal. In this model agent has little intelligence, while manager does almost all the work. This may lead a lot of vital problems. Mobile agent is an autonomic program, which can hang up its execution, collect its runtime state messages, transfer itself and its state to another network node, and then resume its execution there. Apply mobile agent concept to network management is a novel idea, which can greatly improve the robustness and distribution of a network management system. In this paper, an actual network management architecture based on mobile agent is proposed. Nowadays there are few network devices which can support mobile agent directly, though some ones have already began to appear. In order to enable mobile agents manage a network, a workstation (maybe a PC) can be added into the network. This special machine can accept mobile agents from a remote manage station, then these mobile agents can do their work like SNMP or CMIP managers. This method is very useful when a manage station is connected with the managed network using a low, expensive, or unreliable link. Even the connection between the manage station and the managed network is lost, mobile agents can still manage the network. The structure of the added workstation can be divided into three layers. The lowest layer is operating system layer, which supply low communication services to higher layers. The middle layer includes mobile agent server and/or SNMP/CMIP server. The mobile agent server can supply three kinds of services to mobile agents: ① monitor and administer the state of mobile agents; ② migration support; ③ high communication between mobile agents. The highest layer is mobile agent layer. This layer includes some service agents. The immigrated agents can achieve their works through communicating with these service agents. Accordiag to the propossed model, a prototype system has been

  13. High Lightweight Encryption Standard (HLES as an Improvement of 512-Bit AES for Secure Multimedia

    Directory of Open Access Journals (Sweden)

    GUESMIA Seyf Eddine

    2016-01-01

    Full Text Available In today’s scenario, people share information to another people frequently using network. Due to this, more amount of information are so much private but some are less private. Therefore, the attackers or the hackers take the advantage and start attempting to steal the information since 2001. the symmetric encryption algorithm called 512-bit AES provides high level of security, but it's almost be impossible to be used in multimedia transmissions and mobile systems because of the need for more design area that effect in the use of large memory space in each round and the big encryption time that it takes. This paper presents an improvement of 512-bit AES algorithm with efficient utilization of resources such as processor and memory space. The proposed approach resists the linear and differential encrypt analysis and provides high security level using a 512-bit size of key block and data block and ameliorates the performance by minimizing the use of memory space and time encryption to be able to work in specific characteristics of resource-limited systems. The experimental results on several data (text, image, sound, video show that the used memory space is reduced to quarter, and the encryption time is reduced almost to the half. Therefore, the adopted method is very effective for encryption of multimedia data.

  14. A fractal-based image encryption system

    KAUST Repository

    Abd-El-Hafiz, S. K.

    2014-12-01

    This study introduces a novel image encryption system based on diffusion and confusion processes in which the image information is hidden inside the complex details of fractal images. A simplified encryption technique is, first, presented using a single-fractal image and statistical analysis is performed. A general encryption system utilising multiple fractal images is, then, introduced to improve the performance and increase the encryption key up to hundreds of bits. This improvement is achieved through several parameters: feedback delay, multiplexing and independent horizontal or vertical shifts. The effect of each parameter is studied separately and, then, they are combined to illustrate their influence on the encryption quality. The encryption quality is evaluated using different analysis techniques such as correlation coefficients, differential attack measures, histogram distributions, key sensitivity analysis and the National Institute of Standards and Technology (NIST) statistical test suite. The obtained results show great potential compared to other techniques.

  15. Security Assessment of Two-Wave Encryption

    Science.gov (United States)

    Kitano, Motoki; Okamoto, Atsushi; Sano, Takayuki

    2009-03-01

    To determine the degree of security in two-wave encryption under practical conditions, we present a novel numerical technique for simulating the recording and readout of two-wave encryption. The calculation results of the retrieval characteristics show that the diffraction efficiency in an incorrect decryption is 10 times as low as that in correct decryption key and that the output data with an incorrect key is a white noise image. We estimate the necessary key correlation to decrypt an encrypted data is 0.2 when the length of an encryption key is 2313. This means that the decoding probability of the encryption key in two-wave encryption is less than 10-6 even if such a short key is used.

  16. Optically-induced-potential-based image encryption.

    Science.gov (United States)

    Chen, Bing-Chu; Wang, He-Zhou

    2011-11-07

    We present a technique of nonlinear image encryption by use of virtual optics. The image to be encrypted is superposed on a random intensity image. And this superposed image propagates through a nonlinear medium and a 4-f system with single phase key. The image is encrypted to a stationary white noise. The decryption process is sensitive to the parameters of the encryption system and the phase key in 4-f system. This sensitivity makes attackers hard to access the phase key. In nonlinear medium, optically-induced potentials, which depend on intensity of optical wave, make the superposition principle frustrated. This nonlinearity based on optically induced potentials highly improves the secrecy level of image encryption. Resistance against attacks based on the phase retrieval technique proves that it has the high secrecy level. This nonlinear image encryption based on optically induced potentials is proposed and demonstrated for the first time.

  17. Ciphertext-Policy Attribute-Based Encryption and Re-Encryption

    NARCIS (Netherlands)

    Asim, Muhammad; Ibraimi, L.; Petkovic, M.

    2010-01-01

    A ciphertext-policy attribute-based encryption system, comprising a re-encrypter (9) for cryptographically transforming a first ciphertext (CTp1) associated with a first access policy (P1) into a second ciphertext (CTP2) associated with a second access policy (P2) by means of a re-encryption key (RK

  18. Ciphertext-Policy Attribute-Based Encryption and Re-Encryption

    NARCIS (Netherlands)

    Asim, Muhammad; Ibraimi, L.; Petkovic, M.

    2010-01-01

    A ciphertext-policy attribute-based encryption system, comprising a re-encrypter (9) for cryptographically transforming a first ciphertext (CTp1) associated with a first access policy (P1) into a second ciphertext (CTP2) associated with a second access policy (P2) by means of a re-encryption key

  19. Optical encryption with cascaded fractional wavelet transforms

    Institute of Scientific and Technical Information of China (English)

    BAO Liang-hua; CHEN Lin-fei; ZHAO Dao-mu

    2006-01-01

    On the basis of fractional wavelet transform, we propose a new method called cascaded fractional wavelet transform to encrypt images. It has the virtues of fractional Fourier transform and wavelet transform. Fractional orders, standard focal lengths and scaling factors are its keys. Multistage fractional Fourier transforms can add the keys easily and strengthen information security. This method can also realize partial encryption just as wavelet transform and fractional wavelet transform. Optical realization of encryption and decryption is proposed. Computer simulations confirmed its possibility.

  20. New Security Results on Encrypted Key Exchange

    OpenAIRE

    Bresson, Emmanuel; Chevassut, Olivier; Pointcheval, David

    2003-01-01

    Schemes for encrypted key exchange are designed to provide two entities communicating over a public network, and sharing a (short) password only, with a session key to be used to achieve data integrity and/or message confidentiality. An example of a very efficient and "elegant" scheme for encrypted key exchange considered for standardization by the IEEE P1363 Standard working group is AuthA. This scheme was conjectured secure when the symmetric-encryption primitive is instantiated via e...

  1. Pure optical dynamical color encryption

    Science.gov (United States)

    Mosso, Fabian; Tebaldi, Myrian; Fredy Barrera, John; Bolognini, Néstor; Torroba, Roberto

    2011-07-01

    We introduce a way to encrypt-decrypt a color dynamical phenomenon using a pure optical alternative. We split the three basic chromatic channels composing the input, and then each channel is processed through a 4f encoding method and a theta modulation applied to the each encrypted frame in every channel. All frames for a single channel are multiplexed. The same phase mask is used to encode all the information. Unlike the usual procedure we do not multiplex the three chromatic channels into a single encoding media, because we want to decrypt the information in real time. Then, we send to the decoding station the phase mask and the three packages each one containing the multiplexing of a single channel. The end user synchronizes and decodes the information contained in the separate channels. Finally, the decoding information is conveyed together to bring the decoded dynamical color phenomenon in real-time. We present material that supports our concepts.

  2. An Agent-based Model Simulation of Multiple Collaborating Mobile Ad Hoc Networks (MANET)

    Science.gov (United States)

    2011-06-01

    RESULTS: Agent Learning Profiles Discounted Positive Reinforcement Learning Learning and Forgetting Forgetting is triggered by task conditions that...disable rational and deliberate mental models –forcing the agent to ignore (or forget) routine processes. Positive reinforcement is earned by an...deliberate behavior of agents as rational entities (model-based functions). 6.Experiment with positive reinforcement learning (with incremental gain over

  3. Evaluating Predicates over Encrypted Data

    Science.gov (United States)

    2008-10-01

    4.8, 4.8.2, 5.1, 5.1, 5.3.3 [14] Ran Canetti , Shai Halevi, and Jonathan Katz. A forward-secure public-key encryption scheme. In EUROCRYPT, pages 255...271, 2003. 2.1.2, 3.1.3, 4.1.2, 5.1, 5.3.3 [15] Ran Canetti , Shai Halevi, and Jonathan Katz. Chosen-ciphertext security from identity-based

  4. Cryptanalysis of optical encryption: a heuristic approach

    Science.gov (United States)

    Gopinathan, Unnikrishnan; Monaghan, David S.; Naughton, Thomas J.; Sheridan, John T.

    2006-10-01

    The Fourier plane encryption algorithm is subjected to a heuristic known-plaintext attack. The simulated annealing algorithm is used to estimate the key using a known plaintext-ciphertext pair which decrypts the ciphertext with arbitrarily low error. The strength of the algorithm is tested by using the key to decrypt a different ciphertext encrypted using the same original key. The Fourier plane encryption algorithm is found to be susceptible to a known-plaintext heuristic attack. It is found that phase only encryption, a variation of Fourier plane encoding algorithm, successfully defends against this attack.

  5. Proposed Hyperchaotic System for Image Encryption

    Directory of Open Access Journals (Sweden)

    Asst. Prof. Dr. Alia Karim Abdul Hassan

    2016-01-01

    Full Text Available This paper presents a new hyper chaos system based on Hénon and Logistic maps which provides characteristics of high capacity, security and efficiency. The Proposed hyper chaos system is employed to generate the key for diffusion in an image encryption algorithm. The simulation experiments to the image encryption algorithm which based on the proposed hyper chaos system show that the algorithm security analysis it has large key space (10 84 that ensures a strong resistance against attack of exhaustion as the key space will be greater, strong sensitivity of encryption key and good statistical characteristics. Encryption and decryption time is suitable for different applications.

  6. Novel image encryption based on quantum walks.

    Science.gov (United States)

    Yang, Yu-Guang; Pan, Qing-Xiang; Sun, Si-Jia; Xu, Peng

    2015-01-14

    Quantum computation has achieved a tremendous success during the last decades. In this paper, we investigate the potential application of a famous quantum computation model, i.e., quantum walks (QW) in image encryption. It is found that QW can serve as an excellent key generator thanks to its inherent nonlinear chaotic dynamic behavior. Furthermore, we construct a novel QW-based image encryption algorithm. Simulations and performance comparisons show that the proposal is secure enough for image encryption and outperforms prior works. It also opens the door towards introducing quantum computation into image encryption and promotes the convergence between quantum computation and image processing.

  7. Verifiably Encrypted Signatures Without Random Oracles

    Institute of Scientific and Technical Information of China (English)

    LI Xiang-xue; CHEN Ke-fei; LIU Sheng-li; LI Shi-qun

    2006-01-01

    Verifiably encrypted signatures are employed when a signer wants to sign a message for a verifier but does not want the verifier to possess his signature on the message until some certain requirements of his are satisfied. This paper presented new verifiably encrypted signatures from bilinear pairings. The proposed signatures share the properties of simplicity and efficiency with existing verifiably encrypted signature schemes. To support the proposed scheme, it also exhibited security proofs that do not use random oracle assumption. For existential unforgeability, there exist tight security reductions from the proposed verifiably encrypted signature scheme to a strong but reasonable computational assumption.

  8. A Self-Adaptive Multi-Agent System Approach for Collaborative Mobile Learning

    Science.gov (United States)

    de la Iglesia, Didac Gil; Calderon, Juan Felipe; Weyns, Danny; Milrad, Marcelo; Nussbaum, Miguel

    2015-01-01

    Mobile technologies have emerged as facilitators in the learning process, extending traditional classroom activities. However, engineering mobile learning applications for outdoor usage poses severe challenges. The requirements of these applications are challenging, as many different aspects need to be catered, such as resource access and sharing,…

  9. Mobilities

    DEFF Research Database (Denmark)

    simple movements of people, goods, and information from A to B. The ‘mobilities turn’ has made it its hallmark to explore the ‘more than’ effects of a world increasingly on the move. This new title in the Routledge Series ‘Critical Concepts in Built Environment’ creates a state-of-the-art reference work......The world is on the move. This is a widespread understanding by many inhabitants of contemporary society across the Globe. But what does it actually mean? During over one decade the ‘mobilities turn’ within the social sciences have provided a new set of insights into the repercussions of mobilities...... to social networks, personal identities, and our relationship to the built environment. The omnipresence of mobilities within everyday life, high politics, technology, and tourism (to mention but a few) all point to a key insight harnessed by the ‘mobilities turn’. Namely that mobilities is much more than...

  10. Binary-tree encryption strategy for optical multiple-image encryption.

    Science.gov (United States)

    Yi, Jiawang; Tan, Guanzheng

    2016-07-10

    In traditional optical multiple-image encryption schemes, different images typically have almost the same encryption or decryption process. Provided that an attacker manages to correctly decrypt some image, the conventional attacks upon other images are much easier to be made. In this paper, a binary-tree encryption strategy for multiple images is proposed to resist the attacks in this case. The encryption schemes produced by this strategy can not only increase the security of multiple-image encryption, but also realize an authority management with high security among the users sharing a cipher image. For a simulation test, we devise a basic binary-tree encryption scheme, whose encryption nodes are based on an asymmetric double random phase encoding in the gyrator domain. The favorable simulation results about the tested scheme can testify to the feasibility of the strategy.

  11. 802.11i Encryption Key Distribution Using Quantum Cryptography

    Directory of Open Access Journals (Sweden)

    Thi Mai Trang Nguyen

    2006-10-01

    Full Text Available Quantum cryptography is a promising solution towards absolute security in long term cryptosystems. While the use of quantum cryptography in fiber optical networks gets significant advances, research on the application of quantum cryptography in mobile wireless network is still premature. In this paper, we analyze the interests of using quantum cryptography in 802.11 wireless networks, and propose a scheme integrating quantum cryptography in 802.11i security mechanisms for the distribution of the encryption keys. The use of an apparatus network to provide alternative line-of-sight paths is also discussed.

  12. Secure Hybrid Encryption from Weakened Key Encapsulation

    NARCIS (Netherlands)

    D. Hofheinz (Dennis); E. Kiltz (Eike); A. Menezes

    2007-01-01

    textabstractWe put forward a new paradigm for building hybrid encryption schemes from constrained chosen-ciphertext secure (CCCA) key-encapsulation mechanisms (KEMs) plus authenticated symmetric encryption. Constrained chosen-ciphertext security is a new security notion for KEMs that we propose. It

  13. Searching Keywords with Wildcards on Encrypted Data

    NARCIS (Netherlands)

    Sedghi, S.; Liesdonk, van Peter; Nikova, Svetla; Hartel, Pieter; Jonker, Willem

    2010-01-01

    A hidden vector encryption scheme (HVE) is a derivation of identity-based encryption, where the public key is actually a vector over a certain alphabet. The decryption key is also derived from such a vector, but this one is also allowed to have ``$\\star$'' (or wildcard) entries. Decryption is possib

  14. Searching Keywords with Wildcards on Encrypted Data

    NARCIS (Netherlands)

    Sedghi, Saeed; Liesdonk, van Peter; Nikova, Svetla; Hartel, Pieter; Jonker, Willem

    2010-01-01

    A hidden vector encryption scheme (HVE) is a derivation of identity-based encryption, where the public key is actually a vector over a certain alphabet. The decryption key is also derived from such a vector, but this one is also allowed to have "*" (or wildcard) entries. Decryption is possible as lo

  15. Space-based optical image encryption.

    Science.gov (United States)

    Chen, Wen; Chen, Xudong

    2010-12-20

    In this paper, we propose a new method based on a three-dimensional (3D) space-based strategy for the optical image encryption. The two-dimensional (2D) processing of a plaintext in the conventional optical encryption methods is extended to a 3D space-based processing. Each pixel of the plaintext is considered as one particle in the proposed space-based optical image encryption, and the diffraction of all particles forms an object wave in the phase-shifting digital holography. The effectiveness and advantages of the proposed method are demonstrated by numerical results. The proposed method can provide a new optical encryption strategy instead of the conventional 2D processing, and may open up a new research perspective for the optical image encryption.

  16. Optical encryption for large-sized images

    Science.gov (United States)

    Sanpei, Takuho; Shimobaba, Tomoyoshi; Kakue, Takashi; Endo, Yutaka; Hirayama, Ryuji; Hiyama, Daisuke; Hasegawa, Satoki; Nagahama, Yuki; Sano, Marie; Oikawa, Minoru; Sugie, Takashige; Ito, Tomoyoshi

    2016-02-01

    We propose an optical encryption framework that can encrypt and decrypt large-sized images beyond the size of the encrypted image using our two methods: random phase-free method and scaled diffraction. In order to record the entire image information on the encrypted image, the large-sized images require the random phase to widely diffuse the object light over the encrypted image; however, the random phase gives rise to the speckle noise on the decrypted images, and it may be difficult to recognize the decrypted images. In order to reduce the speckle noise, we apply our random phase-free method to the framework. In addition, we employ scaled diffraction that calculates light propagation between planes with different sizes by changing the sampling rates.

  17. IMAGE ENCRYPTION BASED ON SINGULAR VALUE DECOMPOSITION

    Directory of Open Access Journals (Sweden)

    Nidhal K. El Abbadi

    2014-01-01

    Full Text Available Image encryption is one of the most methods of information hiding. A novel secure encryption method for image encryption is presented in this study. The proposed algorithm based on using singular value decomposition SVD. In this study we start to scramble the image data according to suggested keys (two sequence scrambling process with two different keys to finally create two different matrices. The diagonal matrix from the SVD will be interchanged with the resulted matrices. Another scrambling and diagonal matrices interchange will apply to increase the complexity. The resulted two matrices combine to one matrix according to predefined procedure. The encrypted image is a meaningfull image. The suggested method tested with many images encryption and gives promised results.

  18. Fuzzy Identities and Attribute-Based Encryption

    Science.gov (United States)

    Sahai, Amit; Waters, Brent

    We introduce a new type of Identity-Based Encryption (IBE) scheme that we call Fuzzy Identity-Based Encryption. In fuzzy IBE, we view an identity as a set of descriptive attributes. A fuzzy IBE scheme allows for a private key for an identity,ωù, to decrypt a ciphertext encrypted with an identity, ùω´, if and only if the identities ùω and ùω´are close to each other as measured by the "set overlap" distance metric. A fuzzy IBE scheme can be applied to enable encryption using biometric inputs as identities; the error-tolerance property of a fuzzy IBE scheme is precisely what allows for the use of biometric identities, which inherently will have some noise each time they are sampled. Additionally, we show that fuzzy IBE can be used for a type of application that we term "attribute-based encryption."

  19. Reducing interferences in wireless communication systems by mobile agents with recurrent neural networks-based adaptive channel equalization

    Science.gov (United States)

    Beritelli, Francesco; Capizzi, Giacomo; Lo Sciuto, Grazia; Napoli, Christian; Tramontana, Emiliano; Woźniak, Marcin

    2015-09-01

    Solving channel equalization problem in communication systems is based on adaptive filtering algorithms. Today, Mobile Agents (MAs) with Recurrent Neural Networks (RNNs) can be also adopted for effective interference reduction in modern wireless communication systems (WCSs). In this paper MAs with RNNs are proposed as novel computing algorithms for reducing interferences in WCSs performing an adaptive channel equalization. The method to provide it is so called MAs-RNNs. We perform the implementation of this new paradigm for interferences reduction. Simulations results and evaluations demonstrates the effectiveness of this approach and as better transmission performance in wireless communication network can be achieved by using the MAs-RNNs based adaptive filtering algorithm.

  20. An encryption scheme for a secure policy updating

    NARCIS (Netherlands)

    Ibraimi, L.; Asim, Muhammad; Petkovic, M.

    2010-01-01

    Ciphertext policy attribute based encryption is an encryption technique where the data is encrypted according to an access policy over attributes. Users who have a secret key associated with a set of attributes which satisfy the access policy can decrypt the encrypted data. However, one of the

  1. Efficient ID-Based Multi-Decrypter Encryption with Short Ciphertexts

    Institute of Scientific and Technical Information of China (English)

    Zhen-Chuan Chai; Zhen-Fu Cao; Yuan Zhou

    2007-01-01

    Multi-decrypter encryption is a typical application in multi-user cryptographic branches.In multi-decrypter encryption, a message is encrypted under multiple decrypters' public keys in the way that only when all the decrypters cooperate, can the message be read.However, trivial implementation of multi-decrypter encryption using standard ap-proaches leads to heavy computation costs and long ciphertext which grows as the receiver group expands.This consumes much precious bandwidth in wireless environment, such as mobile ad hoc network.In this paper, we propose an efficient identity based multi-decrypter encryption scheme, which needs only one or zero (if precomputed) pairing computation and the ciphertext contains only three group elements no matter how many the receivers are.Moreover, we give a formal security definition for the scheme, and prove the scheme to be chosen ciphertext secure in the random oracle model, and discuss how to modify the scheme to resist chosen ciphertext attack.

  2. Easy encryption for CERN laptops

    CERN Document Server

    Computer Security Team

    2014-01-01

    The number of laptops stolen from or lost by CERN staff and users is not negligible. On average, four to five devices are reported lost or stolen to the CERN Fire Brigade every month.   The real number might be even higher as not everyone is aware that such thefts/losses should be reported in this way. Along with each laptop, private e-mails and personal documents, as well as MARS forms, contracts, NDAs, etc. are also lost. Fortunately, CERN has not lost any sensitive data so far (unlike other companies). In parallel with the approval by the Enlarged Directorate at its latest session of the development of a CERN-wide Data Protection Policy, the IT Department has prepared measures allowing you to protect the data on your laptop using full hard-disk encryption. While the word “encryption” might sounds complicated, the IT Department has fully automated the encryption process. For centrally managed Windows PCs, you just have to install the corresponding CMF package (“M...

  3. Area Optimized Advanced Encryption Standard

    Directory of Open Access Journals (Sweden)

    Mr. Sandip R. Aher

    2014-08-01

    Full Text Available Performance evaluation of the Advanced Encryption Standard candidates has become led to intensive study of both hardware and software implementations. However, number of papers presents various implementation results, it shows that efficiency could still be greatly improved by applying effective design rules adapted to devices and algorithms. This paper shows various approaches for efficient FPGA implementations of the Advanced Encryption Standard algorithm. For different applications of the AES algorithm may require different s peed/area tradeoffs, we propose a vital study of the possible implementation schemes, but also the discussion of design methodology and algorithmic optimization in order to improve previous reported results. We propose system to evaluate hardware efficiency at different steps of the design process. We also use an optimal pipeline that takes the place and route constraints into account. Resulting circuits significantly improve the previous reported results: throughput has been up to 18.5 Gbits/sec and the area requirements can be limited to 542 slices and 10 RAM blocks with a ratio throughput/area improved by minimum 25% of the best-known designs in the Xilinx Virtex- E technology.

  4. A Framework for Research in Gamified Mobile Guide Applications using Embodied Conversational Agents (ECAs

    Directory of Open Access Journals (Sweden)

    Ioannis Doumanis

    2015-09-01

    Full Text Available Mobile Guides are mobile applications that provide players with local and location-based services (LBS, such as navigation assistance, where and when they need them most. Advances in mobile technologies in recent years have enabled the gamification of these applications, opening up new opportunities to transfer education and culture through game play. However, adding traditional game elements such as PBLs (points, badges, and leaderboards alone cannot ensure that the intended learning outcomes will be met, as the player’s cognitive resources are shared between the application and the surrounding environment. This distribution of resources prevents players from easily immersing themselves into the educational scenario. Adding artificial conversational characters (ECAs that simulate the social norms found in real-life human-to-human guide scenarios has the potential to address this problem and improve the player’s experience and learning of cultural narratives [1]. Although significant progress has been made towards creating game-like mobile guides with ECAs ([2], [3], there is still a lack of a unified framework that enables researchers and practitioners to investigate the potential effects of such applications to players and how to approach the concepts of player experience, cognitive accessibility and usability in this context. This paper presents a theoretically-well supported research framework consisted of four key components: differences in players, different features of the gamified task, aspects of how the ECA looks, sound or behaves and different mobile environments. Furthermore, it provides based on this framework a working definition of what player experience, cognitive accessibility and usability are in the context of game-like mobile guide applications. Finally, a synthesis of the results of six empirical studies conducted within this research framework is discussed and a series of design guidelines for the effective gamification

  5. Multiple image encryption by phase retrieval

    Science.gov (United States)

    Di, Hong; Kang, Yanmei; Liu, Yueqin; Zhang, Xin

    2016-07-01

    Multiple image encryption (MIE) was proposed to increase the efficiency of encrypting images by processing several images simultaneously. Because of the advantage of optical technology in processing twodimensional images at high throughput, MIE has been significantly improved by use of methods originating from optics. Phase retrieval was the process of algorithmically finding solutions to the phase loss problem due to light detectors only capturing the intensity. It was to retrieve phase information for the determination of a structure from diffraction data. Error-reduction algorithm is a typical phase retrieval method. Here, we employ it to illustrate that methods in phase retrieval are able to encrypt multiple images and compress them into encrypted data simultaneously. Moreover, the decryption is also designed to handle multiple images at the same time. The whole process including both the encryption and decryption is proposed to improve MIE with respect to the compression and efficiency. The feasibility and encryption of the MIE scheme is demonstrated with encryption experiments under Gaussian white noise and unauthorized access.

  6. Development of improved mobility control agents for surfactant/polymer flooding. Second annual report, October 1, 1979-September 30, 1980

    Energy Technology Data Exchange (ETDEWEB)

    Martin, F.D.; Donaruma, L.G.; Hatch, M.J.

    1981-04-01

    The objective of this laboratory work is to develop improved mobility control agents that are more effective than the commercial polymers currently used in this process. During the second year of the project, the baseline testing of commercial products was completed. These baseline tests with polymers include studies on mobility control, retention, and shear degradation in Berea cores, the effect of common ions on rheological properties, thermal stability, microbial degradation, and surfactant-polymer interactions. These data are used for comparison of the commercial agents at standardized sets of conditions, and are also used to evaluate new, modified, or improved polymers. Work was also initiated on the synthesis, characterization, and preliminary screening of new and modified polymers. Testing of these analogs provides systematic correlations of polymer performance with polymer structure. This preliminary testing consists of measurements of shear degradation and viscosity loss in NaCl brines by the use of a simplified screening procedure. To date, a number of potential structure-utility relationships have been observed. Solution viscosities of all nonionic polymers tested are essentially insensitive to changes in NaCl concentration. Increasing the charge-to-mass ratio (degree of hydrolysis) of either polyacrylamides or N-alkyl analogs enhances the ability of these polymers to build viscosity in low salinity NaCl brines. However, such polymers are increasingly subject to viscosity loss as the salinity is increased. Above a certain critical molecular weight, polymers become more susceptible to shear degradation. Many of the polymers that possess stiffer backbones exhibit improved brine and shear stability. The results of these studies will be used to develop an improved mobility control polymer in the next phase of this project.

  7. A realizable quantum encryption algorithm for qubits

    Institute of Scientific and Technical Information of China (English)

    Zhou Nan-Run; Zeng Gui-Hua

    2005-01-01

    A realizable quantum encryption algorithm for qubits is presented by employing bit-wise quantum computation.System extension and bit-swapping are introduced into the encryption process, which makes the ciphertext space expanded greatly. The security of the proposed algorithm is analysed in detail and the schematic physical implementation is also provided. It is shown that the algorithm, which can prevent quantum attack strategy as well as classical attack strategy, is effective to protect qubits. Finally, we extend our algorithm to encrypt classical binary bits and quantum entanglements.

  8. Optical image encryption based on diffractive imaging.

    Science.gov (United States)

    Chen, Wen; Chen, Xudong; Sheppard, Colin J R

    2010-11-15

    In this Letter, we propose a method for optical image encryption based on diffractive imaging. An optical multiple random phase mask encoding system is applied, and one of the phase-only masks is selected and laterally translated along a preset direction during the encryption process. For image decryption, a phase retrieval algorithm is proposed to extract a high-quality plaintext. The feasibility and effectiveness of the proposed method are demonstrated by numerical results. The proposed method can provide a new strategy instead of conventional interference methods, and it may open up a new research perspective for optical image encryption.

  9. ECAKP: Encrypt Collect Authenticate Kill Play

    CERN Document Server

    El-Khouly, Mahmoud Mohamed

    2011-01-01

    We are taught from a young age that plagiarism (copying other's work) is wrong. However, the problem of Illegal copies of multimedia data is exacerbated by the widespread availability of circumvention devices, which enable people to make infringing copies of multimedia data. Recently, Joint Video Compression and Encryption (JVCE) has gained increased attention to reduce the computational complexity of video compression, as well as provide encryption of multimedia data. In this paper, a novel protection method for multimedia data (ECAKP) is proposed. It combines encryption process and compression with authenticating process. The method had been implemented and the results are discussed in detail.

  10. A COMPARISON BETWEEN EXPERT SYSTEMS AND AUTONOMIC COMPUTING PLUS MOBILE AGENT APPROACHES FOR FAULT MANAGEMENT.

    Directory of Open Access Journals (Sweden)

    SERGIO ARMANDO GUTIÉRREZ

    2011-01-01

    Full Text Available En este trabajo se presenta una revisión de trabajos relacionados a la aplicación de sistemas expertos a la gestión de fallas. Se introduce también un enfoque novedoso, basado en el paradigma de la computación autónoma y la tecnología de agentes móviles, y sus principales características son comparadas con respecto a las equivalentes de los sistemas expertos. Los benefi cios del esquema basado en agentes móviles son presentados.

  11. A Connectionism Approach to the Emulation of Multi-Agent Mobile Robots

    OpenAIRE

    Massey, S; Zalzala, A.M.S.

    1994-01-01

    The work presented in this report deals with the modelling and subsequent neural network emulation of autonomous mobile robots, moving in pre-defined environments in response to given control signals. This work was undertaken with the intention of training neural network based controllers for the vehicles, in order to control them whilst they performed required navigational tasks, whilst avoiding collisions with each other and with environmental obstacles. The required modelling was carried o...

  12. Encrypted Data Storage in EGEE

    CERN Document Server

    Frohner, Ákos

    2006-01-01

    The medical community is routinely using clinical images and associated medical data for diagnosis, intervention planning and therapy follow-up. Medical imaging is producing an increasing number of digital images for which computerized archiving, processing and analysis are needed. Grids are promising infrastructures for managing and analyzing the huge medical databases. Given the sensitive nature of medical images, practiotionners are often reluctant to use distributed systems though. Security if often implemented by isolating the imaging network from the outside world inside hospitals. Given the wide scale distribution of grid infrastructures and their multiple administrative entities, the level of security for manipulating medical data should be particularly high. In this presentation we describe the architecture of a solution, the gLite Encrypted Data Storage (EDS), which was developed in the framework of Enabling Grids for E-sciencE (EGEE), a project of the European Commission (contract number INFSO--508...

  13. A quantum approach to homomorphic encryption

    Science.gov (United States)

    Tan, Si-Hui; Kettlewell, Joshua A.; Ouyang, Yingkai; Chen, Lin; Fitzsimons, Joseph F.

    2016-09-01

    Encryption schemes often derive their power from the properties of the underlying algebra on the symbols used. Inspired by group theoretic tools, we use the centralizer of a subgroup of operations to present a private-key quantum homomorphic encryption scheme that enables a broad class of quantum computation on encrypted data. The quantum data is encoded on bosons of distinct species in distinct spatial modes, and the quantum computations are manipulations of these bosons in a manner independent of their species. A particular instance of our encoding hides up to a constant fraction of the information encrypted. This fraction can be made arbitrarily close to unity with overhead scaling only polynomially in the message length. This highlights the potential of our protocol to hide a non-trivial amount of information, and is suggestive of a large class of encodings that might yield better security.

  14. SEARCHABLE SYMMETRIC ENCRYPTION: REVIEW AND EVALUATION

    Directory of Open Access Journals (Sweden)

    YAP JOE EARN

    2011-08-01

    Full Text Available Searchable Symmetric Encryption (SSE allows a user to search over their encrypted data on a third party storage provider privately. There are several existing SSE schemes have been proposed to achieve this goal. This paper concerns with three currentSSE schemes, which are the Practical Techniques for Searches in Encrypted Data (PTSED, the Secure Index(SI, and the Fuzzy Keyword Search over Encrypted Data in the Cloud Computing (FKS-EDCC.The objective of this paper is to introduce a review of the three schemes with a discussion in the advantages and disadvantages of each.This paper also implements aprototype over an SI-based secure file searching system using java language. The performance of the system has been evaluated and discussed according to the false-positive rate.

  15. Quantum Secure Dialogue with Quantum Encryption

    Science.gov (United States)

    Ye, Tian-Yu

    2014-09-01

    How to solve the information leakage problem has become the research focus of quantum dialogue. In this paper, in order to overcome the information leakage problem in quantum dialogue, a novel approach for sharing the initial quantum state privately between communicators, i.e., quantum encryption sharing, is proposed by utilizing the idea of quantum encryption. The proposed protocol uses EPR pairs as the private quantum key to encrypt and decrypt the traveling photons, which can be repeatedly used after rotation. Due to quantum encryption sharing, the public announcement on the state of the initial quantum state is omitted, thus the information leakage problem is overcome. The information-theoretical efficiency of the proposed protocol is nearly 100%, much higher than previous information leakage resistant quantum dialogue protocols. Moreover, the proposed protocol only needs single-photon measurements and nearly uses single photons as quantum resource so that it is convenient to implement in practice.

  16. Spatial chaos-based image encryption design

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    In recent years, the chaos based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption techniques, but the drawbacks of small key space and weak security in one-dimensional chaotic cryptosystems are obvious. In this paper, permutation and sub- stitution methods are incorporated to present a stronger image encryption algorithm. Spatial chaotic maps are used to realize the position permutation, and to confuse the relationship between the ci- pher-image and the plain-image. The experimental results demonstrate that the suggested encryption scheme of image has the advantages of large key space and high security; moreover, the distribution of grey values of the encrypted image has a random-like behavior.

  17. Spatial chaos-based image encryption design

    Institute of Scientific and Technical Information of China (English)

    LIU ShuTang; SUN FuYan

    2009-01-01

    In recent years, the chaos based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption techniques, but the drawbacks of small key space and weak security in one-dimensional chaotic cryptosystems are obvious. In this paper, permutation and sub-stitution methods are incorporated to present a stronger image encryption algorithm. Spatial chaotic maps are used to realize the position permutation, and to confuse the relationship between the ci-pher-image and the plain-image. The experimental results demonstrate that the suggested encryption scheme of image has the advantages of large key space and high security; moreover, the distribution of grey values of the encrypted image has a random-like behavior.

  18. A quantum approach to homomorphic encryption.

    Science.gov (United States)

    Tan, Si-Hui; Kettlewell, Joshua A; Ouyang, Yingkai; Chen, Lin; Fitzsimons, Joseph F

    2016-09-23

    Encryption schemes often derive their power from the properties of the underlying algebra on the symbols used. Inspired by group theoretic tools, we use the centralizer of a subgroup of operations to present a private-key quantum homomorphic encryption scheme that enables a broad class of quantum computation on encrypted data. The quantum data is encoded on bosons of distinct species in distinct spatial modes, and the quantum computations are manipulations of these bosons in a manner independent of their species. A particular instance of our encoding hides up to a constant fraction of the information encrypted. This fraction can be made arbitrarily close to unity with overhead scaling only polynomially in the message length. This highlights the potential of our protocol to hide a non-trivial amount of information, and is suggestive of a large class of encodings that might yield better security.

  19. EEG based image encryption via quantum walks.

    Science.gov (United States)

    Rawat, N; Shin, Y; Balasingham, I

    2016-08-01

    An electroencephalogram (EEG) based image encryption combined with Quantum walks (QW) is encoded in Fresnel domain. The computational version of EEG randomizes the original plaintext whereas QW can serve as an excellent key generator due to its inherent nonlinear chaotic dynamic behavior. First, a spatially coherent monochromatic laser beam passes through an SLM, which introduces an arbitrary EEG phase-only mask. The modified beam is collected by a CCD. Further, the intensity is multiply with the QW digitally. EEG shows high sensitivity to system parameters and capable of encrypting and transmitting the data whereas QW has unpredictability, stability and non-periodicity. Only applying the correct keys, the original image can be retrieved successfully. Simulations and comparisons show the proposed method to be secure enough for image encryption and outperforms prior works. The proposed method opens the door towards introducing EEG and quantum computation into image encryption and promotes the convergence between our approach and image processing.

  20. Ciphertext verification security of symmetric encryption schemes

    Institute of Scientific and Technical Information of China (English)

    HU ZhenYu; SUN FuChun; JIANG JianChun

    2009-01-01

    This paper formally discusses the security problem caused by the ciphertext verification,presenting a new security notion named IND-CVA (indistinguishability under ciphertext verification attacks) to chap acterize the privacy of encryption schemes in this situation.Allowing the adversary to access to both encryption oracle and ciphertext verification oracle,the new notion IND-CVA is slightly stronger than IND-CPA (indistinguishability under chosen-plaintext attacks) but much weaker than IND-CCA (indistinguishability under chosen-ciphertext attacks),and can be satisfied by most of the popular symmetric encryption schemes such as OTP (one-time-pad),CBC (cipher block chaining) and CTR (counter).An MAC (message authentication scheme) is usually combined with an encryption to guarantee secure communication (e.g.SSH,SSL and IPSec).However,with the notion of IND-CVA,this paper shows that a secure MAC can spoil the privacy in some cases.

  1. Self-Organized Link State Aware Routing for Multiple Mobile Agents in Wireless Network

    Science.gov (United States)

    Oda, Akihiro; Nishi, Hiroaki

    Recently, the importance of data sharing structures in autonomous distributed networks has been increasing. A wireless sensor network is used for managing distributed data. This type of distributed network requires effective information exchanging methods for data sharing. To reduce the traffic of broadcasted messages, reduction of the amount of redundant information is indispensable. In order to reduce packet loss in mobile ad-hoc networks, QoS-sensitive routing algorithm have been frequently discussed. The topology of a wireless network is likely to change frequently according to the movement of mobile nodes, radio disturbance, or fading due to the continuous changes in the environment. Therefore, a packet routing algorithm should guarantee QoS by using some quality indicators of the wireless network. In this paper, a novel information exchanging algorithm developed using a hash function and a Boolean operation is proposed. This algorithm achieves efficient information exchanges by reducing the overhead of broadcasting messages, and it can guarantee QoS in a wireless network environment. It can be applied to a routing algorithm in a mobile ad-hoc network. In the proposed routing algorithm, a routing table is constructed by using the received signal strength indicator (RSSI), and the neighborhood information is periodically broadcasted depending on this table. The proposed hash-based routing entry management by using an extended MAC address can eliminate the overhead of message flooding. An analysis of the collision of hash values contributes to the determination of the length of the hash values, which is minimally required. Based on the verification of a mathematical theory, an optimum hash function for determining the length of hash values can be given. Simulations are carried out to evaluate the effectiveness of the proposed algorithm and to validate the theory in a general wireless network routing algorithm.

  2. Mobilization

    Science.gov (United States)

    1987-01-01

    istic and romantic emotionalism that typifies this genre. Longino, James C., et al. “A Study of World War Procurement and Industrial Mobilization...States. Harrisburg, PA: Military Service Publishing Co., 1941. CARL 355.22 J72b. Written in rough prose , this World War II era document explains the

  3. Design and implementation of early warning system for Mobile customers’ complaints on basis of mixed encryption algorithm%混合加密算法的移动客户投诉预警系统的设计与实现

    Institute of Scientific and Technical Information of China (English)

    张超; 魏三强; 朱军; 赵彦; 陈伟

    2013-01-01

      In order to handle customer complaints timely and effectively, displaying and dealing with the complaining hotspots in a visual way, summarizing and analyzing the complaining hotspots based on customers’ complaining behavior, this research proposes a warning system design scheme for mobile customer complaints, which adapts to a certain geographic region. As a turning point, the security of the MD5 identity checkout strategy widely used in WEB is discussed, and the research puts forward an identity authentication encryption scheme made by a triple combination of MD5, AES and TDE (transparent data encryption). The system is developed by using ASP.NET and Baidu Map API technology. The function test shows that the system can improve the processing speed of the work order, reduce the customers’ reduplicate complaining rate, realize the automatic warning of complaining hotspots, and protect the safety of the sensitive data.%  为了及时有效地处理客户的投诉问题,以一种形象化的方式显示与管理投诉热点地区,通过对客户投诉行为进行分析和归纳投诉热点地区,提出了一种适应于某一地理区域的移动客户投诉预警系统的设计方案.以开发系统为契机,对WEB应用程序广泛使用的MD5身份校验策略的安全性进行了论述,提出一种MD5、AES和TDE(透明数据加密)的三重组合的身份认证加密方案的实现方法.通过使用ASP.NET和百度地图API技术,实现了系统的开发.经实地运行测试表明:该系统提高了工单处理速度,减少了客户重复投诉率,实现了投诉热点区域的自动预警,保护了敏感数据的安全.

  4. Improving security of a chaotic encryption approach

    OpenAIRE

    Li, SJ; Mou, XQ; Cai, YL

    2001-01-01

    E. Alvarez et al. presented a new chaotic encryption approach recently. But soon G. Alvarez et al. broke it with four cryptanalytic methods and found some other weaknesses. In this Letter we point out why the original scheme is so vulnerable to the proposed four attacks. The chief reasons are two essential defects existing in the original scheme. Based on such a fact, we present an improved encryption scheme to obtain higher security. The cryptographic properties of the improved scheme are st...

  5. Dynamic Agent Classification and Tracking Using an Ad Hoc Mobile Acoustic Sensor Network

    Directory of Open Access Journals (Sweden)

    Friedlander David

    2003-01-01

    Full Text Available Autonomous networks of sensor platforms can be designed to interact in dynamic and noisy environments to determine the occurrence of specified transient events that define the dynamic process of interest. For example, a sensor network may be used for battlefield surveillance with the purpose of detecting, identifying, and tracking enemy activity. When the number of nodes is large, human oversight and control of low-level operations is not feasible. Coordination and self-organization of multiple autonomous nodes is necessary to maintain connectivity and sensor coverage and to combine information for better understanding the dynamics of the environment. Resource conservation requires adaptive clustering in the vicinity of the event. This paper presents methods for dynamic distributed signal processing using an ad hoc mobile network of microsensors to detect, identify, and track targets in noisy environments. They seamlessly integrate data from fixed and mobile platforms and dynamically organize platforms into clusters to process local data along the trajectory of the targets. Local analysis of sensor data is used to determine a set of target attribute values and classify the target. Sensor data from a field test in the Marine base at Twentynine Palms, Calif, was analyzed using the techniques described in this paper. The results were compared to "ground truth" data obtained from GPS receivers on the vehicles.

  6. Dynamic 3-D chemical agent cloud mapping using a sensor constellation deployed on mobile platforms

    Science.gov (United States)

    Cosofret, Bogdan R.; Konno, Daisei; Rossi, David; Marinelli, William J.; Seem, Pete

    2014-05-01

    The need for standoff detection technology to provide early Chem-Bio (CB) threat warning is well documented. Much of the information obtained by a single passive sensor is limited to bearing and angular extent of the threat cloud. In order to obtain absolute geo-location, range to threat, 3-D extent and detailed composition of the chemical threat, fusion of information from multiple passive sensors is needed. A capability that provides on-the-move chemical cloud characterization is key to the development of real-time Battlespace Awareness. We have developed, implemented and tested algorithms and hardware to perform the fusion of information obtained from two mobile LWIR passive hyperspectral sensors. The implementation of the capability is driven by current Nuclear, Biological and Chemical Reconnaissance Vehicle operational tactics and represents a mission focused alternative of the already demonstrated 5-sensor static Range Test Validation System (RTVS).1 The new capability consists of hardware for sensor pointing and attitude information which is made available for streaming and aggregation as part of the data fusion process for threat characterization. Cloud information is generated using 2-sensor data ingested into a suite of triangulation and tomographic reconstruction algorithms. The approaches are amenable to using a limited number of viewing projections and unfavorable sensor geometries resulting from mobile operation. In this paper we describe the system architecture and present an analysis of results obtained during the initial testing of the system at Dugway Proving Ground during BioWeek 2013.

  7. CO2 philic surfactant as possible mobility control agent in EOR applications

    Science.gov (United States)

    Sagir, Muhammad; Tan, Isa M.; Mushtaq, Muhammad

    2014-10-01

    The effect of an in house developed CO2 philic surfactant in foam assisted WAG (FAWAG) on CO2 mobility is reported. We reacted methallyl chloride with nonylphenol ethoxylated alcohol and then sulfonated the produced product. The effect of surfactant on IFT between CO2 and brine was investigated in order to measure the affinity of surfactant with CO2. The detailed effects of pressure and temperature on IFT between CO2 / brine / surfactant at the specified pressure and temperature conditions is studied and reported. In-house developed surfactant effectively lowered down the IFT between CO2/brine from 32 mN/m to less than 6.10 mN / m. In addition, the newly developed surfactant was evaluated for its foam stability. The synthesized novel surfactant was further investigated for its effect on CO2 mobility in porous media and the findings are presented here. The in house developed surfactant has a great potential for CO2- EOR applications.

  8. Ion mobility spectrometric analysis of vaporous chemical warfare agents by the instrument with corona discharge ionization ammonia dopant ambient temperature operation.

    Science.gov (United States)

    Satoh, Takafumi; Kishi, Shintaro; Nagashima, Hisayuki; Tachikawa, Masumi; Kanamori-Kataoka, Mieko; Nakagawa, Takao; Kitagawa, Nobuyoshi; Tokita, Kenichi; Yamamoto, Soichiro; Seto, Yasuo

    2015-03-20

    The ion mobility behavior of nineteen chemical warfare agents (7 nerve gases, 5 blister agents, 2 lachrymators, 2 blood agents, 3 choking agents) and related compounds including simulants (8 agents) and organic solvents (39) was comparably investigated by the ion mobility spectrometry instrument utilizing weak electric field linear drift tube with corona discharge ionization, ammonia doping, purified inner air drift flow circulation operated at ambient temperature and pressure. Three alkyl methylphosphonofluoridates, tabun, and four organophosphorus simulants gave the intense characteristic positive monomer-derived ion peaks and small dimer-derived ion peaks, and the later ion peaks were increased with the vapor concentrations. VX, RVX and tabun gave both characteristic positive monomer-derived ions and degradation product ions. Nitrogen mustards gave the intense characteristic positive ion peaks, and in addition distinctive negative ion peak appeared from HN3. Mustard gas, lewisite 1, o-chlorobenzylidenemalononitrile and 2-mercaptoethanol gave the characteristic negative ion peaks. Methylphosphonyl difluoride, 2-chloroacetophenone and 1,4-thioxane gave the characteristic ion peaks both in the positive and negative ion mode. 2-Chloroethylethylsulfide and allylisothiocyanate gave weak ion peaks. The marker ion peaks derived from two blood agents and three choking agents were very close to the reactant ion peak in negative ion mode and the respective reduced ion mobility was fluctuated. The reduced ion mobility of the CWA monomer-derived peaks were positively correlated with molecular masses among structurally similar agents such as G-type nerve gases and organophosphorus simulants; V-type nerve gases and nitrogen mustards. The slope values of the calibration plots of the peak heights of the characteristic marker ions versus the vapor concentrations are related to the detection sensitivity, and within chemical warfare agents examined the slope values for sarin, soman

  9. Image encryption by redirection and cyclical shift

    Science.gov (United States)

    Grigoryan, Artyom M.; Wiatrek, Bryan A.; Agaian, Sos S.

    2015-05-01

    In this paper, we present a novel method for encrypting and decrypting large amounts of data such as two-dimensional (2-D) images, both gray-scale and color, without the loss of information, and using private keys of varying lengths. The proposed method is based on the concept of the tensor representation of an image and splitting the 2-D discrete Fourier transform (DFT) by one-dimensional (1-D) DFTs of signals from the tensor representation, or transform. The splitting of the transform is accomplished in a three-dimensional (3-D) space, namely on the 3-D lattice placed on the torus. Each splitting-signal of the image defines the 2-D DFT along the frequency-points located on the spirals on the torus. Spirals have different form and cover the lattice on the torus in a complex form, which makes them very effective when moving data through and between the spirals, and data along the spirals. The encryption consists of several iterative applications of mapping the 3-D torus into several ones of smaller sizes, and rotates then moves the data around the spirals on all tori. The encryption results in the image which is uncorrelated. The decryption algorithm uses the encrypted data, and processes them in inverse order with an identical number of iterations. The proposed method can be extended to encrypt and decrypt documents as well as other types of digital media. Simulation results of the purposed method are presented to show the performance for image encryption.

  10. A hybrid scheme for encryption and watermarking

    Science.gov (United States)

    Xu, Xiaowei; Dexter, Scott D.; Eskicioglu, Ahmet M.

    2004-06-01

    Encryption and watermarking are complementary lines of defense in protecting multimedia content. Recent watermarking techniques have therefore been developed independent from encryption techniques. In this paper, we present a hybrid image protection scheme to establish a relation between the data encryption key and the watermark. Prepositioned secret sharing allows the reconstruction of different encryption keys by communicating different activating shares for the same prepositioned information. Each activating share is used by the receivers to generate a fresh content decryption key. In the proposed scheme, the activating share is used to carry copyright or usage rights data. The bit stream that represents this data is also embedded in the content as a visual watermark. When the encryption key needs to change, the data source generates a new activating share, and embeds the corresponding watermark into the multimedia stream. Before transmission, the composite stream is encrypted with the key constructed from the new activating share. Each receiver can decrypt the stream after reconstructing the same key, and extract the watermark from the image. Our presentation will include the application of the scheme to a test image, and a discussion on the data hiding capacity, watermark transparency, and robustness to common attacks.

  11. 基于主从样式的移动代理安全模型的研究与实现%Research and Implement of Master-Slave Pattern Based Security Model for Mobile Agent

    Institute of Scientific and Technical Information of China (English)

    穆鸿; 王汝传; 张登银

    2003-01-01

    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.

  12. The Pattern as a Reusable Component to Adaptive Framework for Load Balancing Mobile Agent in Internet Banking

    Directory of Open Access Journals (Sweden)

    A. Meiappane

    2012-03-01

    Full Text Available In recent years, the Software Architecture (SA of an Internet banking has become one of the most challengeable and risky fields of modern technology. The advent of the Internet has revolutionized the way banking is being done. In Internet banking, we analyzed some attributes such as usage, security, availability, load balancing and so on. Among those attributes Load Balancing is a serious problem in the Internet and it is necessary to build new systems incorporating load balancing as integral part of their design. The use of patterns, which is of a reusable component, is a good tool to help designers build load balancing systems. In this paper we are going to propose cluster load balancing technique by using mobile agent.

  13. Double-random-phase encryption with photon counting for image authentication using only the amplitude of the encrypted image.

    Science.gov (United States)

    Wang, Yong; Markman, Adam; Quan, Chenggen; Javidi, Bahram

    2016-11-01

    We present a photon-counting double-random-phase encryption technique that only requires the photon-limited amplitude of the encrypted image for decryption. The double-random-phase encryption is used to encrypt an image, generating a complex image. Photon counting is applied to the amplitude of the encrypted image, generating a sparse noise-like image; however, the phase information is not retained. By not using the phase information, the encryption process is simplified, allowing for intensity detection and also less information to be recorded. Using a phase numerically generated from the correct encryption keys together with the photon-limited amplitude of the encrypted image, we are able to decrypt the image. Moreover, nonlinear correlation algorithms can be used to authenticate the decrypted image. Both amplitude-based and full-phase encryption using the proposed method are investigated. Preliminary computational results and performance evaluation are presented.

  14. Ionic liquid as a mobile phase additive in high-performance liquid chromatography for the simultaneous determination of eleven fluorescent whitening agents in paper materials.

    Science.gov (United States)

    Wang, Qing; Chen, Xianbo; Qiu, Bin; Zhou, Liang; Zhang, Hui; Xie, Juan; Luo, Yan; Wang, Bin

    2016-04-01

    In the present study, 11 4,4'-diaminostilbene-2,2'-disulfonic acid based fluorescent whitening agents with different numbers of sulfonic acid groups were separated by using an ionic liquid as a mobile phase additive in high-performance liquid chromatography with fluorescence detection. The effects of ionic liquid concentration, pH of mobile phase B, and composition of mobile phase A on the separation of fluorescent whitening agents were systematically investigated. The ionic liquid tetrabutylammonium tetrafluoroborate is superior to tetrabutylammomnium bromide for the separation of the fluorescent whitening agents. The optimal separation conditions were an ionic liquid concentration at 8 mM and the pH of mobile phase B at 8.5 with methanol as mobile phase A. The established method exhibited low limits of detection (0.04-0.07 ng/mL) and wide linearity ranges (0.30-20 ng/mL) with high linear correlation coefficients from 0.9994 to 0.9998. The optimized procedure was applied to analyze target analytes in paper samples with satisfactory results. Eleven target analytes were quantified, and the recoveries of spiked paper samples were in the range of 85-105% with the relative standard deviations from 2.1 to 5.1%. The obtained results indicated that the method was efficient for detection of 11 fluorescent whitening agents.

  15. Bioavailable phosphorus (P) reduction is less than mobile P immobilization in lake sediment for eutrophication control by inactivating agents.

    Science.gov (United States)

    Wang, Changhui; He, Rui; Wu, Yu; Lürling, Miquel; Cai, Haiyuan; Jiang, He-Long; Liu, Xin

    2017-02-01

    Phosphorus (P) immobilization by inactivating agents in the sediment of eutrophic lakes to reduce immediately available P in lake water is often crucial for mitigating nuisance eutrophication symptoms, such as cyanobacterial blooms. Macrophytes and phytoplankton, however, can directly utilize P from the sediment for growth. Accordingly, a comprehensive analysis of the P bioavailability in lake sediment amended with two promising P-inactivation agents, namely Phoslock(®) and drinking water treatment residue (DWTR), was investigated in both short- and long-term studies (20 and 180 d). Phosphorus-availability was assessed using six chemical extraction methods and Hydrilla verticillata and Microcystis aeruginosa growth tests. The results showed that Phoslock(®) and DWTR significantly reduced mobile P (NH4Cl and Na2S2O4/NaHCO3 extractable P) in lake sediment, while P bioavailability that was assessed by different methods showed considerable deviations. Interestingly, appropriate bioavailable P chemical extraction methods were determined based on linear correlation analysis, and further comparison indicated that reduction of bioavailable P by DWTR (P) and Phoslock(®) (P) were clearly less than the mobile P immobilization (>75%) at recommended dosages, which was probably caused by the capability of macrophyte and cyanobacteria to utilize various fractions of P (except the residual P) in amended sediment under proper illumination. Therefore, DWTR and Phoslock(®) can effectively reduce P release from lake sediment, but the potential bioavailable P may pose uncertainties for eutrophication control in lakes that typically have regular sediment re-suspension. Overall, an evaluation of the bioavailable P pool in the lake ecosystem should be essential for successful lake geo-engineering.

  16. Dual encryption scheme of images using polarized light.

    Science.gov (United States)

    Alfalou, A; Brosseau, C

    2010-07-01

    We propose and analyze a dual encryption/decryption scheme, motivated by recent interest in polarization encoding. Compared to standard optical encryption methods, which are based on phase and amplitude manipulation, this encryption procedure relying on Mueller-Stokes formalism provides large flexibility in the key encryption design. The effectiveness of our algorithm is discussed, thanks to a numerical simulation of the polarization encryption/decryption procedure of a 256 gray-level image. Of additional special interest is the immunity of this encryption algorithm to brute force attacks.

  17. Flexible optical encryption with multiple users and multiple security levels

    Science.gov (United States)

    Nishchal, Naveen K.; Naughton, Thomas J.

    2011-02-01

    We present a basic optical encryption architecture that admits several cryptography applications based on multiplexing. Users can decrypt different private images from the same encrypted image, a superuser can have a key that decrypts all encrypted images, and multiplexed images can be encrypted with different levels of security. This system is presented in the context of a general framework of optical encryption application development. We illustrate with a real-world three-dimensional scene, captured with digital holography, and encrypted using the fractional Fourier transform, where different users have access to different three-dimensional objects in the scene.

  18. Application of mobile agent in IOT%物联网中移动代理的应用研究

    Institute of Scientific and Technical Information of China (English)

    魏葆春

    2013-01-01

    通过对物联网网络管理技术的研究,分析了物联网网络管理中存在的问题。针对物联网无线化、移动化的发展趋势,给出了基于分布式网络代理管理模型,该模型通过引入移动代理技术,能够使之更好地适应物联网的管理需求。%The problems existing in IOT network management are analyzed on the basis of research on the network management technology of IOT. A management model based on the distributed network proxy was established in allusion to the development trend of IOT wireless running and mobilization. The model can adapt to the management demands of IOT much better through introduction of the mobile agent technology.

  19. Cooperative Multi-Agent Mobile Sensor Platforms for Jet Engine Inspection: Concept and Implementation

    Science.gov (United States)

    Litt, Jonathan S.; Wong, Edmond; Krasowski, Michael J.; Greer, Lawrence C.

    2003-01-01

    Cooperative behavior algorithms utilizing swarm intelligence are being developed for mobile sensor platforms to inspect jet engines on-wing. Experiments are planned in which several relatively simple autonomous platforms will work together in a coordinated fashion to carry out complex maintenance-type tasks within the constrained working environment modeled on the interior of a turbofan engine. The algorithms will emphasize distribution of the tasks among multiple units; they will be scalable and flexible so that units may be added in the future; and will be designed to operate on an individual unit level to produce the desired global effect. This proof of concept demonstration will validate the algorithms and provide justification for further miniaturization and specialization of the hardware toward the true application of on-wing in situ turbine engine maintenance.

  20. Shift-type homomorphic encryption and its application to fully homomorphic encryption

    NARCIS (Netherlands)

    Armknecht, F.; Katzenbeisser, S.; Peter, Andreas

    2012-01-01

    This work addresses the characterization of homomorphic encryption schemes both in terms of security and design. In particular, we are interested in currently existing fully homomorphic encryption (FHE) schemes and their common structures and security. Our main contributions can be summarized as fol

  1. Shift-type homomorphic encryption and its application to fully homomorphic encryption

    NARCIS (Netherlands)

    Armknecht, F.; Katzenbeisser, S.; Peter, A.

    2012-01-01

    This work addresses the characterization of homomorphic encryption schemes both in terms of security and design. In particular, we are interested in currently existing fully homomorphic encryption (FHE) schemes and their common structures and security. Our main contributions can be summarized as fol

  2. Shift-type homomorphic encryption and its application to fully homomorphic encryption

    NARCIS (Netherlands)

    Armknecht, F.; Katzenbeisser, S.; Peter, Andreas

    2012-01-01

    This work addresses the characterization of homomorphic encryption schemes both in terms of security and design. In particular, we are interested in currently existing fully homomorphic encryption (FHE) schemes and their common structures and security. Our main contributions can be summarized as

  3. Optical encryption in spatially-incoherent light using two LC SLMs for both information input and encryption element imaging

    Science.gov (United States)

    Bondareva, Alyona P.; Cheremkhin, Pavel A.; Evtikhiev, Nikolay N.; Krasnov, Vitaly V.; Rodin, Vladislav G.; Starikov, Sergey N.

    2014-10-01

    At present time methods of optical encryption are actively developed. The majority of existing methods of optical encryption use not only light intensity distribution, easily registered with photosensors, but also its phase distribution which require application of complex holographic schemes in conjunction with spatially coherent monochromatic illumination. This leads to complex optical schemes and low decryption quality. To eliminate these disadvantages it is possible to implement optical encryption using spatially incoherent monochromatic illumination which requires registration of light intensity distribution only. Encryption is accomplished by means of optical convolution of image of scene to be encrypted and encryption diffractive optical element (DOE) point spread function (PSF) which serves as encryption key. Encryption process is described as follows. Scene is illuminated with spatially-incoherent monochromatic light. In the absence of encryption DOE lens forms image of scene in photosensor plane. DOE serves as encryption element, its PSF - encryption key. Light passing through DOE forms convolution of object image and DOE PSF. Registered by photosensor convolution is encrypted image. Decryption was conducted numerically on computer by means of inverse filtration with regularization. Kinoforms were used as encryption DOE because they have single diffraction order. Two liquid crystal (LC) spatial light modulators (SLM) were used to implement dynamic digital information input and dynamic encryption key change. As input scene amplitude LC SLM HoloEye LC2002 with 800×600 pixels 32×32 μm2 and 256 gray levels was used. To image synthesized encryption kinoforms phase LC SLM HoloEye PLUTO VIS with 1920×1080 pixels 8×8 μm2 and 256 phase levels was used. Set of test images was successfully optically encrypted and then numerically decrypted. Encrypted images contents are hidden. Decrypted images despite quite high noise levels are positively recognizable

  4. Advanced Steganography Algorithm using Encrypted secret message

    Directory of Open Access Journals (Sweden)

    Joyshree Nath

    2011-03-01

    Full Text Available In the present work the authors have introduced a new method for hiding any encrypted secret message inside a cover file. For encrypting secret message the authors have used new algorithm proposed by Nath et al(1. For hiding secret message we have used a method proposed by Nath et al(2. In MSA(1 method we have modified the idea of Play fair method into a new platform where we can encrypt or decrypt any file. We have introduced a new randomization method for generating the randomized key matrix to encrypt plain text file and to decrypt cipher text file. We have also introduced a new algorithm for encrypting the plain text multiple times. Our method is totally dependent on the random text_key which is to be supplied by the user. The maximum length of the text_key can be of 16 characters long and it may contain any character(ASCII code 0 to 255. We have developed an algorithm to calculate the randomization number and the encryption number from the given text_key. The size of the encryption key matrix is 16x16 and the total number of matrices can be formed from 16 x 16 is 256! which is quite large and hence if someone applies the brute force method then he/she has to give trail for 256! times which is quite absurd. Moreover the multiple encryption method makes the system further secured. For hiding secret message in the cover file we have inserted the 8 bits of each character of encrypted message file in 8 consecutive bytes of the cover file. We have introduced password for hiding data in the cover file. We propose that our new method could be most appropriate for hiding any file in any standard cover file such as image, audio, video files. Because the hidden message is encrypted hence it will be almost impossible for the intruder to unhide the actual secret message from the embedded cover file. This method may be the most secured method in digital water marking.

  5. Adaptive Control Parameters for Dispersal of Multi-Agent Mobile Ad Hoc Network (MANET) Swarms

    Energy Technology Data Exchange (ETDEWEB)

    Kurt Derr; Milos Manic

    2013-11-01

    A mobile ad hoc network is a collection of independent nodes that communicate wirelessly with one another. This paper investigates nodes that are swarm robots with communications and sensing capabilities. Each robot in the swarm may operate in a distributed and decentralized manner to achieve some goal. This paper presents a novel approach to dynamically adapting control parameters to achieve mesh configuration stability. The presented approach to robot interaction is based on spring force laws (attraction and repulsion laws) to create near-optimal mesh like configurations. In prior work, we presented the extended virtual spring mesh (EVSM) algorithm for the dispersion of robot swarms. This paper extends the EVSM framework by providing the first known study on the effects of adaptive versus static control parameters on robot swarm stability. The EVSM algorithm provides the following novelties: 1) improved performance with adaptive control parameters and 2) accelerated convergence with high formation effectiveness. Simulation results show that 120 robots reach convergence using adaptive control parameters more than twice as fast as with static control parameters in a multiple obstacle environment.

  6. End-to-end Encryption for SMS Messages in the Health Care Domain.

    Science.gov (United States)

    Hassinen, Marko; Laitinen, Pertti

    2005-01-01

    The health care domain has a high level of expectation on security and privacy of patient information. The security, privacy, and confidentiality issues are consistent all over the domain. Technical development and increasing use of mobile phones has led us to a situation in which SMS messages are used in the electronic interactions between health care professionals and patients. We will show that it is possible to send, receive and store text messages securely with a mobile phone with no additional hardware required. More importantly we will show that it is possible to obtain a reliable user authentication in systems using text message communication. Programming language Java is used for realization of our goals. This paper describes the general application structure, while details for the technical implementation and encryption methods are described in the referenced articles. We also propose some crucial areas where the implementation of encrypted SMS can solve previous lack of security.

  7. Compression and Encryption of ECG Signal Using Wavelet and Chaotically Huffman Code in Telemedicine Application.

    Science.gov (United States)

    Raeiatibanadkooki, Mahsa; Quchani, Saeed Rahati; KhalilZade, MohammadMahdi; Bahaadinbeigy, Kambiz

    2016-03-01

    In mobile health care monitoring, compression is an essential tool for solving storage and transmission problems. The important issue is able to recover the original signal from the compressed signal. The main purpose of this paper is compressing the ECG signal with no loss of essential data and also encrypting the signal to keep it confidential from everyone, except for physicians. In this paper, mobile processors are used and there is no need for any computers to serve this purpose. After initial preprocessing such as removal of the baseline noise, Gaussian noise, peak detection and determination of heart rate, the ECG signal is compressed. In compression stage, after 3 steps of wavelet transform (db04), thresholding techniques are used. Then, Huffman coding with chaos for compression and encryption of the ECG signal are used. The compression rates of proposed algorithm is 97.72 %. Then, the ECG signals are sent to a telemedicine center to acquire specialist diagnosis by TCP/IP protocol.

  8. An algorithm for encryption of secret images into meaningful images

    Science.gov (United States)

    Kanso, A.; Ghebleh, M.

    2017-03-01

    Image encryption algorithms typically transform a plain image into a noise-like cipher image, whose appearance is an indication of encrypted content. Bao and Zhou [Image encryption: Generating visually meaningful encrypted images, Information Sciences 324, 2015] propose encrypting the plain image into a visually meaningful cover image. This improves security by masking existence of encrypted content. Following their approach, we propose a lossless visually meaningful image encryption scheme which improves Bao and Zhou's algorithm by making the encrypted content, i.e. distortions to the cover image, more difficult to detect. Empirical results are presented to show high quality of the resulting images and high security of the proposed algorithm. Competence of the proposed scheme is further demonstrated by means of comparison with Bao and Zhou's scheme.

  9. Trusted Mobile Client for Document Security in Mobile Office Automation

    OpenAIRE

    Xiaojun Yu; Qiaoyan Wen

    2011-01-01

    Mobile Office Automation is a popular application on the mobile platform. However, the mobile platform has no enough security protection in front of the open system, such as internet. The document security problem in this application has become a hot topic. This paper proposed a new solution to this problem. The solution based on the trusted computing technology, which implements the platform security by hardware. The solution also includes the transparent encryption technology that means app...

  10. Application of Mobile Agent in Network Flow Control%移动Agent在网络流量控制中的应用

    Institute of Scientific and Technical Information of China (English)

    张卫华; 徐海水

    2013-01-01

      提出采用移动代理(mobile agent)的网管框架,将代理支撑环境驻留在设备上,替代功能固定的代理,网管中心根据实际网络状态选择适当功能的代理程序发送到设备,在代理运行环境中生成程序实例(instance),完成预期功能,移动代理不仅收集而且能够自主处理数据,从而加快响应速度,减轻网管中心负载,优化网络流量控制。阐述移动代理的结构,控制问题,以及用于网络流量管理的系统框架和原型的实现。%Uses the mobile agent to build up a network management framework, and puts the support en-vironment of the agent on the equipment to replace the function fixed agent. Network manage-ment center selects an appropriate agent program which is based on the actual network status to send to the device, and the program will be generated as an instance to complete the expected functions. Mobile agent not only collect but also process data by itself, so it can speed up the response, and ease the load of network management center, all of this can optimize network flow control. Describes the structure of the mobile agent, and how to control it, as well as the frame-work and the prototype implementation of network flow management system.

  11. Authentication and Encryption in GSM and 3GUMTS: An Emphasis on Protocols and Algorithms

    CERN Document Server

    Elouafiq, Ali

    2012-01-01

    Mobile communication touches every aspect of our life, it become one of the major dependencies that the 21st Century civilizations rely on. Thereby, security is a major issue that should be targeted by communication technologies. In this paper we will target authentication and encryption in GSM and 3G/UMTS. In order to understand clearly how things work, we will start by presenting the architecture of each network, its major components, its authentication algorithms, protocols used, and KASUMI Block Cipher.

  12. Internet移动代理技术中的安全性研究%Study on security of Internet mobile agents technology

    Institute of Scientific and Technical Information of China (English)

    王常杰; 张方国; 王育民

    2001-01-01

    主要针对Internet的移动代理技术中的安全问题进行研究,介绍了移动代理技术的概念及目前主要的应用范畴,对该技术中的安全问题作了系统的分析.另外,对现有的移动代理系统的安全性能作了全面的比较,提出了后续的研究方向.%A research of security of Internet mobile agents technology ispresent in the paper. The conception of mobile agents and its main applications are introduced first and then we analyze the secruity questions in the mobile agents systems comprehensively. In addition, a general comparison of the security performance of the exiting mobile agents systems is given. As a result, we suggest the future study about the technology.

  13. PEA: Polymorphic Encryption Algorithm based on quantum computation

    OpenAIRE

    Komninos, N.; Mantas, G.

    2011-01-01

    In this paper, a polymorphic encryption algorithm (PEA), based on basic quantum computations, is proposed for the encryption of binary bits. PEA is a symmetric key encryption algorithm that applies different combinations of quantum gates to encrypt binary bits. PEA is also polymorphic since the states of the shared secret key control the different combinations of the ciphertext. It is shown that PEA achieves perfect secrecy and is resilient to eavesdropping and Trojan horse attacks. A securit...

  14. Chaotic Image Encryption of Regions of Interest

    Science.gov (United States)

    Xiao, Di; Fu, Qingqing; Xiang, Tao; Zhang, Yushu

    Since different regions of an image have different importance, therefore only the important information of the image regions, which the users are really interested in, needs to be encrypted and protected emphatically in some special multimedia applications. However, the regions of interest (ROI) are always some irregular parts, such as the face and the eyes. Assuming the bulk data in transmission without being damaged, we propose a chaotic image encryption algorithm for ROI. ROI with irregular shapes are chosen and detected arbitrarily. Then the chaos-based image encryption algorithm with scrambling, S-box and diffusion parts is used to encrypt the ROI. Further, the whole image is compressed with Huffman coding. At last, a message authentication code (MAC) of the compressed image is generated based on chaotic maps. The simulation results show that the encryption algorithm has a good security level and can resist various attacks. Moreover, the compression method improves the storage and transmission efficiency to some extent, and the MAC ensures the integrity of the transmission data.

  15. A Generic Hybrid Encryption System (HES

    Directory of Open Access Journals (Sweden)

    Ijaz Ali Shoukat

    2013-03-01

    Full Text Available This study proposes a Generic Hybrid Encryption System (HES under mutual committee of symmetric and asymmetric cryptosystems. Asymmetric (public key Cryptosystems associates several performance issues like computational incompetence, memory wastages, energy consumptions and employment limitations on bulky data sets but they are quite secure and reliable in key exchange over insecure remote communication channels. Symmetric (private key cryptosystems are 100 times out performed, having no such issues but they cannot fulfill non-repudiation, false modifications in secret key, fake modifications in cipher text and origin authentication of both parties while exchanging information. These contradictory issues can be omitted by utilizing hybrid encryption mechanisms (symmetric+asymmetric to get optimal benefits of both schemes. Several hybrid mechanisms are available with different logics but our logic differs in infrastructural design, simplicity, computational efficiency and security as compared to prior hybrid encryption schemes. Some prior schemes are either diversified in performance aspects, customer satisfaction, memory utilization or energy consumptions and some are vulnerable against forgery and password guessing (session key recovery attacks. We have done some functional and design related changes in existing Public Key Infrastructure (PKI to achieve simplicity, optimal privacy and more customer satisfaction by providing Hybrid Encryption System (HES that is able to fulfill all set of standardized security constraints. No such PKI based generic hybrid encryption scheme persists as we have provided in order to manage all these kinds of discussed issues.

  16. Inexpensive CO2 Thickening Agents for Improved Mobility Control of CO2 Floods

    Energy Technology Data Exchange (ETDEWEB)

    Robert Enick; Eric Beckman; Andrew Hamilton

    2005-08-31

    The objective of this research was the design, synthesis and evaluation of inexpensive, non-fluorous carbon dioxide thickening agents. We followed the same strategy employed in the design of fluorinated CO{sub 2} polymeric thickeners. First, a highly CO{sub 2}-philic, hydrocarbon-based monomer was to be identified. Polymers or oligomers of this monomer were then synthesized. The second step was to design a CO{sub 2}-thickener based on these CO{sub 2}-philic polymers. Two types of thickeners were considered. The first was a copolymer in which the CO{sub 2}-philic monomer was combined with a small proportion of CO{sub 2}-phobic associating groups that could cause viscosity-enhancing intermolecular interactions to occur. The second was a small hydrogen-bonding compound with urea groups in the core to promote intermolecular interactions that would cause the molecules to 'stack' in solution while the arms were composed of the CO{sub 2}-philic oligomers. Although we were not able to develop a viable thickener that exhibited high enough CO{sub 2} solubility at EOR MMP conditions to induce a viscosity increase, we made significant progress in our understanding of CO{sub 2}-soluble compounds that can be used in subsequent studies to design CO{sub 2}-soluble thickeners or CO{sub 2}-soluble surfactant-based foaming agents. These findings are detailed in this final report. In summary, we assessed many polymers and verified that the most CO{sub 2}-soluble oxygenated hydrocarbon polymer is poly(vinyl acetate), PVAc. This is primarily due to the presence of both ether and carbonyl oxygens associated with acetate-rich compounds. In addition to polymers, we also made small acetate-rich molecules that were also capable of associating in solution via the inclusion of hydrogen-bonding groups in hopes of forming viscosity-enhancing macromolecules. Despite the presence of multiple acetate groups in these compounds, which can impart incredible CO{sub 2}-solubility to many

  17. Towards an Information Theoretic Analysis of Searchable Encryption

    NARCIS (Netherlands)

    Sedghi, S.; Doumen, J.M.; Hartel, P.H.; Jonker, W.

    2008-01-01

    Searchable encryption is a technique that allows a client to store data in encrypted form on a curious server, such that data can be retrieved while leaking a minimal amount of information to the server. Many searchable encryption schemes have been proposed and proved secure in their own computation

  18. Towards an Information Theoretic Analysis of Searchable Encryption (Extended Version)

    NARCIS (Netherlands)

    Sedghi, S.; Doumen, J.M.; Hartel, P.H.; Jonker, W.

    2008-01-01

    Searchable encryption is a technique that allows a client to store data in encrypted form on a curious server, such that data can be retrieved while leaking a minimal amount of information to the server. Many searchable encryption schemes have been proposed and proved secure in their own computation

  19. Type-based Proxy Re-encryption and its Construction

    NARCIS (Netherlands)

    Tang, Qiang

    Recently, the concept of proxy re-encryption has been shown very useful in a number of applications, especially in enforcing access control policies. In existing proxy re-encryption schemes, the delegatee can decrypt all ciphertexts targeted to the delegator after re-encryption by the proxy.

  20. Towards an Information Theoretic Analysis of Searchable Encryption (Extended Version)

    NARCIS (Netherlands)

    Sedghi, S.; Doumen, J.M.; Hartel, Pieter H.; Jonker, Willem

    2008-01-01

    Searchable encryption is a technique that allows a client to store data in encrypted form on a curious server, such that data can be retrieved while leaking a minimal amount of information to the server. Many searchable encryption schemes have been proposed and proved secure in their own

  1. Towards an Information Theoretic Analysis of Searchable Encryption

    NARCIS (Netherlands)

    Sedghi, S.; Doumen, J.M.; Hartel, Pieter H.; Jonker, Willem

    2008-01-01

    Searchable encryption is a technique that allows a client to store data in encrypted form on a curious server, such that data can be retrieved while leaking a minimal amount of information to the server. Many searchable encryption schemes have been proposed and proved secure in their own

  2. Type-Based Proxy Re-encryption and Its Construction

    NARCIS (Netherlands)

    Tang, Qiang

    2008-01-01

    Recently, the concept of proxy re-encryption has been shown very useful in a number of applications, especially in enforcing access control policies. In existing proxy re-encryption schemes, the delegatee can decrypt all ciphertexts for the delegator after re-encryption by the proxy. Consequently,

  3. Experiments With Queries Over Encrypted Data Using Secret Sharing

    NARCIS (Netherlands)

    Brinkman, R.; Schoenmakers, B.; Doumen, J.M.; Jonker, W.; Jonker, W.; Petkovic, M.

    2005-01-01

    To avoid insider attacks one cannot rely on access control to protect a database scheme. Encrypting the database is a better option. This paper describes a working prototype of an encrypted database system that allows remote querying over the encrypted data. Experiments with the system show the prac

  4. Experiments with Queries over Encrypted Data Using Secret Sharing

    NARCIS (Netherlands)

    Brinkman, R.; Schoenmakers, B.; Doumen, J.; Jonker, W.

    2005-01-01

    To avoid insider attacks one cannot rely on access control to protect a database scheme. Encrypting the database is a better option. This paper describes a working prototype of an encrypted database system that allows remote querying over the encrypted data. Experiments with the system show the prac

  5. Evaluation of Format- Preserving Encryption Algorithms for Critical Infrastructure Protection

    OpenAIRE

    Agbeyibor, Richard; Butts, Jonathan; Grimaila, Michael; Mills, Robert

    2014-01-01

    Part 5: Advanced Techniques; International audience; Legacy critical infrastructure systems lack secure communications capabilities that can protect against modern threats. In particular, operational requirements such as message format and interoperability prevent the adoption of standard encryption algorithms. Three new algorithms recommended by the National Institute of Standards and Technology (NIST) for format-preserving encryption could potentially support the encryption of legacy protoc...

  6. 一种基于绑定邮箱的可靠移动Agent通信算法%Reliable Mobile Agent Communication Algorithm Based on Binding Mailbox

    Institute of Scientific and Technical Information of China (English)

    闫七斐; 惠晓威; 卢永

    2011-01-01

    In recent years, mobile Agent communications algorithm has been the focus of the study.This paper analyzes several mobile Agent communication algorithms and puts forward a reliable, secure, flexible and optimal utilization of message binding mailbox Agent communication algorithms based on previous studies.%移动Agent通信算法一直是近些年研究的重点.通过分析几种移动Agent通信机制,并且在总结前人研究的基础上,提出了一种可靠、安全、灵活和消息利用率最优的邮箱绑定Agent通信算法.

  7. Impossible differential cryptanalysis of advanced encryption standard

    Institute of Scientific and Technical Information of China (English)

    CHEN Jie; HU YuPu; ZHANG YueYu

    2007-01-01

    Impossible differential cryptanalysis is a method recovering secret key, which gets rid of the keys that satisfy impossible differential relations. This paper concentrates on the impossible differential cryptanalysis of Advanced Encryption Standard (AES)and presents two methods for impossible differential cryptanalysis of 7-round AES-192 and 8-round AES-256 combined with time-memory trade-off by exploiting weaknesses in their key schedule. This attack on the reduced to 7-round AES-192 requires about 294.5 chosen plaintexts, demands 2129 words of memory, and performs 2157 7-round AES-192 encryptions. Furthermore, this attack on the reduced to 8-round AES-256 requires about 2101 chosen plaintexts, demands 2201 words of memory, and performs 2228 8-round AES-256 encryptions.

  8. Frontpage and Dreamweaver users must use encryption

    CERN Multimedia

    Web Services

    2006-01-01

    In order to ensure document confidentiality and protect users from the possible theft of their passwords, all web authoring actions will be required to use encryption as of 15 February 2006. Most Frontpage and Dreamweaver users will have to slightly change the way they connect to their web sites in order to enable encryption. Please note that only the initial connection to the web site from Frontpage or Dreamweaver is affected: there is no change in the use of these applications after the initial connection, and the web site itself is not affected. Further details, as well as instructions on how to enable encryption, are available at: http://cern.ch/web/docs/AuthDoc/SecureAuthoring. In case of problems, please contact the computer helpdesk or web.support@cern.ch. The Web Services Team

  9. Generic Adaptively Secure Searchable Phrase Encryption

    Directory of Open Access Journals (Sweden)

    Kissel Zachary A.

    2017-01-01

    Full Text Available In recent years searchable symmetric encryption has seen a rapid increase in query expressiveness including keyword, phrase, Boolean, and fuzzy queries. With this expressiveness came increasingly complex constructions. Having these facts in mind, we present an efficient and generic searchable symmetric encryption construction for phrase queries. Our construction is straightforward to implement, and is proven secure under adaptively chosen query attacks (CQA2 in the random oracle model with an honest-but-curious adversary. To our knowledge, this is the first encrypted phrase search system that achieves CQA2 security. Moreover, we demonstrate that our document collection preprocessing algorithm allows us to extend a dynamic SSE construction so that it supports phrase queries. We also provide a compiler theorem which transforms any CQA2-secure SSE construction for keyword queries into a CQA2-secure SSE construction that supports phrase queries.

  10. Frontpage and Dreamweaver users must use encryption

    CERN Multimedia

    Web Services Team

    2006-01-01

    In order to ensure document confidentiality and protect users from the possible theft of their passwords, all web authoring actions will be required to use encryption as of 15 February 2006. Most Frontpage and Dreamweaver users will have to slightly change the way they connect to their web sites in order to enable encryption. Please note that only the initial connection to the web site from Frontpage or Dreamweaver is affected: there is no change in the use of these applications after the initial connection, and the web site itself is not affected. Further details, as well as instructions on how to enable encryption, are available at: http://cern.ch/web/docs/AuthDoc/SecureAuthoring. In case of problems, please contact the computer helpdesk or web.support@cern.ch. The Web Services Team

  11. 采用增量时间戳安全技术的Mobile Agent系统%Mobile Agent System by Incremental Timestamp Security Technique

    Institute of Scientific and Technical Information of China (English)

    万燕; 孙永强; 朱向华; 唐进

    2002-01-01

    安全技术决定了Mobile Agent的实用性,其主要解决的问题是防范恶意Mobile Agent的重复攻击和越权攻击.在介绍了Mobile Agent的概念、特点及安全的重要性的基础上,提出了增量时间戳的概念及优点,并给出了具体例证.采用增量时间戳的Mobile Agent系统能够较好地避免执行系统受到恶意Mobile Agent的损害.增量时间戳技术已经在基于Lucent公司的Inferno系统上开发的Mobile Agent系统中得到了验证和实现.

  12. Information encryption systems based on Boolean functions

    Directory of Open Access Journals (Sweden)

    Aureliu Zgureanu

    2011-02-01

    Full Text Available An information encryption system based on Boolean functions is proposed. Information processing is done using multidimensional matrices, performing logical operations with these matrices. At the basis of ensuring high level security of the system the complexity of solving the problem of building systems of Boolean functions that depend on many variables (tens and hundreds is set. Such systems represent the private key. It varies both during the encryption and decryption of information, and during the transition from one message to another.

  13. A Weakly Homomorphic Encryption with LDN

    Directory of Open Access Journals (Sweden)

    Chao Feng

    2014-06-01

    Full Text Available As an effective solution to protect the privacy of the data, homomorphic encryption has become a hot research topic. Existing homomorphic schemes are not truly practical due to their huge key size. In this paper, we present a simple weakly homomorphic encryption scheme using only elementary modular arithmetic over the integers rather than working with ideal lattices. Compared with DGHV’s construction, the proposed scheme has shorter public key and ciphertext size. The main appeal of our approach is the conceptual simplicity. We reduce the security of weakly homomorphic scheme to “learning divisor with noise (LDN”

  14. Multimedia encryption and authentication techniques and applications

    CERN Document Server

    Furht, Borko

    2006-01-01

    Intellectual property owners must continually exploit new ways of reproducing, distributing, and marketing their products. However, the threat of piracy looms as a major problem with digital distribution and storage technologies. Multimedia Encryption and Authentication Techniques and Applications covers current and future trends in the design of modern systems that use encryption and authentication to protect multimedia content. Containing the works of contributing authors who are worldwide experts in their fields, this volume is intended for researchers and practitioners, as well as for thos

  15. Photonic encryption using all optical logic.

    Energy Technology Data Exchange (ETDEWEB)

    Blansett, Ethan L.; Schroeppel, Richard Crabtree; Tang, Jason D.; Robertson, Perry J.; Vawter, Gregory Allen; Tarman, Thomas David; Pierson, Lyndon George

    2003-12-01

    With the build-out of large transport networks utilizing optical technologies, more and more capacity is being made available. Innovations in Dense Wave Division Multiplexing (DWDM) and the elimination of optical-electrical-optical conversions have brought on advances in communication speeds as we move into 10 Gigabit Ethernet and above. Of course, there is a need to encrypt data on these optical links as the data traverses public and private network backbones. Unfortunately, as the communications infrastructure becomes increasingly optical, advances in encryption (done electronically) have failed to keep up. This project examines the use of optical logic for implementing encryption in the photonic domain to achieve the requisite encryption rates. In order to realize photonic encryption designs, technology developed for electrical logic circuits must be translated to the photonic regime. This paper examines two classes of all optical logic (SEED, gain competition) and how each discrete logic element can be interconnected and cascaded to form an optical circuit. Because there is no known software that can model these devices at a circuit level, the functionality of the SEED and gain competition devices in an optical circuit were modeled in PSpice. PSpice allows modeling of the macro characteristics of the devices in context of a logic element as opposed to device level computational modeling. By representing light intensity as voltage, 'black box' models are generated that accurately represent the intensity response and logic levels in both technologies. By modeling the behavior at the systems level, one can incorporate systems design tools and a simulation environment to aid in the overall functional design. Each black box model of the SEED or gain competition device takes certain parameters (reflectance, intensity, input response), and models the optical ripple and time delay characteristics. These 'black box' models are interconnected and

  16. Multidimensional data encryption with digital holography

    Science.gov (United States)

    Yu, Lingfeng; Cai, Lilong

    2003-01-01

    A new method based on the concept of virtual optics for both encryption and decryption is proposed. It analyzes the potential reasons of the limitations of our earlier work and presents some new approach to improve the original algorithm. Different methods of numerical reconstruction for data encryption are compared, the limitations caused by off-axis setups are discussed, and the resolution of the decrypted image could be flexibly adjusted, which makes it possible to decrypt the image with virtually no loss of data. Numerical experiments are performed to validate the proposed method, and sensitivities of some parameters are quantitatively analyzed and illustrated.

  17. Verifiable Quantum Encryption and its Practical Applications

    Science.gov (United States)

    Shi, Run-hua

    2017-04-01

    In this paper, we present a novel verifiable quantum encryption scheme, in which a sender encrypts a classical plaintext into a quantum ciphertext, such that only a specified receiver can decrypt the ciphertext and further get the plaintext. This scheme can not only ensure the unconditional security of the plaintext, but can also verify the validness of the plaintext. In addition, we consider its practical applications with key reuse and further present a practical application protocol for secure two-party quantum scalar product.

  18. A Verifiable Secret Shuffle of Homomorphic Encryptions

    DEFF Research Database (Denmark)

    Groth, Jens

    2003-01-01

    We show how to prove in honest verifier zero-knowledge the correctness of a shuffle of homomorphic encryptions (or homomorphic commitments.) A shuffle consists in a rearrangement of the input ciphertexts and a reencryption of them so that the permutation is not revealed.......We show how to prove in honest verifier zero-knowledge the correctness of a shuffle of homomorphic encryptions (or homomorphic commitments.) A shuffle consists in a rearrangement of the input ciphertexts and a reencryption of them so that the permutation is not revealed....

  19. Encryption key distribution via chaos synchronization.

    Science.gov (United States)

    Keuninckx, Lars; Soriano, Miguel C; Fischer, Ingo; Mirasso, Claudio R; Nguimdo, Romain M; Van der Sande, Guy

    2017-02-24

    We present a novel encryption scheme, wherein an encryption key is generated by two distant complex nonlinear units, forced into synchronization by a chaotic driver. The concept is sufficiently generic to be implemented on either photonic, optoelectronic or electronic platforms. The method for generating the key bitstream from the chaotic signals is reconfigurable. Although derived from a deterministic process, the obtained bit series fulfill the randomness conditions as defined by the National Institute of Standards test suite. We demonstrate the feasibility of our concept on an electronic delay oscillator circuit and test the robustness against attacks using a state-of-the-art system identification method.

  20. Encryption key distribution via chaos synchronization

    Science.gov (United States)

    Keuninckx, Lars; Soriano, Miguel C.; Fischer, Ingo; Mirasso, Claudio R.; Nguimdo, Romain M.; Van der Sande, Guy

    2017-01-01

    We present a novel encryption scheme, wherein an encryption key is generated by two distant complex nonlinear units, forced into synchronization by a chaotic driver. The concept is sufficiently generic to be implemented on either photonic, optoelectronic or electronic platforms. The method for generating the key bitstream from the chaotic signals is reconfigurable. Although derived from a deterministic process, the obtained bit series fulfill the randomness conditions as defined by the National Institute of Standards test suite. We demonstrate the feasibility of our concept on an electronic delay oscillator circuit and test the robustness against attacks using a state-of-the-art system identification method. PMID:28233876

  1. Identification with Encrypted Biometric Data Made Feasible

    CERN Document Server

    Bringer, Julien; Kindarji, Bruno

    2009-01-01

    Biometrics make human identification possible with a sample of a biometric trait and an associated database. Classical identification techniques lead to privacy concerns. This paper introduces a new method to identify someone using his biometrics in an encrypted way. Our construction combines Bloom Filters with Storage and Locality-Sensitive Hashing. We apply this error-tolerant scheme, in a Hamming space, to achieve biometric identification in an efficient way. This is the first non-trivial identification scheme dealing with fuzziness and encrypted data.

  2. Watermarking patient data in encrypted medical images

    Indian Academy of Sciences (India)

    A Lavanya; V Natarajan

    2012-12-01

    In this paper, we propose a method for watermarking medical images for data integrity which consists of image encryption, data embedding and image-recovery phases. Data embedding can be completely recovered from the watermarked image after the watermark has been extracted. In the proposed method, we utilize standard stream cipher for image encryption and selecting non-region of interest tile to embed patient data. We show that the lower bound of the PSNR (peak-signal-to-noise-ratio) values for medical images is about 48 dB. Experimental results demonstrate that the proposed scheme can embed a large amount of data while keeping high visual quality of test images.

  3. Mobile agent技术在互联网信息检索应用的探讨%Application of Mobile Agent in the Information Retrieval of Internet

    Institute of Scientific and Technical Information of China (English)

    李虹

    2008-01-01

    本文在介绍了mobile agent技术概况的基础上,提出了基于mobile agent的并行互联网信息检索方式,并建立了一种基于mobile agent的并行信息检索的框架及流程.并对其未来发展提出了展望.

  4. Design and Simulation of Material-Integrated Distributed Sensor Processing with a Code-Based Agent Platform and Mobile Multi-Agent Systems

    Directory of Open Access Journals (Sweden)

    Stefan Bosse

    2015-02-01

    Full Text Available Multi-agent systems (MAS can be used for decentralized and self-organizing data processing in a distributed system, like a resource-constrained sensor network, enabling distributed information extraction, for example, based on pattern recognition and self-organization, by decomposing complex tasks in simpler cooperative agents. Reliable MAS-based data processing approaches can aid the material-integration of structural-monitoring applications, with agent processing platforms scaled to the microchip level. The agent behavior, based on a dynamic activity-transition graph (ATG model, is implemented with program code storing the control and the data state of an agent, which is novel. The program code can be modified by the agent itself using code morphing techniques and is capable of migrating in the network between nodes. The program code is a self-contained unit (a container and embeds the agent data, the initialization instructions and the ATG behavior implementation. The microchip agent processing platform used for the execution of the agent code is a standalone multi-core stack machine with a zero-operand instruction format, leading to a small-sized agent program code, low system complexity and high system performance. The agent processing is token-queue-based, similar to Petri-nets. The agent platform can be implemented in software, too, offering compatibility at the operational and code level, supporting agent processing in strong heterogeneous networks. In this work, the agent platform embedded in a large-scale distributed sensor network is simulated at the architectural level by using agent-based simulation techniques.

  5. Design and simulation of material-integrated distributed sensor processing with a code-based agent platform and mobile multi-agent systems.

    Science.gov (United States)

    Bosse, Stefan

    2015-02-16

    Multi-agent systems (MAS) can be used for decentralized and self-organizing data processing in a distributed system, like a resource-constrained sensor network, enabling distributed information extraction, for example, based on pattern recognition and self-organization, by decomposing complex tasks in simpler cooperative agents. Reliable MAS-based data processing approaches can aid the material-integration of structural-monitoring applications, with agent processing platforms scaled to the microchip level. The agent behavior, based on a dynamic activity-transition graph (ATG) model, is implemented with program code storing the control and the data state of an agent, which is novel. The program code can be modified by the agent itself using code morphing techniques and is capable of migrating in the network between nodes. The program code is a self-contained unit (a container) and embeds the agent data, the initialization instructions and the ATG behavior implementation. The microchip agent processing platform used for the execution of the agent code is a standalone multi-core stack machine with a zero-operand instruction format, leading to a small-sized agent program code, low system complexity and high system performance. The agent processing is token-queue-based, similar to Petri-nets. The agent platform can be implemented in software, too, offering compatibility at the operational and code level, supporting agent processing in strong heterogeneous networks. In this work, the agent platform embedded in a large-scale distributed sensor network is simulated at the architectural level by using agent-based simulation techniques.

  6. IPTV Service Framework Based on Secure Authentication and Lightweight Content Encryption for Screen-Migration in Cloud Computing

    Directory of Open Access Journals (Sweden)

    Aymen Abdullah Alsaffar

    2015-01-01

    Full Text Available These days, the advancing of smart devices (e.g. smart phones, tablets, PC, etc. capabilities and the increase of internet bandwidth enables IPTV service provider to extend their services to smart mobile devices. User can just receive their IPTV service using any smart devices by accessing the internet via wireless network from anywhere anytime in the world which is convenience for users. However, wireless network communication has well a known critical security threats and vulnerabilities to user smart devices and IPTV service such as user identity theft, reply attack, MIM attack, and so forth. A secure authentication for user devices and multimedia protection mechanism is necessary to protect both user devices and IPTV services. As result, we proposed framework of IPTV service based on secure authentication mechanism and lightweight content encryption method for screen-migration in Cloud computing. We used cryptographic nonce combined with user ID and password to authenticate user device in any mobile terminal they passes by. In addition we used Lightweight content encryption to protect and reduce the content decode overload at mobile terminals. Our proposed authentication mechanism reduces the computational processing by 30% comparing to other authentication mechanism and our lightweight content encryption reduces encryption delay to 0.259 second.

  7. Express analysis of explosives, chemical warfare agents and drugs with multicapillary column gas chromatography and ion mobility increment spectrometry.

    Science.gov (United States)

    Buryakov, Igor A

    2004-02-05

    Description of a gas chromatograph designed for express analysis of explosives (2,4-dinitrotoluene, 2,4,6-trinitrotoluene, pentaerythritol tetranitrate), chemical warfare agents (mustard gas, lewisite, sarin) and drugs (heroin, cocaine hydrochloride, crack) is given. The devices comprises a multicapillary chromatographic column and an ion mobility increment spectrometer (MCC-IMIS). The main analytical characteristics of an IMIS (estimated detection limit (DL), linear dynamic range (LDR), speed of response) and a chromatographic column (separation power, degree of separation, a number of possible peaks at a chromatogram section, divided by analysis time) are determined. The maximum value of DL equal to 5 pg/ml was registered for cis-alpha-LW, and the lowest one of 0.001 pg/ml was for cocaine. The maximum value of LDR equal to 1000 was registered for sarin and the lowest one of 150 was for the ions of lewisite. Speed of response of one compound detection with the IMIS was 0.7 s.

  8. An ElGamal Encryption Scheme of Adjacency Matrix and

    Directory of Open Access Journals (Sweden)

    B. Ravi Kumar

    2015-10-01

    Full Text Available  Cryptography is the combination of Mathematics and Computer science. Cryptography is used for encryption and decryption of data using mathematics. Cryptography transit the information in an illegible manner such that only intended recipient will be able to decrypt the information. In the recent years, researchers developed several new encryption methods. Among such ElGamal encryption is the one laid a concede platform for the researchers in Cryptography. Ever science several mathematical models were applied for encryption/decryption. In this paper, we introduced an ElGamal encryption, which uses points on the elliptic curve, and finite state machines and adjacency matrix.

  9. The experiments and analysis of several selective video encryption methods

    Science.gov (United States)

    Zhang, Yue; Yang, Cheng; Wang, Lei

    2013-07-01

    This paper presents four methods for selective video encryption based on the MPEG-2 video compression,including the slices, the I-frames, the motion vectors, and the DCT coefficients. We use the AES encryption method for simulation experiment for the four methods on VS2010 Platform, and compare the video effects and the processing speed of each frame after the video encrypted. The encryption depth can be arbitrarily selected, and design the encryption depth by using the double limit counting method, so the accuracy can be increased.

  10. Optical encryption using a joint transform correlator architecture

    Science.gov (United States)

    Nomura, Takanori; Javidi, Bahram

    2000-08-01

    An optical double random-phase encryption method using a joint transform correlator architecture is proposed. In this method, the joint power spectrum of the image to be encrypted and the key codes is recorded as the encrypted data. Unlike the case with classical double random-phase encryption, the same key code is used to both encrypt and decrypt the data, and the conjugate key is not required. Computer simulations and optical experimental results using a photorefractive-crystal-based processor are presented.

  11. Database security and encryption technology research and application

    Science.gov (United States)

    Zhu, Li-juan

    2013-03-01

    The main purpose of this paper is to discuss the current database information leakage problem, and discuss the important role played by the message encryption techniques in database security, As well as MD5 encryption technology principle and the use in the field of website or application. This article is divided into introduction, the overview of the MD5 encryption technology, the use of MD5 encryption technology and the final summary. In the field of requirements and application, this paper makes readers more detailed and clearly understood the principle, the importance in database security, and the use of MD5 encryption technology.

  12. Reversible Data Hiding In Encrypted Images by Reserving Room before Encryption

    Directory of Open Access Journals (Sweden)

    Harish G, Smitha Shekar B, Prajwal R, Sunil S Shetty

    2014-07-01

    Full Text Available Recently, more and more attention is paid to reversible data hiding (RDH in encrypted images, since it maintains the excellent property that the original cover can be losslessly recovered after embedded data is extracted while protecting the image content’s confidentiality. All previous methods embed data by reversibly vacating room from the encrypted images, which may subject to some errors on data extraction and/or image restoration. Here, a novel method is proposed so as to reserve room before encryption with a traditional RDH algorithm, and thus it is easy for the data hider to reversibly embed data in the encrypted image. The proposed method can achieve real reversibility, i.e., data extraction and image recovery are free of any error.

  13. QR code optical encryption using spatially incoherent illumination

    Science.gov (United States)

    Cheremkhin, P. A.; Krasnov, V. V.; Rodin, V. G.; Starikov, R. S.

    2017-02-01

    Optical encryption is an actively developing field of science. The majority of encryption techniques use coherent illumination and suffer from speckle noise, which severely limits their applicability. The spatially incoherent encryption technique does not have this drawback, but its effectiveness is dependent on the Fourier spectrum properties of the image to be encrypted. The application of a quick response (QR) code in the capacity of a data container solves this problem, and the embedded error correction code also enables errorless decryption. The optical encryption of digital information in the form of QR codes using spatially incoherent illumination was implemented experimentally. The encryption is based on the optical convolution of the image to be encrypted with the kinoform point spread function, which serves as an encryption key. Two liquid crystal spatial light modulators were used in the experimental setup for the QR code and the kinoform imaging, respectively. The quality of the encryption and decryption was analyzed in relation to the QR code size. Decryption was conducted digitally. The successful decryption of encrypted QR codes of up to 129  ×  129 pixels was demonstrated. A comparison with the coherent QR code encryption technique showed that the proposed technique has a signal-to-noise ratio that is at least two times higher.

  14. Image Encryption using chaos functions and fractal key

    Directory of Open Access Journals (Sweden)

    Houman Kashanian

    2016-09-01

    Full Text Available Many image in recent years are transmitted via internet and stored on it. Maintain the confidentiality of these data has become a major issue. So that encryption algorithms permit only authorized users to access data which is a proper solution to this problem.This paper presents a novel scheme for image encryption. At first, a two dimensional logistic mapping is applied to permutation relations between image pixels. We used a fractal image as an encryption key. Given that the chaotic mapping properties such as extreme sensitivity to initial values, random behavior, non-periodic, certainty and so on, we used theses mappings in order to select fractal key for encryption. Experimental results show that proposed algorithm to encrypt image has many features. Due to features such as large space key, low relations between the pixels of encrypted image, high sensitivity to key and high security, it can effectively protect the encrypted image security.

  15. An Efficient Receiver Deniable Encryption Scheme and Its Applications

    Directory of Open Access Journals (Sweden)

    Bo Meng

    2010-06-01

    Full Text Available Deniable encryption is an important cryptographic primitive, essential in all cryptographic protocols where a coercive adversary comes to play with high potential. Deniable encryption plays a key role in the internet/electronic voting, electronic bidding, electronic auctions and secure multiparty computation. In this study a practical efficient receiver deniable encryption scheme based on BCP commitment scheme and idea of Klonowski et al. is proposed. The proposed scheme is a one-move scheme without any pre-encryption information required to be sent between the sender and the receiver prior to encryption. Moreover, the overhead is low in term of the size of the ciphertext. At the same time we compare the typical deniable encryption schemes with our proposed scheme. Finally, applying the proposed deniable encryption, we originally give a coercion-resistant internet voting model without physical assumptions. We also compare the typical internet voting protocols with our proposed model.

  16. Optical double-image encryption and authentication by sparse representation.

    Science.gov (United States)

    Mohammed, Emad A; Saadon, H L

    2016-12-10

    An optical double-image encryption and authentication method by sparse representation is proposed. The information from double-image encryption can be integrated into a sparse representation. Unlike the traditional double-image encryption technique, only sparse (partial) data from the encrypted data is adopted for the authentication process. Simulation results demonstrate that the correct authentication results are achieved even with partial information from the encrypted data. The randomly selected sparse encrypted information will be used as an effective key for a security system. Therefore, the proposed method is feasible, effective, and can provide an additional security layer for optical security systems. In addition, the method also achieved the general requirements of storage and transmission due to a high reduction of the encrypted information.

  17. Complementary Metal-Oxide-Silicon (CMOS)-Memristor Hybrid Nanoelectronics for Advanced Encryption Standard (AES) Encryption

    Science.gov (United States)

    2016-04-01

    Encryption Standard (AES). This new hybrid CMOS/memristor technology will be available for future novel, emerging unconventional architecture with size...new encryption paradigms by changing the algorithm and building blocks that can fundamentally improve AES architecture and implementation. Thus, the...compatible HfO2 tool. Because of this, we have collaborated with Canon-Anelva ( Japan ), to deposit 15 nm of HfO2 on our M1 wafers by reactive sputtering. After

  18. A one-time pad encryption method combining full-phase image encryption and hiding

    Science.gov (United States)

    Li, Jiaosheng; Xiong, Jiaxiang; Zhang, Qinnan; Zhong, Liyun; Zhou, Yunfei; Li, Jun; Lu, Xiaoxu

    2017-08-01

    A one-time pad encryption method combining full-phase image encryption and hiding is proposed. Firstly, original images are encoded in the phase and encrypted by phase keys loaded on the phase-only liquid crystal spatial light modulator, where the phase keys can be distributed using a quantum key distribution method. Subsequently, a host image is introduced to produce a reference wave, and overlap with an object wave to form an interferogram. Finally, based on phase-shifting interferometry, we can achieve the above encrypted image hiding. Both the simulation and experiment research demonstrate the feasibility of the proposed method, meanwhile the key and the encrypted image can be changed randomly, so the proposed system reveals the high flexibility, anti-attack ability and can be used to implement the one-time pad to achieve absolute secure transmission with the quantum key distribution method. Moreover, system security will be improved due to the fact that encryption information hidden in the host image can be treated as background noise, which does not attract the attention of the attacker.

  19. Encrypting Binary Bits via Quantum Cryptography

    Institute of Scientific and Technical Information of China (English)

    ZENGGuihua

    2004-01-01

    A quantum cryptographic algorithm, which may be exploited to encrypt classic information is investigated theoretically in this paper. The proposed algorithm can prevent quantum attack strategy as well as classic attack strategy. A proof-in-principle of experimental demonstration, which exploits optical fibre communication technology and photon technology, is suggested.

  20. Anonymous Credential Schemes with Encrypted Attributes

    NARCIS (Netherlands)

    Guajardo Merchan, J.; Mennink, B.; Schoenmakers, B.

    2011-01-01

    In anonymous credential schemes, users obtain credentials on certain attributes from an issuer, and later show these credentials to a relying party anonymously and without fully disclosing the attributes. In this paper, we introduce the notion of (anonymous) credential schemes with encrypted attribu

  1. Comb to Pipeline: Fast Software Encryption Revisited

    DEFF Research Database (Denmark)

    Bogdanov, Andrey; Lauridsen, Martin Mehl; Tischhauser, Elmar Wolfgang

    2015-01-01

    AES-NI, or Advanced Encryption Standard New Instructions, is an extension of the x86 architecture proposed by Intel in 2008. With a pipelined implementation utilizing AES-NI, parallelizable modes such as AES-CTR become extremely efficient. However, out of the four non-trivial NIST-recommended enc...

  2. Optical encryption with selective computational ghost imaging

    Science.gov (United States)

    Zafari, Mohammad; kheradmand, Reza; Ahmadi-Kandjani, Sohrab

    2014-10-01

    Selective computational ghost imaging (SCGI) is a technique which enables the reconstruction of an N-pixel image from N measurements or less. In this paper we propose an optical encryption method based on SCGI and experimentally demonstrate that this method has much higher security under eavesdropping and unauthorized accesses compared with previous reported methods.

  3. Public-Key Encryption with Delegated Search

    NARCIS (Netherlands)

    Ibraimi, Luan; Nikova, Svetla; Hartel, Pieter; Jonker, Willem

    2011-01-01

    In public-key setting, Alice encrypts email with public key of Bob, so that only Bob will be able to learn contents of email. Consider scenario when computer of Alice is infected and unbeknown to Alice it also embeds malware into message. Bob's company, Carol, cannot scan his email for mali

  4. Perfectly secure encryption of individual sequences

    CERN Document Server

    Merhav, Neri

    2011-01-01

    In analogy to the well-known notion of finite--state compressibility of individual sequences, due to Lempel and Ziv, we define a similar notion of "finite-state encryptability" of an individual plaintext sequence, as the minimum asymptotic key rate that must be consumed by finite-state encrypters so as to guarantee perfect secrecy in a well-defined sense. Our main basic result is that the finite-state encryptability is equal to the finite-state compressibility for every individual sequence. This is in parallelism to Shannon's classical probabilistic counterpart result, asserting that the minimum required key rate is equal to the entropy rate of the source. However, the redundancy, defined as the gap between the upper bound (direct part) and the lower bound (converse part) in the encryption problem, turns out to decay at a different rate (in fact, much slower) than the analogous redundancy associated with the compression problem. We also extend our main theorem in several directions, allowing: (i) availability...

  5. Software encryption: new 64-bit block cryptoscheme

    Directory of Open Access Journals (Sweden)

    A. Moldovyan

    1997-01-01

    Full Text Available There are considered new fast software encryption function and some its cryptographical properties. It has been shown that the probability of the selection of two equivalent keys is very low. Crypto-robustness of this cipher has been evaluated on the basis of its probabilistic model.

  6. A Verifiable Secret Shuffle of Homomorphic Encryptions

    DEFF Research Database (Denmark)

    Groth, Jens

    2003-01-01

    We show how to prove in honest verifier zero-knowledge the correctness of a shuffle of homomorphic encryptions (or homomorphic commitments.) A shuffle consists in a rearrangement of the input ciphertexts and a reencryption of them so that the permutation is not revealed....

  7. Partial Encryption of Entropy-Coded Video Compression Using Coupled Chaotic Maps

    Directory of Open Access Journals (Sweden)

    Fadi Almasalha

    2014-10-01

    Full Text Available Due to pervasive communication infrastructures, a plethora of enabling technologies is being developed over mobile and wired networks. Among these, video streaming services over IP are the most challenging in terms of quality, real-time requirements and security. In this paper, we propose a novel scheme to efficiently secure variable length coded (VLC multimedia bit streams, such as H.264. It is based on code word error diffusion and variable size segment shuffling. The codeword diffusion and the shuffling mechanisms are based on random operations from a secure and computationally efficient chaos-based pseudo-random number generator. The proposed scheme is ubiquitous to the end users and can be deployed at any node in the network. It provides different levels of security, with encrypted data volume fluctuating between 5.5–17%. It works on the compressed bit stream without requiring any decoding. It provides excellent encryption speeds on different platforms, including mobile devices. It is 200% faster and 150% more power efficient when compared with AES software-based full encryption schemes. Regarding security, the scheme is robust to well-known attacks in the literature, such as brute force and known/chosen plain text attacks.

  8. PERFORMANCE EVALUATION OF MULTICRYPT ENCRYPTION MECHANISM

    Directory of Open Access Journals (Sweden)

    John Prakash Arockiasamy

    2012-01-01

    Full Text Available Multicast communication allows a single message packet to be routed to multiple nodes simultaneously. Membership in a multicast group is dynamic, allowing nodes to enter and leave the multicast session. Besides the benefits, multicast communication presents the challenge of securing the communication. In order to preserve confidentiality the general encryption mechanism used for point to point communications are used. A specific encryption mechanism rather a general one is needed to suit the multicast communication requirements wherein the life time of a secret key is very short and requires a frequent change. Moreover, the next generation wireless networks have very limited resources and need a light weight security mechanism. The proposed cipher, Multicrypt, is similar to the One Time Pad and Hill cipher based on a sub band coding scheme using the principle of Orthogonal Vectors. The proposed cipher is based on the assumption of Computational Diffie Hellman problem and insolvability of Hadamard conjecture. It is designed to have multiple keys to decrypt the message like asymmetric cryptosystem so that a (key compromise of a member would not lead to compromise of the entire system, less computational and communicational overheads, less storage complexity and there is no need for state-full members. This study also presents an extensive security analysis and the performance analysis with RSA, a public key encryption mechanism used to establish session keys. With the help of security analysis the study proves that brute force attack does not compromise the system. Multicrypt cryptosystem has the capability of dynamically adding and revoking members. The performance of Multicrypt is relatively better in terms of key setup time, encryption time, decryption time, encryption throughput and decryption throughput than RSA in the simulated setup. The proposed cipher is also proved to be secure against IND-CPA and IND-CCA attacks.

  9. FPGA BASED HARDWARE KEY FOR TEMPORAL ENCRYPTION

    Directory of Open Access Journals (Sweden)

    B. Lakshmi

    2010-09-01

    Full Text Available In this paper, a novel encryption scheme with time based key technique on an FPGA is presented. Time based key technique ensures right key to be entered at right time and hence, vulnerability of encryption through brute force attack is eliminated. Presently available encryption systems, suffer from Brute force attack and in such a case, the time taken for breaking a code depends on the system used for cryptanalysis. The proposed scheme provides an effective method in which the time is taken as the second dimension of the key so that the same system can defend against brute force attack more vigorously. In the proposed scheme, the key is rotated continuously and four bits are drawn from the key with their concatenated value representing the delay the system has to wait. This forms the time based key concept. Also the key based function selection from a pool of functions enhances the confusion and diffusion to defend against linear and differential attacks while the time factor inclusion makes the brute force attack nearly impossible. In the proposed scheme, the key scheduler is implemented on FPGA that generates the right key at right time intervals which is then connected to a NIOS – II processor (a virtual microcontroller which is brought out from Altera FPGA that communicates with the keys to the personal computer through JTAG (Joint Test Action Group communication and the computer is used to perform encryption (or decryption. In this case the FPGA serves as hardware key (dongle for data encryption (or decryption.

  10. Handheld and mobile hyperspectral imaging sensors for wide-area standoff detection of explosives and chemical warfare agents

    Science.gov (United States)

    Gomer, Nathaniel R.; Gardner, Charles W.; Nelson, Matthew P.

    2016-05-01

    Hyperspectral imaging (HSI) is a valuable tool for the investigation and analysis of targets in complex background with a high degree of autonomy. HSI is beneficial for the detection of threat materials on environmental surfaces, where the concentration of the target of interest is often very low and is typically found within complex scenery. Two HSI techniques that have proven to be valuable are Raman and shortwave infrared (SWIR) HSI. Unfortunately, current generation HSI systems have numerous size, weight, and power (SWaP) limitations that make their potential integration onto a handheld or field portable platform difficult. The systems that are field-portable do so by sacrificing system performance, typically by providing an inefficient area search rate, requiring close proximity to the target for screening, and/or eliminating the potential to conduct real-time measurements. To address these shortcomings, ChemImage Sensor Systems (CISS) is developing a variety of wide-field hyperspectral imaging systems. Raman HSI sensors are being developed to overcome two obstacles present in standard Raman detection systems: slow area search rate (due to small laser spot sizes) and lack of eye-safety. SWIR HSI sensors have been integrated into mobile, robot based platforms and handheld variants for the detection of explosives and chemical warfare agents (CWAs). In addition, the fusion of these two technologies into a single system has shown the feasibility of using both techniques concurrently to provide higher probability of detection and lower false alarm rates. This paper will provide background on Raman and SWIR HSI, discuss the applications for these techniques, and provide an overview of novel CISS HSI sensors focused on sensor design and detection results.

  11. A Secure Implementation of a Symmetric Encryption Algorithm in White-Box Attack Contexts

    Directory of Open Access Journals (Sweden)

    Yang Shi

    2013-01-01

    Full Text Available In a white-box context, an adversary has total visibility of the implementation of the cryptosystem and full control over its execution platform. As a countermeasure against the threat of key compromise in this context, a new secure implementation of the symmetric encryption algorithm SHARK is proposed. The general approach is to merge several steps of the round function of SHARK into table lookups, blended by randomly generated mixing bijections. We prove the soundness of the implementation of the algorithm and analyze its security and efficiency. The implementation can be used in web hosts, digital right management devices, and mobile devices such as tablets and smart phones. We explain how the design approach can be adapted to other symmetric encryption algorithms with a slight modification.

  12. An efficient and provably-secure certificateless public key encryption scheme for telecare medicine information systems.

    Science.gov (United States)

    Guo, Rui; Wen, Qiaoyan; Shi, Huixian; Jin, Zhengping; Zhang, Hua

    2013-10-01

    Telecare Medicine Information Systems (TMIS) promote the traditional medical and healthcare services by information and communication technology. Since the physician and caregiver can monitor the patient's physiological condition remotely in TMIS, the confidentiality of this sensitive data should be protected, which is the key issue in the Health Insurance Portability and Accountability Act. In this paper, we propose an efficient certificateless public key encryption scheme without bilinear pairing for TMIS. Our proposal is proved to be secure in the random oracle model under the hardness assumption of computational Diffie-Hellman problem. Moreover, after modifying the original model of the certificateless encryption, this scheme achieves Girault's trust level 3. Compared with the related protocols, the perform evaluations show that our scheme is more efficient and appropriate to collocate with low power mobile devices for TMIS.

  13. 基于Java语言的Mobile Agent实施方案%An Implementation Scheme of Mobile Agent Based on Java

    Institute of Scientific and Technical Information of China (English)

    杨晟; 魏海平; 吴兴

    2002-01-01

    与传统的分布式计算相比较,Mobile Agent模型无疑具有更广泛的发展前景.它采用面向对象的思想使Agent具有了类的一切特性.其中,事件驱动是Mobile Agent完成用户给定任务的根本保障.通常情况下,为了完成某项任务Agent要在网络(可能是异构网络)中频繁移动,而在移动过程中Agent又必须考虑自身及Agnet平台的安全问题,这些都对Mobile Agent的实现提出了更高的要求.Java语言由于其对移动代码的支持和高度的安全性使它成为开发Moblie Agnet的首选工具.以Java语言为基础,提出了Mobile Agent模型的一种可行性实施方案,并制定了相应的Mobile Agent模块,从而为Mobile Agent的实现开辟了新的途径.

  14. Attribute-Based Proxy Re-Encryption with Keyword Search

    Science.gov (United States)

    Shi, Yanfeng; Liu, Jiqiang; Han, Zhen; Zheng, Qingji; Zhang, Rui; Qiu, Shuo

    2014-01-01

    Keyword search on encrypted data allows one to issue the search token and conduct search operations on encrypted data while still preserving keyword privacy. In the present paper, we consider the keyword search problem further and introduce a novel notion called attribute-based proxy re-encryption with keyword search (), which introduces a promising feature: In addition to supporting keyword search on encrypted data, it enables data owners to delegate the keyword search capability to some other data users complying with the specific access control policy. To be specific, allows (i) the data owner to outsource his encrypted data to the cloud and then ask the cloud to conduct keyword search on outsourced encrypted data with the given search token, and (ii) the data owner to delegate other data users keyword search capability in the fine-grained access control manner through allowing the cloud to re-encrypted stored encrypted data with a re-encrypted data (embedding with some form of access control policy). We formalize the syntax and security definitions for , and propose two concrete constructions for : key-policy and ciphertext-policy . In the nutshell, our constructions can be treated as the integration of technologies in the fields of attribute-based cryptography and proxy re-encryption cryptography. PMID:25549257

  15. Securing mobile code.

    Energy Technology Data Exchange (ETDEWEB)

    Link, Hamilton E.; Schroeppel, Richard Crabtree; Neumann, William Douglas; Campbell, Philip LaRoche; Beaver, Cheryl Lynn; Pierson, Lyndon George; Anderson, William Erik

    2004-10-01

    If software is designed so that the software can issue functions that will move that software from one computing platform to another, then the software is said to be 'mobile'. There are two general areas of security problems associated with mobile code. The 'secure host' problem involves protecting the host from malicious mobile code. The 'secure mobile code' problem, on the other hand, involves protecting the code from malicious hosts. This report focuses on the latter problem. We have found three distinct camps of opinions regarding how to secure mobile code. There are those who believe special distributed hardware is necessary, those who believe special distributed software is necessary, and those who believe neither is necessary. We examine all three camps, with a focus on the third. In the distributed software camp we examine some commonly proposed techniques including Java, D'Agents and Flask. For the specialized hardware camp, we propose a cryptographic technique for 'tamper-proofing' code over a large portion of the software/hardware life cycle by careful modification of current architectures. This method culminates by decrypting/authenticating each instruction within a physically protected CPU, thereby protecting against subversion by malicious code. Our main focus is on the camp that believes that neither specialized software nor hardware is necessary. We concentrate on methods of code obfuscation to render an entire program or a data segment on which a program depends incomprehensible. The hope is to prevent or at least slow down reverse engineering efforts and to prevent goal-oriented attacks on the software and execution. The field of obfuscation is still in a state of development with the central problem being the lack of a basis for evaluating the protection schemes. We give a brief introduction to some of the main ideas in the field, followed by an in depth analysis of a technique called &apos

  16. 75 FR 43819 - Clarification of Grace Period for Encryption Registration Requirement

    Science.gov (United States)

    2010-07-27

    ... Encryption Registration Requirement AGENCY: Bureau of Industry and Security, Commerce. ACTION: Final rule; correcting amendments. SUMMARY: This rule clarifies the intent of the encryption registration requirement... encryption registration requirement for authorization under provisions of License Exception ENC, as codified...

  17. Application of Surfactant Micellar Solutions as Extractants and Mobile Phases for TLC-Determination of Purine Bases and Doping Agents in Biological Liquids

    Directory of Open Access Journals (Sweden)

    Daria Victorovna Yedamenko

    2015-04-01

    Full Text Available Separation of caffeine and its metabolites (theophylline and theobromine and doping agents (spironolactone, propranolol, and ephedrine and determination of caffeine in serum sample and propranolol and ephedrine in urine were studied on normal-phase thin layers (“Sorbfil-UV-254”. Aqueous organic solvents and aqueous micellar surfactant solutions were compared as the mobile phases for separation. The acceptable separation of purine bases and doping agents was achieved by micellar Thin Layer Chromatography and normal-phase Thin Layer Chromatography. Anionic surfactant solution with added 1-propanol was the best eluent as for caffeine, theophylline, and theobromine separation, as for doping agents. The best characteristics of caffeine extraction from serum, and propranolol and ephedrine from urine were achieved when micellar eluent based on non-ionic Tween-80 surfactant was used. DOI: http://dx.doi.org/10.17807/orbital.v7i1.632

  18. Meteosat Images Encryption based on AES and RSA Algorithms

    Directory of Open Access Journals (Sweden)

    Boukhatem Mohammed Belkaid

    2015-06-01

    Full Text Available Satellite image Security is playing a vital role in the field of communication system and Internet. This work is interested in securing transmission of Meteosat images on the Internet, in public or local networks. To enhance the security of Meteosat transmission in network communication, a hybrid encryption algorithm based on Advanced Encryption Standard (AES and Rivest Shamir Adleman (RSA algorithms is proposed. AES algorithm is used for data transmission because of its higher efficiency in block encryption and RSA algorithm is used for the encryption of the key of the AES because of its management advantages in key cipher. Our encryption system generates a unique password every new session of encryption. Cryptanalysis and various experiments have been carried out and the results were reported in this paper, which demonstrate the feasibility and flexibility of the proposed scheme.

  19. Image Encryption Using Differential Evolution Approach in Frequency Domain

    CERN Document Server

    Hassan, Maaly Awad S; 10.5121/sipij.2011.2105

    2011-01-01

    This paper presents a new effective method for image encryption which employs magnitude and phase manipulation using Differential Evolution (DE) approach. The novelty of this work lies in deploying the concept of keyed discrete Fourier transform (DFT) followed by DE operations for encryption purpose. To this end, a secret key is shared between both encryption and decryption sides. Firstly two dimensional (2-D) keyed discrete Fourier transform is carried out on the original image to be encrypted. Secondly crossover is performed between two components of the encrypted image, which are selected based on Linear Feedback Shift Register (LFSR) index generator. Similarly, keyed mutation is performed on the real parts of a certain components selected based on LFSR index generator. The LFSR index generator initializes it seed with the shared secret key to ensure the security of the resulting indices. The process shuffles the positions of image pixels. A new image encryption scheme based on the DE approach is developed...

  20. Digital Image Encryption Based On Multiple Chaotic Maps

    Directory of Open Access Journals (Sweden)

    Amir Houshang Arab Avval

    2016-01-01

    Full Text Available A novel and robust chaos-based digital image encryption is proposed. The present paper presents a cipher block image encryption using multiple chaotic maps to lead increased security. An image block is encrypted by the block-based permutation process and cipher block encryption process. In the proposed scheme, secret key includes nineteen control and initial conditions parameter of the four chaotic maps and the calculated key space is 2883. The effectiveness and security of the proposed encryption scheme has been performed using the histograms, correlation coefficients, information entropy, differential analysis, key space analysis, etc. It can be concluded that the proposed image encryption technique is a suitable choice for practical applications.

  1. Quantum Encryption Minimising Key Leakage under Known Plaintext Attacks

    DEFF Research Database (Denmark)

    Pedersen, Thomas Brochmann

    2006-01-01

    In this dissertation we show how, by using a quantum channel, we can get more unconditionally secret communication with a symmetric key under known plaintext attacks. In unconditionally secret encryption schemes the key is necessarily an expensive resource since it cannot safely be reused for more...... than one encryption. In classical cryptography an amount of key comparable to the amount of message is leaked at each encryption. Many assumptions and models have been proposed which allows to safely encrypt more message with the same amount of key. Most of the proposed models are, however, either...... unrealistic, or rely on unproven assumptions. In this dissertation we encrypt messages by using properties of quantum mechanics. This model is based on our current understanding of nature, and is therefore a realistic model for encryption. It has previously been shown that the quantum mechanical model allows...

  2. Image encryption using P-Fibonacci transform and decomposition

    Science.gov (United States)

    Zhou, Yicong; Panetta, Karen; Agaian, Sos; Chen, C. L. Philip

    2012-03-01

    Image encryption is an effective method to protect images or videos by transferring them into unrecognizable formats for different security purposes. To improve the security level of bit-plane decomposition based encryption approaches, this paper introduces a new image encryption algorithm by using a combination of parametric bit-plane decomposition along with bit-plane shuffling and resizing, pixel scrambling and data mapping. The algorithm utilizes the Fibonacci P-code for image bit-plane decomposition and the 2D P-Fibonacci transform for image encryption because they are parameter dependent. Any new or existing method can be used for shuffling the order of the bit-planes. Simulation analysis and comparisons are provided to demonstrate the algorithm's performance for image encryption. Security analysis shows the algorithm's ability against several common attacks. The algorithm can be used to encrypt images, biometrics and videos.

  3. Digital Image Encryption Scheme Based on Multiple Chaotic Systems

    Science.gov (United States)

    Abd El-Latif, Ahmed A.; Li, Li; Zhang, Tiejun; Wang, Ning; Song, Xianhua; Niu, Xiamu

    2012-06-01

    Image encryption is a challenging task due to the significant level of sophistication achieved by forgerers and other cybercriminals. Advanced encryption methods for secure transmission, storage, and retrieval of digital images are increasingly needed for a number of military, medical, homeland security, and other applications. In this paper, we introduce a new digital image encryption algorithm. The new algorithm employs multiple chaotic systems and cryptographic primitive operations within the encryption process, which are efficiently implemented on modern processors, and adopts round keys for encryption using a chaotic map. Experiments conducted show that the proposed algorithm possesses robust security features such as fairly uniform distribution, high sensitivity to both keys and plainimages, almost ideal entropy, and the ability to highly de-correlate adjacent pixels in the cipherimages. Furthermore, it has a large key space, which greatly increases its security for image encryption applications.

  4. Research on dynamic routing problems of mobile agent in Web search engine%Web搜索引擎中Mobile Agent动态路由问题研究

    Institute of Scientific and Technical Information of China (English)

    胡庆华

    2003-01-01

    随着Internet的发展,Web上大量、分布、动态的信息导致了"信息过载",传统搜索引擎面临严峻的挑战.目前对Mobile Agent系统的理论与应用研究已成为一个热点前沿课题.本文对Web搜索引擎中Mobile Agent动态路由问题进行了研究.

  5. Chaotic Image Encryption with Random Shuffling of Data

    OpenAIRE

    Aydos, Murat; Uğur, Alper

    2014-01-01

    Security of valuable multimedia contents such as images in personal photograph albums, electronic publishing, frames of multicast video conference can be achieved by image encryption. Secure transmission of these contents is required to be rapid, efficient and practical. Hence, image encryption process must be chosen not only to satisfy the security goals but also to fulfill these requirements. Due to the inadequacy and inefficiency of conventional text based information encryption methods, r...

  6. Chaotic substitution for highly autocorrelated data in encryption algorithm

    Science.gov (United States)

    Anees, Amir; Siddiqui, Adil Masood; Ahmed, Fawad

    2014-09-01

    This paper addresses the major drawback of substitution-box in highly auto-correlated data and proposes a novel chaotic substitution technique for encryption algorithm to sort the problem. Simulation results reveal that the overall strength of the proposed technique for encryption is much stronger than most of the existing encryption techniques. Furthermore, few statistical security analyses have also been done to show the strength of anticipated algorithm.

  7. Encryption in Chaotic Systems with Sinusoidal Excitations

    Directory of Open Access Journals (Sweden)

    G. Obregón-Pulido

    2014-01-01

    Full Text Available In this contribution an encryption method using a chaotic oscillator, excited by “n” sinusoidal signals, is presented. The chaotic oscillator is excited by a sum of “n” sinusoidal signals and a message. The objective is to encrypt such a message using the chaotic behavior and transmit it, and, as the chaotic system is perturbed by the sinusoidal signal, the transmission security could be increased due to the effect of such a perturbation. The procedure is based on the regulation theory and consider that the receiver knows the frequencies of the perturbing signal, with this considerations the algorithm estimates the excitation in such a way that the receiver can cancel out the perturbation and all the undesirable dynamics in order to produce only the message. In this way we consider that the security level is increased.

  8. Steganography and encrypting based on immunochemical systems.

    Science.gov (United States)

    Kim, Kyung-Woo; Bocharova, Vera; Halámek, Jan; Oh, Min-Kyu; Katz, Evgeny

    2011-05-01

    Steganography and encrypting were demonstrated with immuno-specific systems. IgG-proteins were used as invisible ink developed with complementary antibodies labeled with enzymes producing color spots. The information security was achieved by mixing the target protein-antigens used for the text encoding with masking proteins of similar composition but having different bioaffinity. Two different texts were simultaneously encoded by using two different encoding proteins in a mixture. Various encrypting techniques were exemplified with the immuno-systems used for the steganography. Future use of the developed approach for information protection and watermark-technology was proposed. Scaling down the encoded text to a micro-size is feasible with the use of nanotechnology. Copyright © 2010 Wiley Periodicals, Inc.

  9. Review: Image Encryption Using Chaos Based algorithms

    Directory of Open Access Journals (Sweden)

    Er. Ankita Gaur

    2014-03-01

    Full Text Available Due to the development in the field of network technology and multimedia applications, every minute thousands of messages which can be text, images, audios, videos are created and transmitted over wireless network. Improper delivery of the message may leads to the leakage of important information. So encryption is used to provide security. In last few years, variety of image encryption algorithms based on chaotic system has been proposed to protect image from unauthorized access. 1-D chaotic system using logistic maps has weak security, small key space and due to the floating of pixel values, some data lose occurs and proper decryption of image becomes impossible. In this paper different chaotic maps such as Arnold cat map, sine map, logistic map, tent map have been studied.

  10. Novel permutation measures for image encryption algorithms

    Science.gov (United States)

    Abd-El-Hafiz, Salwa K.; AbdElHaleem, Sherif H.; Radwan, Ahmed G.

    2016-10-01

    This paper proposes two measures for the evaluation of permutation techniques used in image encryption. First, a general mathematical framework for describing the permutation phase used in image encryption is presented. Using this framework, six different permutation techniques, based on chaotic and non-chaotic generators, are described. The two new measures are, then, introduced to evaluate the effectiveness of permutation techniques. These measures are (1) Percentage of Adjacent Pixels Count (PAPC) and (2) Distance Between Adjacent Pixels (DBAP). The proposed measures are used to evaluate and compare the six permutation techniques in different scenarios. The permutation techniques are applied on several standard images and the resulting scrambled images are analyzed. Moreover, the new measures are used to compare the permutation algorithms on different matrix sizes irrespective of the actual parameters used in each algorithm. The analysis results show that the proposed measures are good indicators of the effectiveness of the permutation technique.

  11. Broadcast encryption schemes based on RSA

    Institute of Scientific and Technical Information of China (English)

    MU Ning-bo; HU Yu-pu; OU Hai-wen

    2009-01-01

    Three broadcast schemes for small receiver set using the property of RSA modulus are presented. They can solve the problem of data redundancy when the size of receiver set is small. In the proposed schemes, the center uses one key to encrypt the message and can revoke authorization conveniently. Every authorized user only needs to store one decryption key of a constant size. Among these three schemes, the first one has indistinguishability against adaptive chosen ciphertext attack (IND-CCA2) secure, and any collusion of authorized users cannot produce a new decryption key but the sizes of encryption modulus and ciphertext are linear in the number of receivers. In the second scheme, the size of ciphertext is half of the first one and any two authorized users can produce a new decryption key, but the center can identify them using the traitor tracing algorithm. The third one is the most efficient but the center cannot identify the traitors exactly.

  12. Fault Analysis-based Logic Encryption (Preprint)

    Science.gov (United States)

    2013-11-01

    design industry is making it easy for rogue elements in the supply chain to pirate ICs, overbuild ICs, and insert hardware trojans . Due to supply...TERMS Hardware Trojan , Reverse Engineering, Logic Reconfiguration, Logic Obfuscation, Logic Encryption 16. SECURITY CLASSIFICATION OF: 17...industry is making it easy for rogue elements in the supply chain to pirate ICs, overbuild ICs, and insert hardware trojans . Due to supply chain

  13. ALGORITHM FOR IMAGE MIXING AND ENCRYPTION

    Directory of Open Access Journals (Sweden)

    Ayman M. Abdalla

    2013-04-01

    Full Text Available This new algorithm mixes two or more images of different types and sizes by employing a shuffling procedure combined with S-box substitution to perform lossless image encryption. This combines stream cipher with block cipher, on the byte level, in mixing the images. When this algorithm was implemented, empirical analysis using test images of different types and sizes showed that it is effective and resistant to attacks.

  14. Dynamic Threshold Public-Key Encryption

    OpenAIRE

    Delerablée, Cécile; Pointcheval, David

    2008-01-01

    The original publication is available at www.springerlink.com; International audience; This paper deals with threshold public-key encryption which allows a pool of players to decrypt a ciphertext if a given threshold of authorized players cooperate. We generalize this primitive to the dynamic setting, where any user can dynamically join the system, as a possible recipient; the sender can dynamically choose the authorized set of recipients, for each ciphertext; and the sender can dynamically s...

  15. Quantum Encryption Minimising Key Leakage under Known Plaintext Attacks

    DEFF Research Database (Denmark)

    Pedersen, Thomas Brochmann

    2006-01-01

    In this dissertation we show how, by using a quantum channel, we can get more unconditionally secret communication with a symmetric key under known plaintext attacks. In unconditionally secret encryption schemes the key is necessarily an expensive resource since it cannot safely be reused for more......, or interactive encryption schemes, where the interaction does not need to occur online. In our model we show that the amount of key leaked under a known plaintext attack can be made arbitrarily small even in non-interactive encryption schemes. We also give an encryption scheme where eavesdropping can be detected...

  16. A privacy-preserving parallel and homomorphic encryption scheme

    Science.gov (United States)

    Min, Zhaoe; Yang, Geng; Shi, Jingqi

    2017-04-01

    In order to protect data privacy whilst allowing efficient access to data in multi-nodes cloud environments, a parallel homomorphic encryption (PHE) scheme is proposed based on the additive homomorphism of the Paillier encryption algorithm. In this paper we propose a PHE algorithm, in which plaintext is divided into several blocks and blocks are encrypted with a parallel mode. Experiment results demonstrate that the encryption algorithm can reach a speed-up ratio at about 7.1 in the MapReduce environment with 16 cores and 4 nodes.

  17. Research on medical image encryption in telemedicine systems.

    Science.gov (United States)

    Dai, Yin; Wang, Huanzhen; Zhou, Zixia; Jin, Ziyi

    2016-04-29

    Recently, advances in computers and high-speed communication tools have led to enhancements in remote medical consultation research. Laws in some localities require hospitals to encrypt patient information (including images of the patient) before transferring the data over a network. Therefore, developing suitable encryption algorithms is quite important for modern medicine. This paper demonstrates a digital image encryption algorithm based on chaotic mapping, which uses the no-period and no-convergence properties of a chaotic sequence to create image chaos and pixel averaging. Then, the chaotic sequence is used to encrypt the image, thereby improving data security. With this method, the security of data and images can be improved.

  18. Synchronized chaotic phase masks for encrypting and decrypting images

    Science.gov (United States)

    Rueda, Edgar; Vera, Carlos A.; Rodríguez, Boris; Torroba, Roberto

    2008-12-01

    This paper presents an alternative to secure exchange of encrypted information through public open channels. Chaotic encryption introduces a security improvement by an efficient masking of the message with a chaotic signal. Message extraction by an authorized end user is done using a synchronization procedure, thus allowing a continuous change of the encrypting and decrypting keys. And optical implementation with a 4f optical encrypting architecture is suggested. Digital simulations, including the effects of missing data, corrupted data and noise addition are shown. These results proof the consistency of the proposal, and demonstrate a practical way to operate with it.

  19. Signal and reference wave dually encrypted digital holographic system

    Institute of Scientific and Technical Information of China (English)

    ZHU YiChao; ZHANG JiaSen; GONG QiHuang

    2008-01-01

    We propose a secure digital holographic system with signal and reference waves dually encrypted. Two random phase masks are used to encrypt the images in the input and the Fourier planes. The reference beam is phase encoded by another random phase mask. The encrypted image and the key are recorded by a CCD camera. The data can be processed or transferred directly by computer. We theoretically and experimentally demonstrate encryption and decryption of multiple images and the results show a high quality and good fault tolerance.

  20. Image encryption using high-dimension chaotic system

    Institute of Scientific and Technical Information of China (English)

    Sun Fu-Yan; Liu Shu-Tang; Lü Zong-Wang

    2007-01-01

    In recent years, the chaos based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption techniques. This paper proposes a new approach for image encryption based on a highdimensional chaotic map. The new scheme employs the Cat map to shuffle the positions, then to confuse the relationship between the cipher-image and the plain-image using the high-dimensional Lorenz chaotic map preprocessed. The results of experimental, statistical analysis and key space analysis show that the proposed image encryption scheme provides an efficient and secure way for real-time image encryption and transmission.

  1. Transparent Data Encryption- Solution for Security of Database Contents

    Directory of Open Access Journals (Sweden)

    Dr. Anwar Pasha Abdul Gafoor Deshmukh

    2011-03-01

    Full Text Available The present study deals with Transparent Data Encryption which is a technology used to solve the problems of security of data. Transparent Data Encryption means encrypting databases on hard disk and on any backup media. Present day global business environment presents numerous security threats and compliance challenges. To protect against data thefts and frauds we require security solutions that are transparent by design. Transparent Data Encryption provides transparent, standards-based security that protects data on the network, on disk and on backup media. It is easy and effective protection of stored data by transparently encrypting data. Transparent Data Encryption can be used to provide high levels of security to columns, table and tablespace that is database files stored on hard drives or floppy disks or CD’s, and other information that requires protection. It is the technology used by Microsoft SQL Server 2008 to encrypt database contents. The term encryption means the piece of information encoded in such a way that it can only be decoded read and understood by people for whom the information is intended. The study deals with ways to create Master Key, creation of certificate protected by the master key, creation of database master key and protection by the certificate and ways to set the database to use encryption in Microsoft SQL Server 2008.

  2. Dynamic Encryption Technology in Ad-hoc Networks

    Institute of Scientific and Technical Information of China (English)

    JIN Zhao-hui; WANG Shun-man; XU Kai; LIANG Qing

    2007-01-01

    A new dynamic encryption application in ad-hoc networks is proposed. The advantages of this method are its being able to use the previous ciphertext as a seed of a new encryption process, rendering the encryption process effective in all communication process by continuous dynamic key generation together with synchronization, and its capability to cut back on system bandages to a greater extent, which is valuable for the ad-hoc circumstance. In addition, the rationality and effectiveness of this novel encryption method have been verified by the test results.

  3. Triple Encrypted Holographic Storage and Digital Holographic System

    Institute of Scientific and Technical Information of China (English)

    ZHU Yi-Chao; ZHANG Jia-Sen; GONG Qi-Huang

    2008-01-01

    We propose a triple encrypted holographic memory containing a digital holographic system. The original image is encrypted using double random phase encryption and stored in a LiNbO3:Fe crystal with shift-multiplexing. Both the reference beams of the memory and the digital holographic system are random phase encoded. We theoretically and experimentally demonstrate the encryption and decryption of multiple images and the results show high quality and good fault tolerance. The total key length of this system is larger than 4.7×1033.

  4. New Security Results on Encrypted Key Exchange

    Energy Technology Data Exchange (ETDEWEB)

    Bresson, Emmanuel; Chevassut, Olivier; Pointcheval, David

    2003-12-15

    Schemes for encrypted key exchange are designed to provide two entities communicating over a public network, and sharing a (short) password only, with a session key to be used to achieve data integrity and/or message confidentiality. An example of a very efficient and ''elegant'' scheme for encrypted key exchange considered for standardization by the IEEE P1363 Standard working group is AuthA. This scheme was conjectured secure when the symmetric-encryption primitive is instantiated via either a cipher that closely behaves like an ''ideal cipher,'' or a mask generation function that is the product of the message with a hash of the password. While the security of this scheme in the former case has been recently proven, the latter case was still an open problem. For the first time we prove in this paper that this scheme is secure under the assumptions that the hash function closely behaves like a random oracle and that the computational Diffie-Hellman problem is difficult. Furthermore, since Denial-of-Service (DoS) attacks have become a common threat we enhance AuthA with a mechanism to protect against them.

  5. Key exchange using biometric identity based encryption for sharing encrypted data in cloud environment

    Science.gov (United States)

    Hassan, Waleed K.; Al-Assam, Hisham

    2017-05-01

    The main problem associated with using symmetric/ asymmetric keys is how to securely store and exchange the keys between the parties over open networks particularly in the open environment such as cloud computing. Public Key Infrastructure (PKI) have been providing a practical solution for session key exchange for loads of web services. The key limitation of PKI solution is not only the need for a trusted third partly (e.g. certificate authority) but also the absent link between data owner and the encryption keys. The latter is arguably more important where accessing data needs to be linked with identify of the owner. Currently available key exchange protocols depend on using trusted couriers or secure channels, which can be subject to man-in-the-middle attack and various other attacks. This paper proposes a new protocol for Key Exchange using Biometric Identity Based Encryption (KE-BIBE) that enables parties to securely exchange cryptographic keys even an adversary is monitoring the communication channel between the parties. The proposed protocol combines biometrics with IBE in order to provide a secure way to access symmetric keys based on the identity of the users in unsecure environment. In the KE-BIOBE protocol, the message is first encrypted by the data owner using a traditional symmetric key before migrating it to a cloud storage. The symmetric key is then encrypted using public biometrics of the users selected by data owner to decrypt the message based on Fuzzy Identity-Based Encryption. Only the selected users will be able to decrypt the message by providing a fresh sample of their biometric data. The paper argues that the proposed solution eliminates the needs for a key distribution centre in traditional cryptography. It will also give data owner the power of finegrained sharing of encrypted data by control who can access their data.

  6. CHAOS-BASED ADVANCED ENCRYPTION STANDARD

    KAUST Repository

    Abdulwahed, Naif B.

    2013-05-01

    This thesis introduces a new chaos-based Advanced Encryption Standard (AES). The AES is a well-known encryption algorithm that was standardized by U.S National Institute of Standard and Technology (NIST) in 2001. The thesis investigates and explores the behavior of the AES algorithm by replacing two of its original modules, namely the S-Box and the Key Schedule, with two other chaos- based modules. Three chaos systems are considered in designing the new modules which are Lorenz system with multiplication nonlinearity, Chen system with sign modules nonlinearity, and 1D multiscroll system with stair case nonlinearity. The three systems are evaluated on their sensitivity to initial conditions and as Pseudo Random Number Generators (PRNG) after applying a post-processing technique to their output then performing NIST SP. 800-22 statistical tests. The thesis presents a hardware implementation of dynamic S-Boxes for AES that are populated using the three chaos systems. Moreover, a full MATLAB package to analyze the chaos generated S-Boxes based on graphical analysis, Walsh-Hadamard spectrum analysis, and image encryption analysis is developed. Although these S-Boxes are dynamic, meaning they are regenerated whenever the encryption key is changed, the analysis results show that such S-Boxes exhibit good properties like the Strict Avalanche Criterion (SAC) and the nonlinearity and in the application of image encryption. Furthermore, the thesis presents a new Lorenz-chaos-based key expansion for the AES. Many researchers have pointed out that there are some defects in the original key expansion of AES and thus have motivated such chaos-based key expansion proposal. The new proposed key schedule is analyzed and assessed in terms of confusion and diffusion by performing the frequency and SAC test respectively. The obtained results show that the new proposed design is more secure than the original AES key schedule and other proposed designs in the literature. The proposed

  7. The Application of Fuzzy Logic Controller to Compute a Trust Level for Mobile Agents in a Smart Home

    NARCIS (Netherlands)

    Nasution, S.; Suryana, N.; Shahib, S.; Abu, N.A.; Hartel, P.H.; Gómez Chova, L.; Martí Belenguer, D.; Candel Torres, I.

    2009-01-01

    Agents that travel through many hosts may cause a threat on the security of the visited hosts. Assets, system resources, and the reputation of the host are few possible targets for such an attack. The possibility for multi-hop agents to be malicious is higher compared to the one-hop or two-hop boome

  8. Android oriented deniable and transparent encryption system%面向Android的可否认透明加密系统

    Institute of Scientific and Technical Information of China (English)

    高慧; 郭宪勇

    2016-01-01

    To strengthen the data security on Android,and to solve the problem that data encryption mechanisms can not effec-tively resist malicious attacks and intimidation maid attack,by hiding the encrypt data on the mobile device volume and filling random noise within the encryption key,a deniable and transparent encryption data security system based on the hidden volume was proposed.Key implementation technologies and several schemes of security analyses and performance tests on prototype sys-tem were introduced.The result shows that the prototype system can protect data security effectively.%为加强Android数据安全,针对数据加密机制不能有效抵制恶意女佣攻击和胁迫攻击问题,通过隐藏移动设备上加密数据卷与填充随机噪声方法隐藏加密密钥,提出一种基于隐藏卷的可否认的透明加密数据安全系统.给出原形设计关键技术,安全性分析及性能测试结果表明,原型系统可有效保护数据安全.

  9. Fault Tolerant Approach for Data Encryption and Digital Signature Based on ECC System

    Institute of Scientific and Technical Information of China (English)

    ZENG Yong; MA Jian-feng

    2005-01-01

    An integrated fault tolerant approach for data encryption and digital signature based on elliptic curve cryptography is proposed. This approach allows the receiver to verify the sender's identity and can simultaneously deal with error detection and data correction. Up to three errors in our approach can be detected and corrected. This approach has at least the same security as that based on RSA system, but smaller keys to achieve the same level of security. Our approach is more efficient than the known ones and more suited for limited environments like personal digital assistants (PDAs), mobile phones and smart cards without RSA co- processors.

  10. A novel chaotic encryption scheme based on arithmetic coding

    Energy Technology Data Exchange (ETDEWEB)

    Mi Bo [Department of Computer Science and Engineering, Chongqing University, Chongqing 400044 (China)], E-mail: mi_bo@163.com; Liao Xiaofeng; Chen Yong [Department of Computer Science and Engineering, Chongqing University, Chongqing 400044 (China)

    2008-12-15

    In this paper, under the combination of arithmetic coding and logistic map, a novel chaotic encryption scheme is presented. The plaintexts are encrypted and compressed by using an arithmetic coder whose mapping intervals are changed irregularly according to a keystream derived from chaotic map and plaintext. Performance and security of the scheme are also studied experimentally and theoretically in detail.

  11. Chaos-Based Simultaneous Compression and Encryption for Hadoop

    Science.gov (United States)

    Zakaria, Nordin

    2017-01-01

    Data compression and encryption are key components of commonly deployed platforms such as Hadoop. Numerous data compression and encryption tools are presently available on such platforms and the tools are characteristically applied in sequence, i.e., compression followed by encryption or encryption followed by compression. This paper focuses on the open-source Hadoop framework and proposes a data storage method that efficiently couples data compression with encryption. A simultaneous compression and encryption scheme is introduced that addresses an important implementation issue of source coding based on Tent Map and Piece-wise Linear Chaotic Map (PWLM), which is the infinite precision of real numbers that result from their long products. The approach proposed here solves the implementation issue by removing fractional components that are generated by the long products of real numbers. Moreover, it incorporates a stealth key that performs a cyclic shift in PWLM without compromising compression capabilities. In addition, the proposed approach implements a masking pseudorandom keystream that enhances encryption quality. The proposed algorithm demonstrated a congruent fit within the Hadoop framework, providing robust encryption security and compression. PMID:28072850

  12. Application of Cosine Zone Plates to Image Encryption

    Institute of Scientific and Technical Information of China (English)

    GE Fan; CHEN Lin-Fei; ZHAO Dao-Mu

    2008-01-01

    @@ We analyse the diffraction result of optical field after Cosine zone plate, and theoretically deduce its transform matrix. Under some conditions, its diffraction distribution is a mixture of fractional Fourier spectra. Then we use Cosine zone plate and its diffraction result to image encryption. Possible optical image encryption and decryption implementations are proposed, and some numerical simulation results are also provided.

  13. Ciphertext-Policy Attribute-Based Broadcast Encryption Scheme

    NARCIS (Netherlands)

    Asim, Muhammad; Ibraimi, Luan; Petkovic, Milan

    2011-01-01

    In this work, we design a new attribute-based encryption scheme with the revocation capability. In the proposed schemes, the user (broadcaster) encrypts the data according to an access policy over the set of attributes, and a list of the identities of revoked users. Only recipients who have attribut

  14. Chaos-Based Simultaneous Compression and Encryption for Hadoop.

    Science.gov (United States)

    Usama, Muhammad; Zakaria, Nordin

    2017-01-01

    Data compression and encryption are key components of commonly deployed platforms such as Hadoop. Numerous data compression and encryption tools are presently available on such platforms and the tools are characteristically applied in sequence, i.e., compression followed by encryption or encryption followed by compression. This paper focuses on the open-source Hadoop framework and proposes a data storage method that efficiently couples data compression with encryption. A simultaneous compression and encryption scheme is introduced that addresses an important implementation issue of source coding based on Tent Map and Piece-wise Linear Chaotic Map (PWLM), which is the infinite precision of real numbers that result from their long products. The approach proposed here solves the implementation issue by removing fractional components that are generated by the long products of real numbers. Moreover, it incorporates a stealth key that performs a cyclic shift in PWLM without compromising compression capabilities. In addition, the proposed approach implements a masking pseudorandom keystream that enhances encryption quality. The proposed algorithm demonstrated a congruent fit within the Hadoop framework, providing robust encryption security and compression.

  15. Single-random-phase holographic encryption of images

    Science.gov (United States)

    Tsang, P. W. M.

    2017-02-01

    In this paper, a method is proposed for encrypting an optical image onto a phase-only hologram, utilizing a single random phase mask as the private encryption key. The encryption process can be divided into 3 stages. First the source image to be encrypted is scaled in size, and pasted onto an arbitrary position in a larger global image. The remaining areas of the global image that are not occupied by the source image could be filled with randomly generated contents. As such, the global image as a whole is very different from the source image, but at the same time the visual quality of the source image is preserved. Second, a digital Fresnel hologram is generated from the new image, and converted into a phase-only hologram based on bi-directional error diffusion. In the final stage, a fixed random phase mask is added to the phase-only hologram as the private encryption key. In the decryption process, the global image together with the source image it contained, can be reconstructed from the phase-only hologram if it is overlaid with the correct decryption key. The proposed method is highly resistant to different forms of Plain-Text-Attacks, which are commonly used to deduce the encryption key in existing holographic encryption process. In addition, both the encryption and the decryption processes are simple and easy to implement.

  16. Identity-based Encryption with Non-Interactive Opening

    Institute of Scientific and Technical Information of China (English)

    FAN Jia; TANG Xiao-hu; KANG Li; LU Xian-hui

    2008-01-01

    An identity-based encryption (IBE) was studied with non-interactively opening property that the plain text of a ciphertext can be revealed without affecting the security of the encryption system.Two kinds of non-interactive opening properties for IBE schemes were defined along with a concrete scheme in each case.

  17. An Inexpensive Device for Teaching Public Key Encryption

    Science.gov (United States)

    Pendegraft, Norman

    2009-01-01

    An inexpensive device to assist in teaching the main ideas of Public Key encryption and its use in class to illustrate the operation of public key encryption is described. It illustrates that there are two keys, and is particularly useful for illustrating that privacy is achieved by using the public key. Initial data from in class use seem to…

  18. Sound Computational Interpretation of Formal Encryption with Composed Keys

    NARCIS (Netherlands)

    Laud, P.; Corin, R.J.

    2003-01-01

    Song, Wagner and Perrig have published a theoretical paper about keyword search on encrypted textual data. We describe a prototype implementing their theory. Tests are carried out with this prototype to analyse efficiency and timing aspects. As expected encryption and search times are linear in the

  19. Stego Optical Encryption Based on Chaotic Baker's Map Transformation

    Science.gov (United States)

    Hussain, Iqtadar; Gondal, Muhammad Asif

    2014-06-01

    In this article, an optical image encryption algorithm based on chaotic baker's map is presented. The stego-image is encrypted with the help of double random phase encoding algorithm and then produced disorder with the help of chaotic transformation. Security test shows that the reading of proposed algorithm is very close to the optimal values.

  20. General Impossibility of Group Homomorphic Encryption in the Quantum World

    NARCIS (Netherlands)

    Armknecht, Frederik; Gagliardoni, Tommaso; Katzenbeisser, Stefan; Peter, Andreas

    2014-01-01

    Group homomorphic encryption represents one of the most important building blocks in modern cryptography. It forms the basis of widely-used, more sophisticated primitives, such as CCA2-secure encryption or secure multiparty computation. Unfortunately, recent advances in quantum computation show that