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

arXiv:1402.2250 · Physical Review A

Counterfactual quantum certificate authorization

Akshata Shenoy H., R. Srikanth, T. Srinivas

Published May 8, 2014• 19 citations
arXivHTMLPDF

Abstract

We present a multipartite protocol in a counterfactual paradigm. In counterfactual quantum cryptography, secure information is transmitted between two spatially separated parties even when there is no physical travel of particles transferring the information between them. We propose here a tripartite counterfactual quantum protocol for the task of certificate authorization. Here a trusted third party, Alice, authenticates an entity Bob (e.g., a bank) that a client Charlie wishes to securely transact with. The protocol is counterfactual with respect to either Bob or Charlie. We prove its security against a general incoherent attack, where Eve attacks single particles.

DOI
10.1103/physreva.89.052307

Related papers

Fully counterfactual quantum communication protocols within a twin-field framework

Na Hai, zijian Liu, Bowen Zhang +4 more

Counterfactual communication refers to cases in which information is exchanged between two remote parties without actual transmission of physical particles. We propose a fully tripartite counterfactual quantum protocol for the task of identity authentication. Here, a trusted certificate authority (Charlie) enables a client (Alice) and an entity (Bob) to share a secure random key based on the modification of early protocols by Aharonov and Vaidman, therefore permitting communication that is counterfactual according to the two-state vector formalism. The protocol has high robustness against environmental noise, while still passing the Fisher information test. With semi-honest Charlie, the counterfactual protocol transforms identity authorization into quantum-assisted key distribution. We show that the counterfactual quantum key distribution can be made secure within a twin-field framework. Our simulation results show that the maximal secure distance of the counterfactual protocol with a practical weak coherent state is around 190 km.

Optics Express•Jan 8, 2026•0 citations

Tripartite counterfactual quantum cryptography

Hatim Salih

We show how two distrustful parties, ``Bob'' and ``Charlie,'' can share a secret key with the help of a mutually trusted ``Alice'' counterfactually; that is, with no information-carrying particles traveling between any of the three.

arXiv:1404.5540•Physical Review A•Jul 24, 2014•33 citations

Semi-counterfactual cryptography

Akshata Shenoy H., R. Srikanth, T. Srinivas

In counterfactual quantum key distribution (QKD), two remote parties can securely share random polarization-encoded bits through the blocking rather than the transmission of particles. We propose a semi-counterfactual QKD, i.e. , one where the secret bit is shared, and also encoded, based on the blocking or non-blocking of a particle. The scheme is thus semi-counterfactual and not based on polarization encoding. As with other counterfactual schemes and the Goldenberg-Vaidman protocol, but unlike BB84, the encoding states are orthogonal and security arises ultimately from single-particle non-locality. Unlike any of them, however, the secret bit generated is maximally indeterminate until the joint action of Alice and Bob. We prove the general security of the protocol, and study the most general photon-number–preserving incoherent attack in detail.

arXiv:1307.7551•Europhysics Letters (EPL)•Sep 1, 2013•18 citations

Experimental realization of counterfactual quantum cryptography

G. Brida, Andrea Cavanna, Ivo Pietro Degiovanni +2 more

In counterfactual quantum key distribution (CQKD) information is transferred, in a secure way, between Alice and Bob even when no particle carrying the information is in fact transmitted between them. In this letter we fully implement the scheme for CQKD proposed in [1], demonstrating for the first time that information can be transmitted between two parties without the transmission of a carrier.

arXiv:1107.5467•Laser Physics Letters•Jan 16, 2012•57 citations

Counterfactual quantum key distribution without polarization encoding

Akshata Shenoy H., R. Srikanth, Srinivas Talabattula

In counterfactual quantum key distribution (QKD), two remote parties can share a secure \nsecret random key even without transmission of a physical particle (a non-vacuum pulse) through the \nchannel. A QKD scheme is proposed which is counterfactual in one of the bits, and in which the secret bits \nare not encoded in the polarization, but in the joint action of Alice and Bob. On the conceptual level, our \nscheme throws new light on the origin of security in counterfactual cryptography. On the practical side, \nnon-polarization encoding makes it robust against certain trojan horse attacks. We study the the general \nphoton-number preserving incoherent attack in detail.

•Jan 1, 2013•4 citations

Role of Nonlocality and Counterfactuality in Quantum Cryptography

H Akshatha Shenoy

Quantum cryptography is arguably the most successfully applied area of quantum information theory. In this work, We invsetigate the role of quantum indistinguishability in random number generation, quantum temporal correlations, quantum nonlocality and counterfactuality for quantum cryptography. We study quantum protocols for key distribution, and their security in the conventional setting, in the counterfactual paradigm, and finally also in the device-independent scenario as applied to prepare-and-measure schemes. We begin with the interplay of two essential non-classical features like quantum indeterminism and quantum indistinguishability via a process known as bosonic stimulation is discussed. It is observed that the process provides an efficient method for macroscopic extraction of quantum randomness. Next, we propose two counterfactual cryptographic protocols, in which a secret key bit is generated even without the physical transmission of a particle. The first protocol is semicounterfactual in the sense that only one of the key bits is generated using interaction-free measurement. This protocol departs fundamentally from the original counterfactual key distribution protocol in not encoding secret bits in terms of photon polarization. We discuss how the security in the protocol originates from quantum single-particle non-locality. The second protocol is designed for the crypto-task of certificate authorization, where a trusted third party authenticates an entity (e.g., bank) to a client. We analyze the security of both protocols under various general incoherent attack models. The next part of our work includes study of quantum temporal correlations. We consider the use of the Leggett-Garg inequalities for device-independent security appropriate for prepare-and-measure protocols subjected to the higher dimensional attack that would completely undermine standard BB84. In the last part, we introduce the novel concept of nonlocal subspaces constructed using the graph state formalism, and propose their application for quantum information splitting. In particular, we use the stabilizer formalism of graph states to construct degenerate Bell operators, whose eigenspace determines the nonlocal subspace, into which a quantum secret is encoded and shared among an authorized group of agents, or securely transmitted to a designated secret retriever. The security of our scheme arises from the monogamy of quantum correlations. The quantum violation of the Bell-type inequality here is to its algebraic maximum, making this approach inherently suitable for the device-independent scenario.

