Related papers: Design of an Efficient Neural Key Distribution Cen…

Two neural networks which are trained on their mutual output bits show a novel phenomenon: The networks synchronize to a state with identical time dependent weights. It is shown how synchronization by mutual learning can be applied to…

A connection between the theory of neural networks and cryptography is presented. A new phenomenon, namely synchronization of neural networks is leading to a new method of exchange of secret messages. Numerical simulations show that two…

Exchange of secret keys over public channels based on neural synchronization using a variety of learning rules offer an appealing alternative to number theory based cryptography algorithms. Though several forms of attacks are possible on…

Two neural networks which are trained on their mutual output bits are analysed using methods of statistical physics. The exact solution of the dynamics of the two weight vectors shows a novel phenomenon: The networks synchronize to a state…

Two different kinds of synchronization have been applied to cryptography: Synchronization of chaotic maps by one common external signal and synchronization of neural networks by mutual learning. By combining these two mechanisms, where the…

The security of neural cryptography is investigated. A key-exchange protocol over a public channel is studied where the parties exchanging secret messages use multilayer neural networks which are trained by their mutual output bits and…

Neural networks can synchronize by learning from each other. In the case of discrete weights full synchronization is achieved in a finite number of steps. Additional networks can be trained by using the inputs and outputs generated during…

Neural cryptography is based on a competition between attractive and repulsive stochastic forces. A feedback mechanism is added to neural cryptography which increases the repulsive forces. Using numerical simulations and an analytic…

This paper presents a method of cryptographic key distribution using an `artificially' noisy channel. This is an important development because, while it is known that a noisy channel can be used to generate unconditional secrecy, there are…

Any secured system can be modeled as a capability-based access control system in which each user is given a set of secret keys of the resources he is granted access to. In some large systems with resource-constrained devices, such as sensor…

Information-theoretically secure communications are possible when channel noise is usable and when the channel has an intrinsic characteristic that a legitimate receiver (Bob) can use the noise more advantageously than an eavesdropper…

For single-photon quantum key generation between two users, it is shown that the use of a shared secret key extended via a pseudo-random number generator may simultaneously enhance the security and efficiency of the cryptosystem. This…

In this paper, we study the problem of secret key generation from both correlated sources and a secure channel. We obtain the optimal secret key rate in this problem and show that the optimal scheme is to conduct secret key generation and…

In the classical Secret-Key generation model, Common Randomness is generated by two terminals based on the observation of correlated components of a common source, while keeping it secret from a non-legitimate observer. It is assumed that…

We consider problems of two-user secret key generation through an intermediate relay. Each user observes correlated source sequences and communicates to the relay over rate-limited noiseless links. The relay processes and broadcasts…

Among the various means of available resource protection including biometrics, password based system is most simple, user friendly, cost effective and commonly used. But this method having high sensitivity with attacks. Most of the advanced…

This paper considers secret-key generation between several agents and a base station that observe independent and identically distributed realizations of correlated random variables. Each agent wishes to generate the longest possible…

In this paper, we consider the problem of secret key generation for multiple parties. Multi-user networks usually require a trusted party to efficiently distribute keys to the legitimate users and this process is a weakness against…

Quantum cryptography allows one to distribute a secret key between two remote parties using the fundamental principles of quantum mechanics. The well-known established paradigm for the quantum key distribution relies on the actual…

We consider secret key generation for a "pairwise independent network" model in which every pair of terminals observes correlated sources that are independent of sources observed by all other pairs of terminals. The terminals are then…