Analysis on the Resilience of Key Pre-distribution in Sensor Networks

Resilience against node capture is one of the main indicators of the key pre-distribution security in sensor networks.On providing the attack model and the definition of the resilience against node capture of sensor networks,the resilience of basic random key pre-distribution,Q-composite random key pre-distribution and their reinforced schemes are analyzed and compared in depth.Research results show that the size of key pool,the numbers of the keys stored in nodes and the value of Q determine the resilience of random key pre-distribution.The tradeoff between the resilience,security connectivity and costs in sensor networks is presented.These researches lay a foundation on the design of the secure protocol and the algorithm in the specific application environment of sensor networks.

Key Incorporation Scheme for Cancelable Biometrics

Biometrics is becoming an important method for human identification. However, once a biometric pattern is stolen, the user will quickly run out of alternatives and all the applications where the associated biometric pattern is used become insecure. Cancelable biometrics is a solution. However, traditional cancelable biometric methods treat the transformation process and feature extraction process independently. As a result, this kind of cancelable biometric approach would reduce the recognition accuracy. In this paper, we first analyzed the limitations of traditional cancelable biometric methods, and proposed the Key Incorporation Scheme for Cancelable Biometrics approach that could increase the recognition accuracy while achieving “cancelability”. Then we designed the Gabor Descriptor based Cancelable Iris Recognition method that is a practical implementation of the proposed Key Incorporation Scheme. The experimental results demonstrate that our proposed method can significantly improve the iris recognition accuracy while achieving “cancelability”.

Breaking and Repairing the Certificateless Key Agreement Protocol from ASIAN 2006

The certificateless authenticated key agreement protocol proposed by Mandt et al does not haVE the property of key-compromise impersonation （K-CI） resilience. An improved protocol with a simple modification of their protocol is proposed in this paper. In particular, our improved protocol is proved to be immune to the K-CI attack and at the same time possess other security properties.

Review of Key Management Mechanisms in Wireless Sensor Networks

Recent advancements in wireless communication and microchip techniques have accelerated the development of wireless sensor networks (WSN). Key management in WSN is a critical and challenging problem because of the inner characteristics of sensor networks: deployed in hostile environments, limited resource and ad hoc nature. This paper investigates the constraints and special requirements of key management in sensor network environment, and some basic evaluation metrics are introduced. The key pre-distribution scheme is thought as the most suitable solution for key management problem in wireless sensor networks. It can be classified into four classes: pure probabilistic key pre-distribution, polynomial-based, Blom's matrix-based, and deterministic key pre-distribution schemes. In each class of methods, the related research papers are discussed based on the basic evaluation metrics. Finally, the possible research directions in key management are discussed.

A Cluster-Based Random Key Revocation Protocol for Wireless Sensor Networks

In recent years,several random key pre-distribution schemes have been proposed to bootstrap keys for encryption,but the problem of key and node revocation has received relatively little attention.In this paper,based on a random key pre-distribution scheme using clustering,we present a novel random key revoca-tion protocol,which is suitable for large scale networks greatly and removes compromised information efficiently.The revocation protocol can guarantee network security by using less memory consumption and communication load,and combined by centralized and distributed revoca-tion,having virtues of timeliness and veracity for revoca-tion at the same time.

Threshold Decryption Scheme withMultiple Policies

Based on the difficulty in computing discrete logarilhm and square 1001 onsome special conditions, we propose a basic threshold seeret sharing scheme for multiple secretswith multiple policies, which allows a group of users to share multiple secrttkeys and only onesecret shadow to be ktpt by each user. An efficient threshold decryption scheme with multiplepolicies is designed on the basis of the basic threshold scheme. This decryption scheme allowsmultiple secret keys to he shared among a groupof users, and each user to ketp only one secretshadow. Different public keys can be used to encrypt documents. If and only if the number ofcooperated users who koop the secret shadows is greater than or c-qual to the threshold value of thecorresponding secret key, they can cooperate to decrypt the documents. It is proved that theproposed scheme has very strong security, unless the attackers can solve the discrete logarithmproblem and the square root problem.

k-PARTY SHARED RSA KEY GENERATION

This letter presents a k-party RSA key sharing scheme and the related algorithms are presented. It is shown that the shared key can be generated in such a collaborative way that the RSA modulus is publicly known but none of the parties is able to decrypt the enciphered message individually.

