We propose a new scheme for controlled quantum teleportation with Bell states in which classical keys for controllers＇ portion are used. We also discuss the security of the proposed scheme and show that it can satisfy the requirements for controlled quantum teleportation. The comparison between this scheme and the previous ones shows that it is more economical and efficient.
We show a scheme to distribute the entanglement by using three-mode separable Gaussian state prepared with imperfect equipments. The scheme achieves the aim that the entanglement is distributed between two distant parties with only Gaussian operations and linear optics elements. Moreover, we analyse the logarithmic negativity of the entanglement shared between the two parties when the systems are imperfect and arrive at the conclusion that the logarithmic negativity is asymptotically stable with fluctuations within a certain space range.
Mobile Ad hoc NETwork （MANET） is a part of the Internet of Things （IoT）. In battlefield communication systems, ground soldiers, tanks, and unmanned aerial vehicles comprise a heterogeneous MANET. In 2006, Byun et al. proposed the first constant-round password-based group key ex- change with different passwords for such net- works. In 2008, Nam et al. discovered the short- comings of the scheme, and modified it. But the works only provide the group key. In this paper, we propose a password-based secure communication scheme for the loT, which could be applied in the battlefield communication systems and support dy- namic group, in which the nodes join or leave. By performing the scheme, the nodes in the heteroge- neous MANET can realize secure broadcast, secure unicast, and secure direct communication across realms. After the analyses, we demonstrate that the scheme is secure and efficient.
Based on quantum encryption,we present a new idea for quantum public-key cryptography (QPKC) and construct a whole theoretical framework of a QPKC system. We show that the quantum-mechanical nature renders it feasible and reasonable to use symmetric keys in such a scheme,which is quite different from that in conventional public-key cryptography. The security of our scheme is analyzed and some features are discussed. Furthermore,the state-estimation attack to a prior QPKC scheme is demonstrated.
A new protocol for the anonymous communication of quantum information is proposed. The anonymity of the receiver and the privacy of the quantum information are perfectly protected except with exponentially small probability in this protocol. Furthermore, this protocol uses single photons to construct anonymous entanglement instead of multipartite entangled states, and therefore it reduces quantum resources compared with the pioneering work.
The discrimination of quantum operations plays a key role in quantum information and computation. Unlike discriminating quantum states, it has some special properties which can be carried out in practice. In this paper, we provide a general description of discriminating quantum operations. Concretely speaking, we describe the distinguisha- bility between quantum operations using a measure called operator fidelity. It is shown that, employing the theory of operator fidelity, we can not only verify some previous results to discriminate unitary operations, but also exhibit a more general discrimination condition. We further apply our results to analysing the security of some quantum cryptographic protocols and discuss the realization of our method using well-developed quantum algorithms.
We present a new fair blind signature scheme based on the fundamental properties of quantum mechanics. In addition, we analyse the security of this scheme, and show that it is not possible to forge valid blind signatures. Moreover, comparisons between this scheme and public key blind signature schemes are also discussed.
Algebraic immunity is an important cryptographic property of Boolean functions. The notion of algebraic immunity of Boolean functions has been generalized in several ways to vector-valued functions over arbitrary finite fields. In this paper, the results of Ref. [25] are generalized to arbitrary finite fields. We obtain vector-valued functions over arbitrary finite fields such that their algebraic immunities can reach the upper bounds. Furthermore, all the component functions, together with their some nonzero linear combinations, of vector-valued Boolean functions achieved by this construction have optimal algebraic immunities simultaneously.
