Secure Physical Layer Network Coding versus Secure Network Coding

When a network has relay nodes, there is a risk that a part of the information is leaked to an untrusted relay. Secure network coding (secure NC) is known as a method to resolve this problem, which enables the secrecy of the message when the message is transmitted over a noiseless network and a part of the edges or a part of the intermediate (untrusted) nodes are eavesdropped. If the channels on the network are noisy, the error correction is applied to noisy channels before the application of secure NC on an upper layer. In contrast, secure physical layer network coding (secure PLNC) is a method to securely transmit a message by a combination of coding operation on nodes when the network is composed of set of noisy channels. Since secure NC is a protocol on an upper layer, secure PLNC can be considered as a cross-layer protocol. In this paper, we compare secure PLNC with a simple combination of secure NC and error correction over several typical network models studied in secure NC.     

Secure Fiberoptic Communications

At the heart of our current information explosion is the communication network. Networks are now an intrinsic part of our daily activities, whether they are for Internet business transactions or military communications in Future Combat Systems. Protection of this communication infrastructure is a must.

In this article, we discuss two approaches for securing all-optical networks. The first is an optical encryption technique that denies the information to intruders. The second is an authentication scheme capable of detecting and identifying unauthorized users.     

Secure quantum telephone

A quantum telephone protocol including the dialing process and the talking one is proposed. In the dialing process, with their respective secret keys, the legitimate communicators Alice and Bob can pass the authentication by Charlie acting as a telephone company. In the talking process, Charlie provides the authenticated Alice and Bob with a quantum channel sequence, on which Alice and Bob can communicate with each other directly and privately by virtue of some encoding operations. Different from the insecure classical telephone having been used in our lives, the proposed quantum telephone protocol has asymptotically security and the communicators cannot disavow having used the quantum channels.     

Secure Quantum Secret Sharing Based on Reusable GHZ States as Secure Carriers

We show that a potential eavesdropper can eavesdrop whole secret information when the legitimate users use secure carrier to encode and decode classical information repeatedly in the protocol proposed by Bagherinezhad S and Karimipour V [Phys. Rev. A 67（2003）044302]. Then we present a revised quantum secret sharing protocol by using the Greenberger-Horne-Zeilinger state as secure carrier. Our protocol can resist Eve＇s attack.     

Secure quantum sealed-bid auction

A new experimentally feasible and secure quantum sealed-bid auction protocol using quantum secure direct communication based on GHZ states is proposed. In this scheme all bidders Bob, Charlie, … , and Zach use M groups n-particle GHZ states to represent their bids. Here, an auctioneer gives the auction outcome by performing a sequence of n-particle GHZ-basis measurements on the final quantum states. It has been shown that using this method guarantees the honesty of the protocol, and malicious bidders can not collude with the auctioneers.     

保密多方量子求和

给出基于非正交态的量子保密模加法方案，允许累加者把一个数保密地累加在一个未知数上.提出的保密多方量子求和方案对于窃取者是渐进安全的，n-1方的共谋攻击不会使得另一方泄露全部信息.     

Secure deterministic communication without entanglement

We propose a protocol for deterministic communication that does not make use of entanglement. It exploits nonorthogonal states in a two-way quantum channel to attain unconditional security and high efficiency of the transmission. We explicitly show the scheme is secure against a class of individual attacks regardless of the noise on the channel. Its experimental realization is feasible with current technology.     

Controlled Deterministic Secure Semi-Quantum Communication

A controlled deterministic secure semi-quantum communication protocol based on GHZ-like states is proposed for improving the security of semi-quantum communication. The protocol includes three participants, one is Alice with quantum capabilities who can prepare GHZ-like states to provide a secure and controllable quantum channel, and the remaining are Bob and controller Charlie who have only classical abilities. During the communication process, Bob compresses the secret message to obtain a binary string with Huffman compression coding technology, and then performs encoding and encryption operations to improve confidentiality. Furthermore, the analysis results demonstrate that the proposed CDSSQC protocol can effectively resist Trojan horse attacks, intercept-resend attack, double CNOT attack and other attacks.

     

Secure communications over opportunistic-relay channels

In this paper, we derive information-theoretic performance limits for secure communications over two classes of discrete memoryless relay channels. We consider two different communication scenarios over a four node wireless network comprising a source–destination pair, a relay node and a malicious node eavesdropping on the link between the relay and the destination. In both scenarios, the relay is (1) opportunistic in the sense that, it utilizes the communication opportunity to transmit its own message to the destination; and (2) constrained to secure its communication from the external eavesdropper. We present a novel achievability scheme, namely layered coding, to simultaneously deal with cooperation, cognition and confidentiality. We derive inner bounds on the capacity region for the two communication scenarios, and characterize the rate-penalty for satisfying the security constraints on the messages. Outer bounds are derived using auxiliary random variables which enable single-letter characterization. We also compare the opportunistic-relay models to the classical cognitive radio network setup. Finally, we discuss some of the advantages and drawbacks of our coding strategy in comparison to those in the existing literature, which provides interesting insights into the relative merits of the methods employed in this work for obtaining the capacity bounds.     

