15,211 research outputs found
Authenticated tree parity machine key exchange
The synchronisation of Tree Parity Machines (TPMs), has proven to provide a
valuable alternative concept for secure symmetric key exchange. Yet, from a
cryptographer's point of view, authentication is at least as important as a
secure exchange of keys. Adding an authentication via hashing e.g. is
straightforward but with no relation to Neural Cryptography. We consequently
formulate an authenticated key exchange within this concept. Another
alternative, integrating a Zero-Knowledge protocol into the synchronisation, is
also presented. A Man-In-The-Middle attack and even all currently known
attacks, that are based on using identically structured TPMs and
synchronisation as well, can so be averted. This in turn has practical
consequences on using the trajectory in weight space. Both suggestions have the
advantage of not affecting the previously observed physics of this interacting
system at all.Comment: This work directly relates to cond-mat/0202112 (see also
http://arxiv.org/find/cond-mat/1/au:+Kinzel/0/1/0/all/0/1
Data Confidentiality in Mobile Ad hoc Networks
Mobile ad hoc networks (MANETs) are self-configuring infrastructure-less
networks comprised of mobile nodes that communicate over wireless links without
any central control on a peer-to-peer basis. These individual nodes act as
routers to forward both their own data and also their neighbours' data by
sending and receiving packets to and from other nodes in the network. The
relatively easy configuration and the quick deployment make ad hoc networks
suitable the emergency situations (such as human or natural disasters) and for
military units in enemy territory. Securing data dissemination between these
nodes in such networks, however, is a very challenging task. Exposing such
information to anyone else other than the intended nodes could cause a privacy
and confidentiality breach, particularly in military scenarios. In this paper
we present a novel framework to enhance the privacy and data confidentiality in
mobile ad hoc networks by attaching the originator policies to the messages as
they are sent between nodes. We evaluate our framework using the Network
Simulator (NS-2) to check whether the privacy and confidentiality of the
originator are met. For this we implemented the Policy Enforcement Points
(PEPs), as NS-2 agents that manage and enforce the policies attached to packets
at every node in the MANET.Comment: 12 page
Tree Parity Machine Rekeying Architectures
The necessity to secure the communication between hardware components in
embedded systems becomes increasingly important with regard to the secrecy of
data and particularly its commercial use. We suggest a low-cost (i.e. small
logic-area) solution for flexible security levels and short key lifetimes. The
basis is an approach for symmetric key exchange using the synchronisation of
Tree Parity Machines. Fast successive key generation enables a key exchange
within a few milliseconds, given realistic communication channels with a
limited bandwidth. For demonstration we evaluate characteristics of a
standard-cell ASIC design realisation as IP-core in 0.18-micrometer
CMOS-technology
Neural Cryptography
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 cryptography: secret key exchange over a public channel.Comment: 9th International Conference on Neural Information Processing,
Singapore, Nov. 200
- …