Related papers: A single-qubit position verification protocol that…
Methods of quantum mechanics promise information-theoretic security for various protocols in cryptography. However, impossibility of some cryptographic applications such as standard bit commitment, oblivious transfer, multiparty secure…
We show that a quantum network can protect the identity of a sender and receiver from an external wiretapper. This new quantum communication protocol, which we call secure quantum routing, requires only single photons routed by linear…
The first generation of multi-qubit quantum technologies will consist of noisy, intermediate-scale devices for which active error correction remains out of reach. To exploit such devices, it is thus imperative to use passive error…
Semi-device-independent quantum protocols realize information tasks - e.g. secure key distribution, random access coding, and randomness generation - in a scenario where no assumption on the internal working of the devices used in the…
We show how shared entanglement, together with classical communication and local quantum operations, can be used to perform an arbitrary collective quantum operation upon N spatially-separated qubits. A simple teleportation-based protocol…
We propose an entanglement-based protocol for two people to simultaneously exchange their messages. We show that the protocol is asymptotically secure against the disturbance attack, the intercept-and-resend attack and the…
With today's quantum processors venturing into regimes beyond the capabilities of classical devices [1-3], we face the challenge to verify that these devices perform as intended, even when we cannot check their results on classical…
This paper introduces a novel device-independent quantum self-testing protocol designed specifically for multipartite quantum communication. By exploiting the quantum rigidity in Bell nonlocality, the protocol enables the certification of…
The study of quantum cryptography and quantum non-locality have traditionnally been based on two-level quantum systems (qubits). In this paper we consider a generalisation of Ekert's cryptographic protocol [Ekert] where qubits are replaced…
Secure communication requires message authentication. In this paper we address the problem of how to authenticate quantum information sent through a quantum channel between two communicating parties with the minimum amount of resources.…
The capability to reliably transmit and store quantum information is an essential building block for future quantum networks and processors. Gauging the ability of a communication link or quantum memory to preserve quantum correlations is…
Verification of quantum computation is a task to efficiently check whether an output given from a quantum computer is correct. Existing verification protocols conducted between a quantum computer to be verified and a verifier necessitate…
Physical unclonable functions have been shown a useful resource of randomness for implementing various cryptographic tasks including entity authentication. All of the related entity authentication protocols that have been discussed in the…
Secure key distribution among two remote parties is impossible when both are classical, unless some unproven (and arguably unrealistic) computation-complexity assumptions are made, such as the difficulty of factorizing large numbers. On the…
Entanglement-measurement attack is one of the most famous attacks against quantum cryptography. In quantum cryptography protocols, eavesdropping checking is an effective means to resist this attack. There are currently two commonly used…
Quantum computing had a profound impact on cryptography. Shor's discovery of an efficient quantum algorithm for factoring large integers implies that many existing classical systems based on computational assumptions can be broken, once a…
A one way partial quantum bit commitment protocol is developed, using states with built-in classical correlation, completely independent of entanglement. It involves concealing information in a set of mutually non-orthogonal states and…
We propose a simple protocol for the verification of quantum computation after the computation has been performed. Our construction can be seen as an improvement on previous results in that it requires only a single prover, who is…
Entanglement-based attacks, which are subtle and powerful, are usually believed to render quantum bit commitment insecure. We point out that the no-go argument leading to this view implicitly assumes the evidence-of-commitment to be a…
Weak coin flipping is among the fundamental cryptographic primitives which ensure the security of modern communication networks. It allows two mistrustful parties to remotely agree on a random bit when they favor opposite outcomes. Unlike…