Related papers: Quantum authentication scheme based on algebraic c…
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random string, one of them can transmit a quantum state to the other…
Two fault tolerant authenticated quantum dialogue (AQD) protocols are proposed in this paper by employing logical Bell states as the quantum resource, which combat the collective-dephasing noise and the collective-rotation noise,…
We propose a decision procedure for analysing security of quantum cryptographic protocols, combining a classical algebraic rewrite system for knowledge with an operational semantics for quantum distributed computing. As a test case, we use…
We consider a communication method, where the sender encodes n classical bits into 1 qubit and sends it to the receiver who performs a certain measurement depending on which of the initial bits must be recovered. This procedure is called…
We propose a two-way secure-communication protocol in which Alice uses an amplified spontaneous emission source while Bob employs binary phase-shift keying and an optical amplifier. Against an eavesdropper who captures all the light lost in…
We propose a quantum-enhanced protocol to authenticate classical messages, with improved security with respect to the classical scheme introduced by Brassard in 1983. In that protocol, the shared key is the seed of a pseudo-random generator…
Quantum resources can be more powerful than classical resources - a quantum computer can solve certain problems exponentially faster than a classical computer, and computing a function of two people's inputs can be done with exponentially…
Suppose that Alice and Bob are located in distant laboratories, which are connected by an ideal quantum channel. Suppose further that they share many copies of a quantum state $\rho_{ABE}$, such that Alice possesses the $A$ systems and Bob…
We present two robust quantum key distribution protocols against two kinds of collective noise, following some ideas in quantum dense coding. Three-qubit entangled states are used as quantum information carriers, two of which forming the…
A new approach to quantum cryptography to be called KCQ, keyed communication in quantum noise, is developed on the basis of quantum detection and communication theory for classical information transmission. By the use of a shared secret key…
Quantum secret sharing schemes are a family of quantum cryptographic protocols which provide secure quantum encodings, mapping one secret to multiple shares of information such that the original secret cannot be accessed without an…
We devise a new quantum key distribution scheme that is more efficient than the BB84 protocol. By pre-announcing basis, Alice and Bob are more likely to use the same basis to prepare and measure the qubits, thus achieves a higher…
This paper presents a hybrid cryptographic protocol, using quantum and classical resources, for authentication and authorization in a network. One or more trusted servers distribute streams of entangled photons to individual resources that…
We consider the private classical capacity of a quantum wiretap channel, where the users (sender Alice, receiver Bob, and eavesdropper Eve) have access to the resource of a shared quantum state, additionally to their channel inputs and…
We present a novel approach to secret key establishment that appears to be resistant to currently known quantum cryptanalytic algorithms. This quantum resistance arises because the security of our method does not rely on the difficulty of…
We present a scheme for hiding bits in Bell states that is secure even when the sharers Alice and Bob are allowed to carry out local quantum operations and classical communication. We prove that the information that Alice and Bob can gain…
We show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to…
We introduce a constructive method to calculate the achievable secret key rate for a generic class of quantum key distribution protocols, when only a finite number n of signals is given. Our approach is applicable to all scenarios in which…
We discuss quantum key distribution protocols using quantum continuous variables. We show that such protocols can be made secure against individual gaussian attacks regardless the transmission of the optical line between Alice and Bob. This…
In this paper, we generalize the secure quantum information exchange (SQIE) protocol, originally proposed by the authors [J. Phys. B: At. Mol. Opt. Phys. 44 (2011) 115504] for secure exchange of one qubit information with each of Alice and…