Twin-Field Quantum Key Distribution Protocol Based on Wavelength-Division-Multiplexing Technology

Quantum key distribution(QKD) generates information-theoretical secret keys between two parties based on the physical laws of quantum mechanics. Following the advancement in quantum communication networks, it becomes feasible and economical to combine QKD with classical optical communication through the same fiber using dense wavelength division multiplexing(DWDM) technology. This study proposes a detailed scheme of TF-QKD protocol with DWDM technology and analyzes its performance, considering the influence of quantum channel number and adjacent quantum crosstalk on the secret key rates. The simulation results show that the scheme further increases the secret key rate of TF-QKD and its variants. Therefore, this scheme provides a method for improving the secret key rate for practical quantum networks.

Fast and Efficient Security Scheme for Blockchain-Based IoT Networks

Internet of Things(IoT)has become widely used nowadays and tremendous increase in the number of users raises its security requirements as well.The constraints on resources such as low computational capabilities and power requirements demand lightweight cryptosystems.Conventional algorithms are not applicable in IoT network communications because of the constraints mentioned above.In this work,a novel and efficient scheme for providing security in IoT applications is introduced.The scheme proposes how security can be enhanced in a distributed IoT application by providing multilevel protection and dynamic key generation in the data uploading and transfer phases.Existing works rely on a single key for communication between sensing device and the attached gateway node.In proposed scheme,this session key is updated after each session and this is done by applying principles of cellular automata.The proposed system provides multilevel security by using incomparable benefits of blockchain,dynamic key and random number generation based on cellular automata.The same was implemented and tested with the widely known security protocol verification tool called Automated Validation of Internet Security Protocols and Applications(AVISPA).Results show that the scheme is secure against various attacks.The proposed scheme has been compared with related schemes and the result analysis shows that the new scheme is fast and efficient also.

Study on the key technology of spectral reflectivity reconstruction based on sparse prior by a single-pixel detector

By studying the traditional spectral reflectance reconstruction method, spectral reflectance and the relative spectral power distribution of a lighting source are sparsely decomposed, and the orthogonal property of the principal component orthogonal basis is used to eliminate basis; then spectral reflectance data are obtained by solving a sparse coefficient. After theoretical analysis, the spectral reflectance reconstruction based on sparse prior knowledge of the principal component orthogonal basis by a single-pixel detector is carried out by software simulation and experiment. It can reduce the complexity and cost of the system, and has certain significance for the improvement of multispectral image acquisition technology.

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.

Position based key exchange:definitions and implementations

Chandran,et al.introduce the direction of position based cryptography at CRYPTO 2009.In position based cryptography,the position of a party is used to be its unique“credential”in order to realize the cryptographic tasks,such as position based encryption,position based signature,position based key exchange and so on.Position based key exchange,as a basic primitive in position based cryptography,can be used to establish a shared key based on the position of the participant.To begin with,this paper presents the notions of the prover-to-verifier mode and the prover-to-prover mode for position based key exchange.In the prover-to-verifier mode,a secret key can be shared between a prover and the verifiers according to the position of the prover.While in the prover-to-prover mode,two provers located at the valid positions can negotiate a shared key with the help of the verifiers and any other party whose position is illegal cannot obtain the shared key.At the same time,this paper formalizes two security definitions against colluding adversaries:position based prover-to-verifier key exchange and position based prover-to-prover key exchange.Then,this paper introduces the bounded retrieval model and the implementations of position based key exchange in two modes based on the bounded retrieval model.Finally,this paper discusses the position based key exchange protocols in two modes from both security and performance perspectives.