A threshold key escrow scheme based on public key cryptosystem

In key escrow field it is important to solve the problem thatuser's secret key completely depends on the trusted escrow agency. In 1995, some methods of solving the problem were presented. But these methods are no better than that of directly using threshold cryptography. In this paper, we present a common pattern of threshold key escrow scheme based on public key cryptosystem, and a detailed design based on the improved RSA algorithm is given. The above problem is solved by this scheme.

Quantum Secure Direct Communication Network with Two-Step Protocol

An efficient quantum secure direct communication network protocol with the two-step scheme is proposed by using the Einstein-Podolsky-Rosen （EPR） pair block as the quantum information carrier. The server, say Alice, prepares and measures the EPR pairs in the quantum communication and the users perform the four local unitary operations to encode their message. Anyone of the legitimate users can communicate another one on the network securely. Since almost all of the instances in this scheme are useful and each EPR pair can carry two bits of information, the efficiency for qubits and the source capacity both approach the maximal values.

Efficient Multiparty Quantum Secret Sharing with Greenberger-Horne-Zeilinger States

An effcient multiparty quantum secret sharing scheme is proposed with Greenberger-Horne-Zeilinger （GHZ） states following some ideas in quantum dense coding. The agents take the single-photon measurements on the photons received for eavesdropping check and exploit the four local unitary operations Ⅰ, σx, σx and iσy to code their message. This scheme has the advantage of high capacity as each GHZ state can carry two bits of information. The parties do not need to announce the measuring bases for almost all the photons, which will reduce the classical information exchanged largely. The intrinsic efficiency for qubits and the total effciency both approach the maximal values.

Teleportation of Multi-qudit Entangled States

We propose a method to realize the teleportation of an unknown entangled state that consists of many qudits through a partially entangled-qudit quantum channel with the help of 2 log2 d-bit classical communication. The operations used in the teleportation process include a generalized Bell-state measurement and a series of singlequdit π-measurements performed by Alice, a series of generalized qudit-Pauli gates and two-level unitary gates, as well as a qubit measurement performed by Bob. For a maximally entangled quantum channel, the successful probability of the teleportation becomes unit.

A Class of Key Predistribution Schemes Based on Orthogonal Arrays

Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. In order to ensure this security, many approaches have been proposed recently. One of them is to use key predistribution schemes （KPSs） by means of combinatorial designs. In this paper, we use the Bush＇s construction of orthogonal arrays to present a class of key predistribution schemes for distributed sensor networks. The secure connectivity and resilience of the resulting sensor network are analyzed. This KPS constructed in our paper has some better properties than those of the existing schemes.

Multiparty Quantum Secret Report

A multiparty quantum secret report scheme is proposed with quantum encryption. The boss Alice and her M agents first share a sequence of （M ＋ 1）-particle Greenberger-Horne-Zeilinger （GHZ） states that only Alice knows which state each （M ＋ 1）-particle quantum system is in. Each agent exploits a controlled-not （CNot） gate to encrypt the travelling particle by using the particle in the GHZ state as the control qubit. The boss Alice decrypts the travelling particle with a CNot gate after performing a aσ∞ operation on her particle in the GHZ state or not. After the GHZ states （the quantum key） are used up, the parties check whether there is a vicious eavesdropper, say Eve, monitoring the quantum line, by picking out some samples from the GHZ states shared and measuring them with two measuring bases. After confirming the security of the quantum key, they use the remaining GHZ states repeatedly for the next round of quantum communication. This scheme has the advantage of high intrinsic efficiency for the qubits and total efficiency.

An Approach to Integer Wavelet Transform for Medical Image Compression in PACS

We study an approach to integer wavelet transform for lossless compression of medical image in medical picture archiving and communication system (PACS). By lifting scheme a reversible integer wavelet transform is generated, which has the similar features with the corresponding biorthogonal wavelet transform. Experimental results of the method based on integer wavelet transform are given to show better performance and great applicable potentiality in medical image compression.

Can the Polynomial Based Key Predistribution Scheme Be Used Many Times in One Wireless Sensor Network Key Establishment Protocol?

