Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Research Directions Quantum Technologies

What are the full capabilities of relativistic quantum cryptography?

Carl A. Miller

Published Oct 14, 2022• 0 citations
Publisher

Abstract

Quantum cryptography bases its security proofs on physical assumptions. A longstanding observation in the field is that we may be able to do more cryptographic tasks when we assume not only the laws of quantum mechanics but also the impossibility of superluminal signaling (i.e., that information cannot travel faster than the speed of light). Relativistic quantum cryptography takes into account the spatial locations of the parties involved and uses the impossibility of superluminal signaling as a basis for security. Previous efforts in this field have been fruitful, both theoretically and experimentally.

DOI
10.1017/qut.2022.4

Related papers

Quantum Cryptography: A new Approach for Information Security

Debasish Hati, Souradeep Sarkar, Prasun Kr

Quantum cryptography is the art and science of exploiting quantum mechanical propertie s to perform cryptographic tasks. It is a technology that ensures ultimate security. Compared to current cryptography that could be defeated by the development of an ultra high-speed computer, quantum cryptography ensures secure communication because it is based on the fundamental physical laws. It is an emerging technology in which two parties may simultaneously generate shared, secret cryptographic key material using the transmission of quantum states of light. Quantum cryptography is a new method for sec ret communications offering the ultimate security assurance of the inviolability of a Law of Nature. The quantum cryptography relies on two important elements of quantum mechanics -the Heisenberg Uncertainty principle and the principle of photon polarization.

•Jan 1, 2015•1 citation

Quantum Cryptography: Realizing next generation information security

Payal P. Kilor

Quantum cryptography is a technology that ensures ultimate security. Compared to current cryptography that could be defeated by by the development of an ultra high-speed computer, quantum cryptography ensures secure communication because it is based on the fundamental physical laws. It is an emerging technology in which two parties may simultaneously generate shared, secret cryptographic key material using the transmission of quantum states of light. Quantum cryptography is a new method for secret communications offering the ultimate security assurance of the inviolability of a Law of Nature. The quantum cryptography relies relies on two important elements of quantum mechanics-the Heisenberg Uncertainty principle and the principle of photon polarization. This research paper concentrates on the principle of quantum cryptography, and how this technology contributes to the network security. This paper outlines the real world application implementation of this technology and the future direction in which quantum cryptography accelerates.

•Jan 1, 2014•18 citations

Quantum cryptography beyond quantum key distribution

Anne Broadbent, Christian Schaffner

Quantum cryptography is the art and science of exploiting quantum mechanical effects in order to perform cryptographic tasks. While the most well-known example of this discipline is quantum key distribution (QKD), there exist many other applications such as quantum money, randomness generation, secure two- and multi-party computation and delegated quantum computation. Quantum cryptography also studies the limitations and challenges resulting from quantum adversaries-including the impossibility of quantum bit commitment, the difficulty of quantum rewinding and the definition of quantum security models for classical primitives. In this review article, aimed primarily at cryptographers unfamiliar with the quantum world, we survey the area of theoretical quantum cryptography, with an emphasis on the constructions and limitations beyond the realm of QKD.

arXiv:1510.06120•Designs Codes and Cryptography•Dec 21, 2015•271 citations

Practical security of quantum cryptography

Lars Lydersen

The peculiar properties of quantum mechanics enable possibilities not allowed by classical physics. In particular, two parties can generate a random, secret key at a distance, even though an eavesdropper can do anything permitted by the laws of physics. Measuring the quantum properties of the signals generating the key, would ultimately change them, and thus reveal the eavesdropper’s presence. This exchange of a random, secret key is known as quantum cryptography.\n\nQuantum cryptography can be, and has been proven unconditionally secure using perfect devices. However, when quantum cryptography is implemented, one must use components available with current technology. These are usually imperfect. Although the security of quantum cryptography has been proven for components with certain imperfections, the question remains: can quantum cryptography be implemented in a provable, unconditionally secure way, using components available with current technology? This thesis contains both a theoretical, and an experimental contribution to the answer of this question. On the experimental side, components used in, and complete quantum cryptography systems have been carefully examined for security loopholes. In particular, it turned out that two commercial quantum cryptography systems contained loopholes, which would allow an eavesdropper to capture the full secret key, without exposing her presence. Furthermore, this detector control attack could be implemented with current technology. The attack is applicable against a variety of quantum cryptography implementations and protocols.\n\nThe theoretical contribution consists of security proofs for quantum cryptography in a very general setting. Precisely, the security is proven with arbitrary individual imperfections in the source and detectors. These proofs should make it possible to use a wide array of imperfect devices in implementations of quantum cryptography.\n\nFinally, a secure detection scheme is proposed, immune to the detector control attack and compatible with those security proofs. Therefore, if this scheme is implemented correctly, it offers provable security.