Classical-Operation-Based Deterministic Secure Quantum Communication

We generalize the unitary-operation-based deterministic secure quantum communication (UODSQC) model (protocol) to describe the conventional deterministic secure quantum communication (DSQC) protocols in which unitary operations are usually utilized for encoding or decoding message. However, it is found that unitary operation for message encoding or decoding is not required and can be replaced with classical operation in DSQC. So the classical-operation-based deterministic secure quantum communication (CODSQC) model (protocol) is put forward. Then the rigorous mathematical analysis to explain the reason why classical operations can replace unitary operations to encode or decode secret deterministic message is given. Although unitary operations are still possibly needed in the whole communication of CODSQC model (protocol), those used for message encoding or decoding are omitted and replaced with classical operations in CODSQC model (protocol). As a result, the CODSQC model (protocol) is simpler and even more robust than the UODSQC one.     

Secure key from bound entanglement

We characterize the set of shared quantum states which contain a cryptographically private key. This allows us to recast the theory of privacy as a paradigm closely related to that used in entanglement manipulation. It is shown that one can distill an arbitrarily secure key from bound entangled states. There are also states that have less distillable private keys than the entanglement cost of the state. In general, the amount of distillable key is bounded from above by the relative entropy of entanglement. Relationships between distillability and distinguishability are found for a class of states which have Bell states correlated to separable hiding states. We also describe a technique for finding states exhibiting irreversibility in entanglement distillation.     

Robust Quantum Secure Direct Communication and Deterministic Secure Quantum Communication over Collective Dephasing Noisy Channel

We propose two schemes for quantum secure direct communication （QSDC） and deterministic secure quantum communication （DSQC） over collective dephasing noisy channel. In our schemes, four special two-qubit states are used as the quantum channel. Since these states are unchanged through the collective dephasing noisy channel, the effect of the channel noise can be perfectly overcome. Simultaneously, the security against some usual attacks can be ensured by utilizing the various checking procedures. Furthermore, these two schemes are feasible with present-day technique.     

Robust Quantum Secure Direct Communication and Deterministic Secure Quantum Communication over Collective Dephasing Noisy Channel

We propose two schemes for quantum secure direct communication (QSDC) and deterministic secure quantum communication (DSQC) over collective dephasing noisy channel. In our schemes, four special two-qubit states are used as the quantum channel. Since these states are unchanged through the collective dephasing noisy channel, the effect of the channel noise can be perfectly overcome. Simultaneously, the security against some usual attacks can be ensured by utilizing the various checking procedures. Furthermore, these two schemes are feasible with present-day technique.     

Secure Communication Based on Quantum Key

We introduce a protocol for QKD based on reusable entangled states. In this protocol, the EPR pairs act as a quantum key to encode and decode information particles. And only an information particle travels between the legitimated users. This improves the security and efficiency of communication. In addition, we show that its extension to a new QSS protocol is also secure and efficient.     

Secure communication based on spatiotemporal chaos

In this paper, we propose a novel approach to secure communication based on spatiotemporal chaos. At the transmitter end, the state variables of the coupled map lattice system are divided into two groups: one is used as the key to encrypt the plaintext in the N-shift encryption function, and the other is used to mix with the output of the N-shift function to further confuse the information to transmit. At the receiver end, the receiver lattices are driven by the received signal to synchronize with the transmitter lattices and an inverse procedure of the encoding is conducted to decode the information.Numerical simulation and experiment based on the TI TMS320C6713 Digital Signal Processor(DSP) show the feasibility and the validity of the proposed scheme.     

Secure Multi-Party Quantum Private Information Query

International Journal of Theoretical Physics - Different from the existing quantum key distribution (QKD)-based quantum private query (QPQ) protocols, we propose a secure multi-party quantum...     

Secure quantum dialogue based on single-photon

In this paper a quantum dialogue scheme is proposed by using N batches of single photons. The same secret message is encoded on each batch of single photons by the sender with two different unitary operations, and then the N batches of single photons are sent to the receiver. After eavesdropping check, the message is encoded on the one remaining batch by the receiver. It is shown that the intercept-and-resend attack and coupling auxiliary modes attack can be resisted more efficiently, because the photons are sent only once in our quantum dialogue scheme.     

Quantum Secure Dialogue with Quantum Encryption

How to solve the information leakage problem has become the research focus of quantum dialogue. In this paper, in order to overcome the information leakage problem in quantum dialogue, a novel approach for sharing the initial quantum state privately between communicators, i.e., quantum encryption sharing, is proposed by utilizing the idea of quantum encryption. The proposed protocol uses EPR pairs as the private quantum key to encrypt and decrypt the traveling photons, which can be repeatedly used after rotation. Due to quantum encryption sharing, the public announcement on the state of the initial quantum state is omitted, thus the information leakage problem is overcome. The information-theoretical efficiency of the proposed protocol is nearly 100%, much higher than previous information leakage resistant quantum dialogue protocols. Moreover, the proposed protocol only needs single-photon measurements and nearly uses single photons as quantum resource so that it is convenient to implement in practice.