Key establishment is the basic step for the wireless sensor network （WSN） security. The polynomial based key predistribution scheme of Blom and Blundo et al. has been the basic ingredient for the key establishment for WSNs. It is tempting to use many random and different instances of polynomial based key predistribution scheme for various parts of the WSN to enhance the efficiency of WSN key establishment protocols. This paper indicates that it is not secured in general to use many instances of Blom-Blundo et al. polynomial based key predistribution scheme in a WSN key establishment protocol. Thus the previously constructed group-based type WSN key predistribution schemes using polynomial based key predistribution scheme are insecure. We propose new generalized Bloin-Blundo et al. key predistribution schemes. These new generalized Blom-Blundo et al. key predistribution schemes can be used many times in one WSN key establishment protocol with only a small increase of cost. The application to group-based WSN key predistribution schemes is given.

One-way information reconciliation schemes of quantum key distribution

With the rapid improvement of quantum computing technology,quantum key distribution(QKD)is a hot technology.Information reconciliation is a key step of QKD which is useful for correcting key error.Classical message interaction is necessary in a practical information reconciliation scheme,which makes the efficiency of these protocols decreased.Therefore,some one-way information reconciliation schemes based on low-density parity-check(LDPC)codes and polar codes are proposed.Here we propose a concatenated method of IR schemes which can achieve any given error rate level without the need of interactions.Compared with the one-way IR schems based on LDPC codes and polar codes,the IR schemes based on the proposed concatenated method can get lower bit error rates after error correction,which can also reduce the communication delay and system complexity of QKD,improve the final key generation rate and enhance the practicability of QKD system.

One-way information reconciliation schemes of quantum key distribution

With the rapid improvement of quantum computing technology,quantum key distribution(QKD)is a hot technology.Information reconciliation is a key step of QKD which is useful for correcting key error.Classical message interaction is necessary in a practical information reconciliation scheme,which makes the efficiency of these protocols decreased.Therefore,some one-way information reconciliation schemes based on low-density parity-check(LDPC)codes and polar codes are proposed.Here we propose a concatenated method of IR schemes which can achieve any given error rate level without the need of interactions.Compared with the one-way IR schems based on LDPC codes and polar codes,the IR schemes based on the proposed concatenated method can get lower bit error rates after error correction,which can also reduce the communication delay and system complexity of QKD,improve the final key generation rate and enhance the practicability of QKD system.

Automatic Recognition of Analog Modulated Signals Using Artificial Neural Networks

This paper presents work on modulated signal recognition using an artificial neural network （ANN） developed using the Python programme language. The study is basically on the analysis of analog modulated signals. Four of the best-known analog modulation types are considered namely： amplitude modulation （AM）, double sideband （DSB） modulation, single sideband （SSB） modulation and frequency modulation （FM）. Computer simulations of the four modulated signals are carried out using MATLAB. MATLAB code is used in simulating the analog signals as well as the power spectral density of each of the analog modulated signals. In achieving an accurate classification of each of the modulated signals, extensive simulations are performed for the training of the artificial neural network. The results of the study show accurate and correct performance of the developed automatic modulation recognition with average success rate above 99.5%.

Cryptanalysis and improvement of a certificateless signcryption scheme without bilinear pairing

As an improtant cryptographic scheme, signcryption scheme has been widely used in applications since it could provide both of signature and encryption. With the development of the certificateless public key cryptography （CLPKC）, many certificatelss signcryption （CLSC） schemes using bilinear pairing hve been proposed. Comparated other operations, the bilinear pairing operaion is much more compulicated. Therefore, CLSC scheme without bilinear pairing is more suitable for applications. Recently, Jing et al. proposed a CLSC scheme without bilinear pairing and claimed their scheme is secure against two types of adversaries. In this paper, we will show their scheme provide neither unforgeability property nor confidentiality property. To improve security, we also propose a new CLSC scheme without pairing and demonstrate it is provably secure in the random oracle model.

Constructions for key distribution patterns

Abstract Key distribution patterns （KDPs） are finite incidence structures satisfying a certain property which makes them widely used in minimizing the key storage and ensuring the security of communication between users in a large network. We construct a new KDP using t-design and combine two ω-KDPs to give new （ω- 1）-KDPs, which provide secure communication in a large network and minimize the amount of key storage.