We present a general algorithm for generating arbitrary standard complementary pairs of sequences (including binary, polyphase, M-PSK and QAM) of length 2 using Boolean functions. The algorithm follows our earlier paraunitary algorithm, but does not require matrix multiplications. The algorithm can be easily and efficiently implemented in hardware. As a special case, it reduces to the non-recur...

In this correspondence, we show that for any (Q×M) space-time code S having a fixed, finite signal constellation, there is a tradeoff between the transmission rate R and the transmit diversity gain ν achieved by the code. The tradeoff is characterized by R ≤ Q−ν +1, where Q is the number of transmit antennas. When either BPSK or QPSK is used as the signal constellation, a systematic constructio...

Random key pre-distribution schemes are vulnerable to collusion attacks. In this paper, we propose a new key management scheme for ubiquitous heterogeneous sensor networks consisting of a small number of powerful high-end H-sensors and a large number of ordinary low-end L-sensors. The collusion attack on key pre-distribution scheme mainly takes advantage of the globally applicable keys, which a...

Purpose Random key pre-distribution schemes are vulnerable to collusion attacks. The purpose of this research is to propose an efficient collusion resistant security mechanism for heterogeneous sensor networks (HSN). As large-scale homogeneous networks suffer from high costs of communication, computation, and storage requirements, the HSNs are preferred because they provide better performance a...

Key-insulated cryptosystem was proposed in order to minimize the damage of secret key exposure. In this paper, we propose a strong identity based (ID-based) key-insulated cryptosystem security model, including ID-based key-insulated encryption (IB-KIE) security model and ID-based key-insulated signature (IB-KIS) security model. Based on the security models, provably secure strong IB-KIE and IBK...

This paper presents a comprehensive formal security framework for key derivation functions (KDF). The major security goal for a KDF is to produce cryptographic keys from a private seed value where the derived cryptographic keys are indistinguishable from random binary strings. We form a framework of five security models for KDFs. This consists of four security models that we propose: Known Publ...

In this paper we study one-round key-agreement protocols analogous to Merkle’s puzzles in the random oracle model. The players Alice and Bob are allowed to query a random permutation oracle n times and upon their queries and communication, they both output the same key with high probability. We prove that Eve can always break such a protocol by querying the oracle O(n) times. The long-time unpr...

To achieve security in wireless sensor networks, it is important to be able to encrypt messages sent among sensor nodes. Keys for encryption purposes must be agreed upon by communicating nodes. Due to resource constraints, achieving such key agreement in wireless sensor networks is non-trivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and public-key based sche...

In wireless sensor networks (WSNs), for secure communications, the random key pre-distribution arises as the practical solution for sharing common keys between sensor nodes. Since sensor networks suffer from the resource constraints, we should consider the small computation, small number of keys, etc. while supporting the same security level, i.e., high resilience against node capture. In this ...