9,374 research outputs found
Cryptographic requirements for chaotic secure communications
In recent years, a great amount of secure communications systems based on
chaotic synchronization have been published. Most of the proposed schemes fail
to explain a number of features of fundamental importance to all cryptosystems,
such as key definition, characterization, and generation. As a consequence, the
proposed ciphers are difficult to realize in practice with a reasonable degree
of security. Likewise, they are seldom accompanied by a security analysis.
Thus, it is hard for the reader to have a hint about their security. In this
work we provide a set of guidelines that every new cryptosystems would benefit
from adhering to. The proposed guidelines address these two main gaps, i.e.,
correct key management and security analysis, to help new cryptosystems be
presented in a more rigorous cryptographic way. Also some recommendations are
offered regarding some practical aspects of communications, such as channel
noise, limited bandwith, and attenuation.Comment: 13 pages, 3 figure
Secure thermal infrared communications using engineered blackbody radiation
The thermal (emitted) infrared frequency bands, from 20–40 THz and 60–100 THz, are best known for applications in thermography. This underused and unregulated part of the spectral range offers opportunities for the development of secure communications. The ‘THz Torch' concept was recently presented by the authors. This technology fundamentally exploits engineered blackbody radiation, by partitioning thermally-generated spectral noise power into pre-defined frequency channels; the energy in each channel is then independently pulsed modulated and multiplexing schemes are introduced to create a robust form of short-range secure communications in the far/mid infrared. To date, octave bandwidth (25–50 THz) single-channel links have been demonstrated with 380 bps speeds. Multi-channel ‘THz Torch' frequency division multiplexing (FDM) and frequency-hopping spread-spectrum (FHSS) schemes have been proposed, but only a slow 40 bps FDM scheme has been demonstrated experimentally. Here, we report a much faster 1,280 bps FDM implementation. In addition, an experimental proof-of-concept FHSS scheme is demonstrated for the first time, having a 320 bps data rate. With both 4-channel multiplexing schemes, measured bit error rates (BERs) of < 10(−6) are achieved over a distance of 2.5 cm. Our approach represents a new paradigm in the way niche secure communications can be established over short links
Secure Communications in Millimeter Wave Ad Hoc Networks
Wireless networks with directional antennas, like millimeter wave (mmWave)
networks, have enhanced security. For a large-scale mmWave ad hoc network in
which eavesdroppers are randomly located, however, eavesdroppers can still
intercept the confidential messages, since they may reside in the signal beam.
This paper explores the potential of physical layer security in mmWave ad hoc
networks. Specifically, we characterize the impact of mmWave channel
characteristics, random blockages, and antenna gains on the secrecy
performance. For the special case of uniform linear array (ULA), a tractable
approach is proposed to evaluate the average achievable secrecy rate. We also
characterize the impact of artificial noise in such networks. Our results
reveal that in the low transmit powerregime, the use of low mmWave frequency
achieves better secrecy performance, and when increasing transmit power, a
transition from low mmWave frequency to high mmWave frequency is demanded for
obtaining a higher secrecy rate. More antennas at the transmitting nodes are
needed to decrease the antenna gain obtained by the eavesdroppers when using
ULA. Eavesdroppers can intercept more information by using a wide beam pattern.
Furthermore, the use of artificial noise may be ineffective for enhancing the
secrecy rate.Comment: Accepted by IEEE Transactions on Wireless Communication
Deterministic Secure Communications using Two-Mode Squeezed States
We propose a scheme for quantum cryptography that uses the squeezing phase of
a two-mode squeezed state to transmit information securely between two parties.
The basic principle behind this scheme is the fact that each mode of the
squeezed field by itself does not contain any information regarding the
squeezing phase. The squeezing phase can only be obtained through a joint
measurement of the two modes. This, combined with the fact that it is possible
to perform remote squeezing measurements, makes it possible to implement a
secure quantum communication scheme in which a deterministic signal can be
transmitted directly between two parties while the encryption is done
automatically by the quantum correlations present in the two-mode squeezed
state.Comment: 10 pages, 4 figure
Continuum Percolation in the Intrinsically Secure Communications Graph
The intrinsically secure communications graph (iS-graph) is a random graph
which captures the connections that can be securely established over a
large-scale network, in the presence of eavesdroppers. It is based on
principles of information-theoretic security, widely accepted as the strictest
notion of security. In this paper, we are interested in characterizing the
global properties of the iS-graph in terms of percolation on the infinite
plane. We prove the existence of a phase transition in the Poisson iS-graph,
whereby an unbounded component of securely connected nodes suddenly arises as
we increase the density of legitimate nodes. Our work shows that long-range
communication in a wireless network is still possible when a secrecy constraint
is present.Comment: Accepted in the IEEE International Symposium on Information Theory
and its Applications (ISITA'10), Taichung, Taiwan, Oct. 201
Cooperative Jamming for Secure Communications in MIMO Relay Networks
Secure communications can be impeded by eavesdroppers in conventional relay
systems. This paper proposes cooperative jamming strategies for two-hop relay
networks where the eavesdropper can wiretap the relay channels in both hops. In
these approaches, the normally inactive nodes in the relay network can be used
as cooperative jamming sources to confuse the eavesdropper. Linear precoding
schemes are investigated for two scenarios where single or multiple data
streams are transmitted via a decode-and-forward (DF) relay, under the
assumption that global channel state information (CSI) is available. For the
case of single data stream transmission, we derive closed-form jamming
beamformers and the corresponding optimal power allocation. Generalized
singular value decomposition (GSVD)-based secure relaying schemes are proposed
for the transmission of multiple data streams. The optimal power allocation is
found for the GSVD relaying scheme via geometric programming. Based on this
result, a GSVD-based cooperative jamming scheme is proposed that shows
significant improvement in terms of secrecy rate compared to the approach
without jamming. Furthermore, the case involving an eavesdropper with unknown
CSI is also investigated in this paper. Simulation results show that the
secrecy rate is dramatically increased when inactive nodes in the relay network
participate in cooperative jamming.Comment: 30 pages, 7 figures, to appear in IEEE Transactions on Signal
Processin
Percolation and Connectivity in the Intrinsically Secure Communications Graph
The ability to exchange secret information is critical to many commercial,
governmental, and military networks. The intrinsically secure communications
graph (iS-graph) is a random graph which describes the connections that can be
securely established over a large-scale network, by exploiting the physical
properties of the wireless medium. This paper aims to characterize the global
properties of the iS-graph in terms of: (i) percolation on the infinite plane,
and (ii) full connectivity on a finite region. First, for the Poisson iS-graph
defined on the infinite plane, the existence of a phase transition is proven,
whereby an unbounded component of connected nodes suddenly arises as the
density of legitimate nodes is increased. This shows that long-range secure
communication is still possible in the presence of eavesdroppers. Second, full
connectivity on a finite region of the Poisson iS-graph is considered. The
exact asymptotic behavior of full connectivity in the limit of a large density
of legitimate nodes is characterized. Then, simple, explicit expressions are
derived in order to closely approximate the probability of full connectivity
for a finite density of legitimate nodes. The results help clarify how the
presence of eavesdroppers can compromise long-range secure communication.Comment: Submitted for journal publicatio
- …