Issue |
EPL
Volume 103, Number 6, September 2013
|
|
---|---|---|
Article Number | 60008 | |
Number of page(s) | 6 | |
Section | General | |
DOI | https://doi.org/10.1209/0295-5075/103/60008 | |
Published online | 22 October 2013 |
Semi-counterfactual cryptography
1 ECE Department, IISc - Bangalore, India
2 Poornaprajna Institute of Scientific Research - Bangalore, India
3 Raman Research Institute - Bangalore, India
Received: 10 August 2013
Accepted: 23 September 2013
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.
PACS: 03.67.Dd – Quantum cryptography and communication security / 03.65.Ta – Foundations of quantum mechanics; measurement theory / 03.67.Hk – Quantum communication
© EPLA, 2013
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.