Quantum Key Distribution Using Four-Qubit W State

A new theoretical quantum key distribution scheme based on entanglement swapping is proposed, where four-qubit symmetric W state functions as quantum channel. It is shown that two legitimate users can secretly share a series of key bits by using Bell-state measurements and classical communication.     

Some New Results on Key Distribution Patterns and Broadcast Encryption

This paper concerns methods by which a trusted authority can distribute keys and/or broadcast a message over a network, so that each member of a privileged subset of users can compute a specified key or decrypt the broadcast message. Moreover, this is done in such a way that no coalition is able to recover any information on a key or broadcast message they are not supposed to know. The problems are studied using the tools of information theory, so the security provided is unconditional (i.e., not based on any computational assumption).In a recent paper st95a, Stinson described a method of constructing key predistribution schemes by combining Mitchell-Piper key distribution patterns with resilient functions; and also presented a construction method for broadcast encryption schemes that combines Fiat-Naor key predistribution schemes with ideal secret sharing schemes. In this paper, we further pursue these two themes, providing several nice applications of these techniques by using combinatorial structures such as orthogonal arrays, perpendicular arrays, Steiner systems and universal hash families.     

关系模式关键字的一个求解算法

本文给出了关系数据库模式中求解关键字的一个算法。算法很简洁并且对于[1]定义的一大类问题,执行时间是多项式级的。     

A NOVEL METHOD FOR CONSTRUCTION OF SIDE CHAIN OF BRASSINOSTEROIDS

Construction of the side chain of brassrnolide and its related compounds by the aldolreaction of lithofuran with 22-steroidal aldehyde obtained from hyodeoxycholic acid isdescribed. A key intermediate, 22R, 23R-γ-hydroxy-α, β-unsaturated lactone (16) wassynthesized.     

Sending-or-Not-Sending Twin-Field Quantum Key Distribution with a Passive Decoy-State Method

Twin-field quantum key distribution (TF-QKD) has attracted considerable attention because it can exceed the basic rate-distance limit without quantum repeaters. Its variant protocol, sending or not-sending quantum key distribution (SNS-QKD), not only fixes the security vulnerability of TF-QKD, but also can tolerate large misalignment errors. However, the current SNS-QKD protocol is based on the active decoy-state method, which may lead to side channel information leakage when multiple light intensities are modulated in practice. In this work, we propose a passive decoy-state SNS-QKD protocol to further enhance the security of SNS-QKD. Numerical simulation results show that the protocol not only improves the security in source, but also retains the advantages of tolerating large misalignment errors. Therefore, it may provide further guidance for the practical application of SNS-QKD.     

KEADA: Identifying Key Classes in Software Systems Using Dynamic Analysis and Entropy-Based Metrics

Software maintenance is indispensable in the software development process. Developers need to spend a lot of time and energy to understand the software when maintaining the software, which increases the difficulty of software maintenance. It is a feasible method to understand the software through the key classes of the software. Identifying the key classes of the software can help developers understand the software more quickly. Existing techniques on key class identification mainly use static analysis techniques to extract software structure information. Such structure information may contain redundant relationships that may not exist when the software runs and ignores the actual interaction times between classes. In this paper, we propose an approach based on dynamic analysis and entropy-based metrics to identify key classes in the Java GUI software system, called KEADA (identifying KEy clAsses based on Dynamic Analysis and entropy-based metrics). First, KEADA extracts software structure information by recording the calling relationship between classes during the software running process; such structure information takes into account the actual interaction of classes. Second, KEADA represents the structure information as a weighted directed network and further calculates the importance of each node using an entropy-based metric OSE (One-order Structural Entropy). Third, KEADA ranks classes in descending order according to their OSE values and selects a small number of classes as the key class candidates. In order to verify the effectiveness of our approach, we conducted experiments on three Java GUI software systems and compared them with seven state-of-the-art approaches. We used the Friedman test to evaluate all approaches, and the results demonstrate that our approach performs best in all software systems.     

The queueing model for quantum key distribution network

This paper develops a QKD (quantum key distribution)-based queueing model to investigate the data delay on QKD link and network, especially that based on trusted relays. It shows the mean packet delay performance of the QKD system. Furthermore, it proposes a key buffering policy which could effectively improve the delay performance in practice. The results will be helpful for quality of service in practical QKD systems.     

Analysis of identification methods of key nodes in transportation network

The identification of key nodes plays an important role in improving the robustness of the transportation network. For different types of transportation networks, the effect of the same identification method may be different. It is of practical significance to study the key nodes identification methods corresponding to various types of transportation networks. Based on the knowledge of complex networks, the metro networks and the bus networks are selected as the objects, and the key nodes are identified by the node degree identification method, the neighbor node degree identification method, the weighted k-shell degree neighborhood identification method (KSD), the degree k-shell identification method (DKS), and the degree k-shell neighborhood identification method (DKSN). Take the network efficiency and the largest connected subgraph as the effective indicators. The results show that the KSD identification method that comprehensively considers the elements has the best recognition effect and has certain practical significance.     

Reference-frame-independent quantum key distribution of wavelength division multiplexing with multiple quantum channels

Reference-frame-independent quantum key distribution (RFI-QKD) can allow a quantum key distribution system to obtain the ideal key rate and transmission distance without reference system calibration, which has attracted much attention. Here, we propose an RFI-QKD protocol based on wavelength division multiplexing (WDM) considering finite-key analysis and crosstalk. The finite-key bound for RFI-QKD with decoy states is derived under the crosstalk of WDM. The resulting secret key rate of RFI-QKD, which is more rigorous, is obtained. Simulation results reveal that the secret key rate of RFI-QKD based on WDM is affected by the multiplexing channel number, as well as crosstalk between adjacent channels.     

长距离长期稳定的量子密钥分发系统

介绍了最近完成的长距离长期稳定的量子密钥分发系统.该系统利用往返光路补偿光纤偏振 抖动和相位漂移的原理,采用结电容平衡魔T网络耦合的单光子探测技术,在506km单模 光纤中实现了长时间（大于12h）稳定的量子密钥分发实验.单脉冲平均光子数为007, 误码率为4%,其中单光子探测器的探测效率大于5%,单脉冲暗计数低于29×10^{-6. 关键词： 量子保密通信 量子密钥分发 单光子探测}