Semi-counterfactual Cryptography

Abstract

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.

6 pages, 1 figure

References in corpus (2)

• Protocol for direct counterfactual quantum communication
• Security of "Counterfactual Quantum Cryptography"

Cited by in corpus (13)

• Modification of "Counterfactual communication protocols" which eliminates weak particle traces
• Analysis of counterfactuality of counterfactual communication protocols
• How Quantum is Quantum Counterfactual Communication?
• Counterfactual quantum certificate authorization
• Unification of Bell, Leggett-Garg and Kochen-Specker inequalities: A hybrid spatio-temporal inequality
• Secure Quantum Communication with Orthogonal States
• Noiseless attack and counterfactual security of quantum key distribution
• Counterfactual distribution of cat states
• Orthogonal-state-based cryptography in quantum mechanics and local post-quantum theories
• Quantum key distribution based on orthogonal state encoding
• Protocols for counterfactual and twin-field quantum digital signature
• Quantum counterfactuality with identical particles
• Violation of space-time Bell-CHSH inequality beyond Tsirelson bound via post selection and quantum cryptography