Related papers: Towards practical quantum position verification
It is well known that quantum technology allows for an unprecedented level of data and software protection for quantum computers as well as for quantum-assisted classical computers. To exploit these properties, probabilistic one-time…
Performing complex cryptographic tasks will be an essential element in future quantum communication networks. These tasks are based on a handful of fundamental primitives, such as coin flipping, where two distrustful parties wish to agree…
Cryptography with quantum states exhibits a number of surprising and counterintuitive features. In a 2002 work, Barnum et al. argue that these features imply that digital signatures for quantum states are impossible (Barnum et al., FOCS…
A central challenge in data security is not just preventing theft, but detecting whether it has occurred. Classically, this is impossible because a perfect copy leaves no evidence. Quantum mechanics, on the other hand, forbids general…
We consider a new model for the testing of untrusted quantum devices, consisting of a single polynomial-time bounded quantum device interacting with a classical polynomial-time verifier. In this model we propose solutions to two tasks - a…
In this note, we observe that quantum logspace computations are verifiable by classical logspace algorithms, with unconditional security. More precisely, every language in BQL has an (information-theoretically secure) streaming proof with a…
It is natural in a quantum network system that multiple users intend to send their quantum message to their respective receivers, which is called a multiple unicast quantum network. We propose a canonical method to derive a secure quantum…
Quantum computers will change the cryptographic panorama. A technology once believed to lay far away into the future is increasingly closer to real world applications. Quantum computers will break the algorithms used in our public key…
Continuous-variable quantum information, encoded into infinite-dimensional quantum systems, is a promising platform for the realization of many quantum information protocols, including quantum computation, quantum metrology, quantum…
A cryptographic algorithm is proposed based on fully quantum mechanical keys and ciphers. Encryption and decryption are carried out via an appropriate measurement process on entangled states as governed by a quantum mechanical, asymmetrical…
Cryptographic group actions are a leading contender for post-quantum cryptography, and have also been used in the development of quantum cryptographic protocols. In this work, we explore quantum state group actions, which consist of a group…
We show that a quantum walk process can be used to construct and secure quantum memory. More precisely, we show that a localized quantum walk with temporal disorder can be engineered to store the information of a single, unknown qubit on a…
We demonstrate that a necessary precondition for unconditionally secure quantum key distribution is that sender and receiver can use the available measurement results to prove the presence of entanglement in a quantum state that is…
Quantum inspired protocols e.g. [AAV13,AG17] attempt to achieve a single-prover interactive protocol where a classical machine can verify quantum computations in an information-theoretically secure manner. We define a family of protocols…
Modern communication strives towards provably secure systems which can be widely deployed. Quantum key distribution provides a methodology to verify the integrity and security of a key exchange based on physical laws. However, physical…
We implement an experiment on a photonic quantum processor establishing efficacy of the elementary quantum system in classical information storage. The advantage is established by considering a class of simple bipartite games played with…
Bell nonlocality between distant quantum systems---i.e., joint correlations which violate a Bell inequality---can be verified without trusting the measurement devices used, nor those performing the measurements. This leads to…
A test of quantumness is a protocol where a classical user issues challenges to a quantum device to determine if it exhibits non-classical behavior, under certain cryptographic assumptions. Recent attempts to implement such tests on current…
We prove the unconditional security of an entanglement-based quantum-key-distribution protocol using detectors that respond to multiple modes of light and cannot distinguish between one from two or more photons. Even with such practical…
We present a protocol for quantum cryptographic network consisting of a quantum network center and many users, in which any pair of parties with members chosen from the whole users on request can secure a quantum key distribution by help of…