•Jan 1, 2011•4 citations

The role of causality in ensuring the ultimate security of relativistic quantum cryptography

S. N. Molotkov, S. S. Nazin

One of the central points of quantum information theory is the problem of ultimate security of quantum cryptography; i.e., the security that is due only to the fundamental laws of nature rather than to technical restrictions. It is shown that a relativistic quantum cryptosystem proposed in this paper is ultimately secure against any eavesdropping attempts. The application of relativistic causality makes it possible to simply prove the security of the cryptosystem. Moreover, because the scheme does not involve collective measurements and quantum codes, it can be experimentally implemented even at the current level of optical fiber technologies.

arXiv:quant-ph/0106046•Journal of Experimental and Theoretical Physics Letters•Jun 1, 2001•1 citation

Practical No-Signalling proof Randomness Amplification using Hardy paradoxes and its experimental implementation

Ravishankar Ramanathan, Michał Horodecki, Hammad Anwer +6 more

Abstract Device-Independent (DI) security is the gold standard of quantum cryptography, providing information-theoretic security based on the very laws of nature. In its highest form, security is guaranteed against adversaries limited only by the no-superluminal signalling rule of relativity. The task of randomness amplification, to generate secure fully uniform bits starting from weakly random seeds, is of both cryptographic and foundational interest, being important for the generation of cryptographically secure random numbers as well as bringing deep connections to the existence of free-will. DI no-signalling proof protocols for this fundamental task have thus far relied on esoteric proofs of non-locality termed pseudo-telepathy games, complicated multi-party setups or high-dimensional quantum systems, and have remained out of reach of experimental implementation. In this paper, we construct the first practically relevant no-signalling proof DI protocols for randomness amplification based on the simplest proofs of Bell non-locality and illustrate them with an experimental implementation in a quantum optical setup using polarised photons. Technically, we relate the problem to the vast field of Hardy paradoxes, without which it would be impossible to achieve amplification of arbitrarily weak sources in the simplest Bell non-locality scenario consisting of two parties choosing between two binary inputs. Furthermore, we identify a deep connection between proofs of the celebrated Kochen-Specker theorem and Hardy paradoxes that enables us to construct Hardy paradoxes with the non-zero probability taking any value in (0,1]. Our methods enable us, under the fair-sampling assumption of the experiment, to realize up to 25 bits of randomness in 20 hours of experimental data collection from an initial private source of randomness 0.1 away from uniform.