•Jan 1, 2014•0 citations
We present a multipartite protocol in a counterfactual paradigm. In counterfactual quantum cryptography, secure information is transmitted between two spatially separated parties even when there is no physical travel of particles transferring the information between them. We propose here a tripartite counterfactual quantum protocol for the task of certificate authorization. Here a trusted third party, Alice, authenticates an entity Bob (e.g., a bank) that a client Charlie wishes to securely transact with. The protocol is counterfactual with respect to either Bob or Charlie. We prove its security against a general incoherent attack, where Eve attacks single particles.
Counterfactual communication refers to cases in which information is exchanged between two remote parties without actual transmission of physical particles. We propose a fully tripartite counterfactual quantum protocol for the task of identity authentication. Here, a trusted certificate authority (Charlie) enables a client (Alice) and an entity (Bob) to share a secure random key based on the modification of early protocols by Aharonov and Vaidman, therefore permitting communication that is counterfactual according to the two-state vector formalism. The protocol has high robustness against environmental noise, while still passing the Fisher information test. With semi-honest Charlie, the counterfactual protocol transforms identity authorization into quantum-assisted key distribution. We show that the counterfactual quantum key distribution can be made secure within a twin-field framework. Our simulation results show that the maximal secure distance of the counterfactual protocol with a practical weak coherent state is around 190 km.
In counterfactual quantum key distribution (QKD), two remote parties can securely share random polarization-encoded bits through the blocking rather than the transmission of particles. We propose a semi-counterfactual QKD, i.e. , one where the secret bit is shared, and also encoded, based on the blocking or non-blocking of a particle. The scheme is thus semi-counterfactual and not based on polarization encoding. As with other counterfactual schemes and the Goldenberg-Vaidman protocol, but unlike BB84, the encoding states are orthogonal and security arises ultimately from single-particle non-locality. Unlike any of them, however, the secret bit generated is maximally indeterminate until the joint action of Alice and Bob. We prove the general security of the protocol, and study the most general photon-number–preserving incoherent attack in detail.
In counterfactual quantum key distribution (QKD), two remote parties can share a secure \nsecret random key even without transmission of a physical particle (a non-vacuum pulse) through the \nchannel. A QKD scheme is proposed which is counterfactual in one of the bits, and in which the secret bits \nare not encoded in the polarization, but in the joint action of Alice and Bob. On the conceptual level, our \nscheme throws new light on the origin of security in counterfactual cryptography. On the practical side, \nnon-polarization encoding makes it robust against certain trojan horse attacks. We study the the general \nphoton-number preserving incoherent attack in detail.
Quantum cryptography is arguably the most successfully applied area of quantum information theory. In this work, We invsetigate the role of quantum indistinguishability in random number generation, quantum temporal correlations, quantum nonlocality and counterfactuality for quantum cryptography. We study quantum protocols for key distribution, and their security in the conventional setting, in the counterfactual paradigm, and finally also in the device-independent scenario as applied to prepare-and-measure schemes. We begin with the interplay of two essential non-classical features like quantum indeterminism and quantum indistinguishability via a process known as bosonic stimulation is discussed. It is observed that the process provides an efficient method for macroscopic extraction of quantum randomness. Next, we propose two counterfactual cryptographic protocols, in which a secret key bit is generated even without the physical transmission of a particle. The first protocol is semicounterfactual in the sense that only one of the key bits is generated using interaction-free measurement. This protocol departs fundamentally from the original counterfactual key distribution protocol in not encoding secret bits in terms of photon polarization. We discuss how the security in the protocol originates from quantum single-particle non-locality. The second protocol is designed for the crypto-task of certificate authorization, where a trusted third party authenticates an entity (e.g., bank) to a client. We analyze the security of both protocols under various general incoherent attack models. The next part of our work includes study of quantum temporal correlations. We consider the use of the Leggett-Garg inequalities for device-independent security appropriate for prepare-and-measure protocols subjected to the higher dimensional attack that would completely undermine standard BB84. In the last part, we introduce the novel concept of nonlocal subspaces constructed using the graph state formalism, and propose their application for quantum information splitting. In particular, we use the stabilizer formalism of graph states to construct degenerate Bell operators, whose eigenspace determines the nonlocal subspace, into which a quantum secret is encoded and shared among an authorized group of agents, or securely transmitted to a designated secret retriever. The security of our scheme arises from the monogamy of quantum correlations. The quantum violation of the Bell-type inequality here is to its algebraic maximum, making this approach inherently suitable for the device-independent scenario.