The invention of electronic mail (e-mail) has made communication through the Internet easier than before. However, because fundamental functions are built on opensource technologies, it is critical to keep all transmitted e-mail secure and secret. Most current protocols only allow recipients check their after authenticated by server. Unfortunately, subsequent transmission from server recipient ...

Recent research reveals that information security and information-hiding capabilities can be enhanced by proper exploitation of space-time techniques. Meanwhile, intrinsic properties of ultra-wideband (UWB) signals make it an outstanding candidate for secure applications. In this paper, we propose a space-time coding scheme for impulse radio UWB systems. A novel real orthogonal group code is de...

This work presents novel achievable schemes for the 2-user symmetric linear deterministic interference channel with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. The proposed achievable scheme consists of a combination of interference cancelation, relaying of the other user’s data bits, time sharing, and transmission of random bits, depending on the rate...

Considering a multi-user interference network with an eavesdropper, this paper aims at the power allocation to optimize the worst secrecy throughput among the network links or the secure energy efficiency in terms of achieved secrecy throughput per Joule under link security requirements. Three scenarios for the access of channel state information are considered: the perfect channel state inform...

Recently, LaMacchia, Lauter and Mityagin proposed the extended Canetti-Krawczyk (eCK) model for Authenticated Key Exchange (AKE) protocols that covers many attacks on existing models. An ID-based AKE protocol with Perfect Forward Secrecy (PFS) (respectively Master Perfect Forward Secrecy (MPFS)) ensures that revelation of the static keys of the parties (respectively the master secret key of the...

In this work, the role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is investigated. A model is considered in which the feed-forward and feedback signals share the same noisy channel. More specifically, a discrete memoryless modulo-additive channel with a full-duplex destination node is considered first, and it is shown that a judicious use of feedback increases th...

in this paper, we consider a cooperative cognitive radio network in which there is an ofdm primary link and multiple single carrier secondary links.the primary link is required to maintain its secrecy rate above a predefined threshold. if the secrecy rate requirement is not satisfied, the secondary system help primary link to maintain its secrecy rate requirement. in doing so, the secondary trans...

Sensor nodes are resource-constrained, such as low battery life, computation, bandwidth and memory, so traditional public key schemes are impractical in wireless sensor networks. In the previous schemes, symmetric cryptography is the most common method used in sensor nodes. How to distribute keys into every sensor node is an important issue in many applications for hierarchical sensor networks....

A perpendicular array PA,(t, k, u) is a n(y) by k array A of u distinct symbols, which satisfies: (i) every row of A contains k distinct symbols, (ii) for any t columns, and for any t distinct symbols, there are precisely 2 rows with the given symbols in the given columns. Such a structure may also be described as a A-uniform, t-homogeneous set of injective mappings from a k-set into a u-set. A...