arXiv:1810.11648•Sep 11, 2020•27 citations
Quantum cryptography bases its security proofs on physical assumptions. A longstanding observation in the field is that we may be able to do more cryptographic tasks when we assume not only the laws of quantum mechanics but also the impossibility of superluminal signaling (i.e., that information cannot travel faster than the speed of light). Relativistic quantum cryptography takes into account the spatial locations of the parties involved and uses the impossibility of superluminal signaling as a basis for security. Previous efforts in this field have been fruitful, both theoretically and experimentally.
Quantum cryptography is the art and science of exploiting quantum mechanical propertie s to perform cryptographic tasks. It is a technology that ensures ultimate security. Compared to current cryptography that could be defeated by the development of an ultra high-speed computer, quantum cryptography ensures secure communication because it is based on the fundamental physical laws. It is an emerging technology in which two parties may simultaneously generate shared, secret cryptographic key material using the transmission of quantum states of light. Quantum cryptography is a new method for sec ret communications offering the ultimate security assurance of the inviolability of a Law of Nature. The quantum cryptography relies on two important elements of quantum mechanics -the Heisenberg Uncertainty principle and the principle of photon polarization.
Quantum cryptography is a technology that ensures ultimate security. Compared to current cryptography that could be defeated by by the development of an ultra high-speed computer, quantum cryptography ensures secure communication because it is based on the fundamental physical laws. It is an emerging technology in which two parties may simultaneously generate shared, secret cryptographic key material using the transmission of quantum states of light. Quantum cryptography is a new method for secret communications offering the ultimate security assurance of the inviolability of a Law of Nature. The quantum cryptography relies relies on two important elements of quantum mechanics-the Heisenberg Uncertainty principle and the principle of photon polarization. This research paper concentrates on the principle of quantum cryptography, and how this technology contributes to the network security. This paper outlines the real world application implementation of this technology and the future direction in which quantum cryptography accelerates.
Quantum cryptography is the art and science of exploiting quantum mechanical effects in order to perform cryptographic tasks. While the most well-known example of this discipline is quantum key distribution (QKD), there exist many other applications such as quantum money, randomness generation, secure two- and multi-party computation and delegated quantum computation. Quantum cryptography also studies the limitations and challenges resulting from quantum adversaries-including the impossibility of quantum bit commitment, the difficulty of quantum rewinding and the definition of quantum security models for classical primitives. In this review article, aimed primarily at cryptographers unfamiliar with the quantum world, we survey the area of theoretical quantum cryptography, with an emphasis on the constructions and limitations beyond the realm of QKD.
The peculiar properties of quantum mechanics enable possibilities not allowed by classical physics. In particular, two parties can generate a random, secret key at a distance, even though an eavesdropper can do anything permitted by the laws of physics. Measuring the quantum properties of the signals generating the key, would ultimately change them, and thus reveal the eavesdropper’s presence. This exchange of a random, secret key is known as quantum cryptography.\n\nQuantum cryptography can be, and has been proven unconditionally secure using perfect devices. However, when quantum cryptography is implemented, one must use components available with current technology. These are usually imperfect. Although the security of quantum cryptography has been proven for components with certain imperfections, the question remains: can quantum cryptography be implemented in a provable, unconditionally secure way, using components available with current technology? This thesis contains both a theoretical, and an experimental contribution to the answer of this question. On the experimental side, components used in, and complete quantum cryptography systems have been carefully examined for security loopholes. In particular, it turned out that two commercial quantum cryptography systems contained loopholes, which would allow an eavesdropper to capture the full secret key, without exposing her presence. Furthermore, this detector control attack could be implemented with current technology. The attack is applicable against a variety of quantum cryptography implementations and protocols.\n\nThe theoretical contribution consists of security proofs for quantum cryptography in a very general setting. Precisely, the security is proven with arbitrary individual imperfections in the source and detectors. These proofs should make it possible to use a wide array of imperfect devices in implementations of quantum cryptography.\n\nFinally, a secure detection scheme is proposed, immune to the detector control attack and compatible with those security proofs. Therefore, if this scheme is implemented correctly, it offers provable security.
One of the central points of quantum information theory is the problem of ultimate security of quantum cryptography; i.e., the security that is due only to the fundamental laws of nature rather than to technical restrictions. It is shown that a relativistic quantum cryptosystem proposed in this paper is ultimately secure against any eavesdropping attempts. The application of relativistic causality makes it possible to simply prove the security of the cryptosystem. Moreover, because the scheme does not involve collective measurements and quantum codes, it can be experimentally implemented even at the current level of optical fiber technologies.
Abstract Device-Independent (DI) security is the gold standard of quantum cryptography, providing information-theoretic security based on the very laws of nature. In its highest form, security is guaranteed against adversaries limited only by the no-superluminal signalling rule of relativity. The task of randomness amplification, to generate secure fully uniform bits starting from weakly random seeds, is of both cryptographic and foundational interest, being important for the generation of cryptographically secure random numbers as well as bringing deep connections to the existence of free-will. DI no-signalling proof protocols for this fundamental task have thus far relied on esoteric proofs of non-locality termed pseudo-telepathy games, complicated multi-party setups or high-dimensional quantum systems, and have remained out of reach of experimental implementation. In this paper, we construct the first practically relevant no-signalling proof DI protocols for randomness amplification based on the simplest proofs of Bell non-locality and illustrate them with an experimental implementation in a quantum optical setup using polarised photons. Technically, we relate the problem to the vast field of Hardy paradoxes, without which it would be impossible to achieve amplification of arbitrarily weak sources in the simplest Bell non-locality scenario consisting of two parties choosing between two binary inputs. Furthermore, we identify a deep connection between proofs of the celebrated Kochen-Specker theorem and Hardy paradoxes that enables us to construct Hardy paradoxes with the non-zero probability taking any value in (0,1]. Our methods enable us, under the fair-sampling assumption of the experiment, to realize up to 25 bits of randomness in 20 hours of experimental data collection from an initial private source of randomness 0.1 away from uniform.