Abstract: In order to electronically exchange information between network users in the web of data, different software such as outlook is presented. So, the traffic of users on a site or even the floors of a building can be decreased as a result of applying a secure and reliable data sharing software. It is essential to provide a fast, secure and reliable network system in the data sharing webs to create an advanced communication systems in the users of network. In the present research work, different encoding methods and algorithms in data sharing systems is studied in order to increase security of data sharing systems by preventing the access of hackers to the transferred data. To increase security in the networks, the possibility of textual conversation between customers of a local network is studied. Application of the encryption and decryption algorithms is studied in order to increase security in networks by preventing hackers from infiltrating. As a result, a reliable and secure communication system between members of a network can be provided by preventing additional traffic in the website environment in order to increase speed, accuracy and security in the network and web systems of data sharing.
Abstract: Quantum cryptography is described as a point-to-point secure key generation technology that has emerged in recent times in providing absolute security. Researchers have started studying new innovative approaches to exploit the security of Quantum Key Distribution (QKD) for a large-scale communication system. A number of approaches and models for utilization of QKD for secure communication have been developed. The uncertainty principle in quantum mechanics created a new paradigm for QKD. One of the approaches for use of QKD involved network fashioned security. The main goal was point-to-point Quantum network that exploited QKD technology for end-to-end network security via high speed QKD. Other approaches and models equipped with QKD in network fashion are introduced in the literature as. A different approach that this paper deals with is using QKD in existing protocols, which are widely used on the Internet to enhance security with main objective of unconditional security. Our work is towards the analysis of the QKD in Mobile ad-hoc network (MANET).
Abstract: In the field of quantum secure communication, there
is no evaluation that characterizes quantum secure communication
(QSC) protocols in a complete, general manner. The current paper
addresses the problem concerning the lack of such an evaluation
for QSC protocols by introducing an optimality evaluation, which
is expressed as the average over the three main parameters of QSC
protocols: efficiency, security, and practicality. For the efficiency
evaluation, the common expression of this parameter is used, which
incorporates all the classical and quantum resources (bits and qubits)
utilized for transferring a certain amount of information (bits) in a
secure manner. By using criteria approach whether or not certain
criteria are met, an expression for the practicality evaluation is
presented, which accounts for the complexity of the QSC practical
realization. Based on the error rates that the common quantum attacks
(Measurement and resend, Intercept and resend, probe attack, and
entanglement swapping attack) induce, the security evaluation for
a QSC protocol is proposed as the minimum function taken over
the error rates of the mentioned quantum attacks. For the sake of
clarity, an example is presented in order to show how the optimality
is calculated.
Abstract: Inter-agent communication manager facilitates communication among mobile agents via message passing mechanism. Until now, all Foundation for Intelligent Physical Agents (FIPA) compliant agent systems are capable of exchanging messages following the standard format of sending and receiving messages. Previous works tend to secure messages to be exchanged among a community of collaborative agents commissioned to perform specific tasks using cryptosystems. However, the approach is characterized by computational complexity due to the encryption and decryption processes required at the two ends. The proposed approach to secure agent communication allows only agents that are created by the host agent server to communicate via the agent communication channel provided by the host agent platform. These agents are assumed to be harmless. Therefore, to secure communication of legitimate agents from intrusion by external agents, a 2-phase policy enforcement system was developed. The first phase constrains the external agent to run only on the network server while the second phase confines the activities of the external agent to its execution environment. To implement the proposed policy, a controller agent was charged with the task of screening any external agent entering the local area network and preventing it from migrating to the agent execution host where the legitimate agents are running. On arrival of the external agent at the host network server, an introspector agent was charged to monitor and restrain its activities. This approach secures legitimate agent communication from Man-in-the Middle and Replay attacks.
Abstract: Security of the smart home in terms of behavior activity pattern recognition is a totally dissimilar and unique issue as compared to the security issues of other scenarios. Sensor devices (low capacity and high capacity) interact and negotiate each other by detecting the daily behavior activity of individuals to execute common tasks. Once a device (e.g., surveillance camera, smart phone and light detection sensor etc.) is compromised, an adversary can then get access to a specific device and can damage daily behavior activity by altering the data and commands. In this scenario, a group of common instruction processes may get involved to generate deadlock. Therefore, an effective suitable security solution is required for smart home architecture. This paper proposes seamless distributed Scheme which fortifies low computational wireless devices for secure communication. Proposed scheme is based on lightweight key-session process to upheld cryptic-link for trajectory by recognizing of individual’s behavior activities pattern. Every device and service provider unit (low capacity sensors (LCS) and high capacity sensors (HCS)) uses an authentication token and originates a secure trajectory connection in network. Analysis of experiments is revealed that proposed scheme strengthens the devices against device seizure attack by recognizing daily behavior activities, minimum utilization memory space of LCS and avoids network from deadlock. Additionally, the results of a comparison with other schemes indicate that scheme manages efficiency in term of computation and communication.
Abstract: This paper presents a method for determining all of the co-prime right angle triangles in the Euclidean field by looking at the intersection of the Pythagorean and Platonic right angle triangles and the corresponding lattice that this produces. The co-prime properties of each lattice point representing a unique right angle triangle are then considered. This paper proposes a conjunction between these two ancient disparaging theorists. This work has wide applications in information security where cryptography involves improved ways of finding tuples of prime numbers for secure communication systems. In particular, this paper has direct impact in enhancing the encryption and decryption algorithms in cryptography.
Abstract: A digital signature is an electronic signature form used by an original signer to sign a specific document. When the original signer is not in his office or when he/she travels outside, he/she delegates his signing capability to a proxy signer and then the proxy signer generates a signing message on behalf of the original signer. The two parties must be able to authenticate one another and agree on a secret encryption key, in order to communicate securely over an unreliable public network. Authenticated key agreement protocols have an important role in building a secure communications network between the two parties. In this paper, we present a secure proxy signature scheme over an efficient and secure authenticated key agreement protocol based on factoring and discrete logarithm problem.
Abstract: Proxy signature scheme permits an original signer to delegate his/her signing capability to a proxy signer, and then the proxy signer generates a signing message on behalf of the original signer. The two parties must be able to authenticate one another and agree on a secret encryption key, in order to communicate securely over an unreliable public network. Authenticated key agreement protocols have an important role in building secure communications network between the two parties. In this paper, we present a secure proxy signature scheme over an efficient and secure authenticated key agreement protocol based on the discrete logarithm problem.
Abstract: Fault tolerance and data security are two important issues in modern communication systems. During the transmission of data between the sender and receiver, errors may occur frequently. Therefore, the sender must re-transmit the data to the receiver in order to correct these errors, which makes the system very feeble. To improve the scalability of the scheme, we present a proxy signature scheme with fault tolerance over an efficient and secure authenticated key agreement protocol based on the improved RSA system. Authenticated key agreement protocols have an important role in building a secure communications network between the two parties.
Abstract: Due to the rapid growth in modern communication systems, fault tolerance and data security are two important issues in a secure transaction. During the transmission of data between the sender and receiver, errors may occur frequently. Therefore, the sender must re-transmit the data to the receiver in order to correct these errors, which makes the system very feeble. To improve the scalability of the scheme, we present a secure proxy signature scheme with fault tolerance over an efficient and secure authenticated key agreement protocol based on RSA system. Authenticated key agreement protocols have an important role in building a secure communications network between the two parties.
Abstract: We present a method to set up system functions
through a near filed communication (NFC) of a smartphone. The
short communication distance of the NFC which is usually less
than 4 cm could prevent any interferences from other devices and
establish a secure communication channel between a system and the
smartphone. The proposed set-up method for system function values
is demonstrated for a blacbox system in a car. In demonstration,
system functions of a blackbox which is manipulated through NFC
of a smartphone are controls of image quality, sound level, shock
sensing level to store images, etc. The proposed set-up method for
system function values can be used for any devices with NFC.
Abstract: Vehicular Ad hoc NETwork (VANET) is a kind of Mobile Ad hoc NETwork (MANET). It allows the vehicles to communicate with one another as well as with nearby Road Side Units (RSU) and Regional Trusted Authorities (RTA). Vehicles communicate through On-Board Units (OBU) in which privacy has to be assured which will avoid the misuse of private data. A secure authentication framework for VANETs is proposed in which Public Key Cryptography (PKC) based adaptive pseudonym scheme is used to generate self-generated pseudonyms. Self-generated pseudonyms are used instead of real IDs for privacy preservation and non-repudiation. The ID-Based Signature (IBS) and ID-Based Online/Offline Signature (IBOOS) schemes are used for authentication. IBS is used to authenticate between vehicle and RSU whereas IBOOS provides authentication among vehicles. Security attacks like impersonation attack in the network are resolved and the attacking nodes are rejected from the network, thereby ensuring secure communication among the vehicles in the network. Simulation results shows that the proposed system provides better authentication in VANET environment.
Abstract: Establishing a secure communication of Internet
conferences for participants is very important. Before starting the
conference, all the participants establish a common conference key to
encrypt/decrypt communicated messages. It enables participants to
exchange the secure messages. Nevertheless, in the conference, if
there are any malicious participants who may try to upset the key
generation process causing other legal participants to obtain a different
conference key. In this article, we propose an improved conference
key agreement with fault-tolerant capability. The proposed scheme
can filter malicious participants at the beginning of the conference to
ensure that all participants obtain the same conference key. Compare
with other schemes, our scheme is more secure and efficient than
others.
Abstract: Intrabody communication (IBC) is a new way of transferring data using human body as a medium. Minute current can travel though human body without any harm. IBC can remove electrical wires for human area network. IBC can be also a secure communication network system unlike wireless networks which can be accessed by anyone with bad intentions. One of the IBC systems is based on frequency shift keying modulation where individual data are transmitted to the external devices for the purpose of secure access such as digital door lock. It was found that the quality of IBC data transmission was heavily dependent on ground configurations of electronic circuits. Reliable IBC transmissions were not possible when both of the transmitter and receiver used batteries as circuit power source. Transmission was reliable when power supplies were used as power source for both transmitting and receiving sites because the common ground was established through the grounds of instruments such as power supply and oscilloscope. This was due to transmission dipole size and the ground effects of floor and AC power line. If one site used battery as power source and the other site used the AC power as circuit power source, transmission was possible.
Abstract: In this study, we propose the chaotic cipher combined with Mersenne Twister that is an extremely good pseudo-random number generator for the secure communications. We investigate the Lyapunov exponent of the proposed system, and evaluate the randomness performance by comparing RC4 and the chaotic cipher. In these results, our proposed system gets high chaotic property and more randomness than the conventional ciphers.
Abstract: In this paper, we use Generalized Hamiltonian systems approach to synchronize a modified sixth-order Chua's circuit, which generates hyperchaotic dynamics. Synchronization is obtained between the master and slave dynamics with the slave being given by an observer. We apply this approach to transmit private information (analog and binary), while the encoding remains potentially secure.
Abstract: The design of chaos-based secure communication
via synchronized modified Chua-s systems is investigated in
this paper. A continuous control law is proposed to ensure
synchronization of the master and slave modified Chua-s
systems by using the variable structure control technique.
Particularly, the concept of extended systems is introduced
such that a continuous control input is obtained to avoid
chattering phenomenon. Then, it becomes possible to ensure
that the message signal embedded in the transmitter can be
recovered in the receiver.
Abstract: In order to guarantee secure communication for wireless sensor networks (WSNs), many user authentication schemes have successfully drawn researchers- attention and been studied widely. In 2012, He et al. proposed a robust biometric-based user authentication scheme for WSNs. However, this paper demonstrates that He et al.-s scheme has some drawbacks: poor reparability problem, user impersonation attack, and sensor node impersonate attack.
Abstract: Reliable secure multicast communication in mobile
adhoc networks is challenging due to its inherent characteristics of
infrastructure-less architecture with lack of central authority, high
packet loss rates and limited resources such as bandwidth, time and
power. Many emerging commercial and military applications require
secure multicast communication in adhoc environments. Hence key
management is the fundamental challenge in achieving reliable
secure communication using multicast key distribution for mobile
adhoc networks. Thus in designing a reliable multicast key
distribution scheme, reliability and congestion control over
throughput are essential components. This paper proposes and
evaluates the performance of an enhanced optimized multicast cluster
tree algorithm with destination sequenced distance vector routing
protocol to provide reliable multicast key distribution. Simulation
results in NS2 accurately predict the performance of proposed
scheme in terms of key delivery ratio and packet loss rate under
varying network conditions. This proposed scheme achieves
reliability, while exhibiting low packet loss rate with high key
delivery ratio compared with the existing scheme.
Abstract: In this paper, a two-channel secure communication
using fractional chaotic systems is presented. Conditions for chaos
synchronization have been investigated theoretically by using Laplace
transform. To illustrate the effectiveness of the proposed scheme, a
numerical example is presented. The keys, key space, key selection
rules and sensitivity to keys are discussed in detail. Results show that
the original plaintexts have been well masked in the ciphertexts yet
recovered faithfully and efficiently by the present schemes.