The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
A scheme for secure direct communication using EPR pairs and teleportation
Open accessAbstract
Abstract.A novel scheme for secure direct communication between Alice and Bob is proposed, where there is no need for establishing a shared secret key. The communication is based on Einstein-Podolsky-Rosen (EPR) pairs and teleportation between Alice and Bob. After insuring the security of the quantum channel (EPR pairs), Bob encodes the secret message directly on a sequence of particle states and transmits them to Alice by teleportation. In this scheme teleportation transmits Bob’s message without revealing any information to a potential eavesdropper. Alice can read out the encoded messages directly by the measurement on her qubits. Because there is not a transmission of the qubit which carries the secret message between Alice and Bob, it is completely secure for direct secret communication if perfect quantum channel is used.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
Experimental quantum teleportation
Bouwmeester, D., Pan, J.-W., Mattle, K., Eibl, M., Weinfurter, H., & Zeilinger, A. (1997) · Nature · doi:10.1038/37539 · Cited by 5,545
Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
Bennett, C. H., & Wiesner, S. J. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2881 · Cited by 5,470
Quantum cryptography using any two nonorthogonal states
Bennett, C. H. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.3121 · Cited by 3,028
Quantum cryptography without Bell’s theorem
Bennett, C. H., Brassard, G., & Mermin, N. D. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.557 · Cited by 2,460
Boschi, D., Branca, S., De Martini, F., Hardy, L., & Popescu, S. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.1121 · Cited by 1,777
Two-step quantum direct communication protocol using the Einstein-Podolsky-Rosen pair block
Deng, F.-G., Long, G. L., & Liu, X.-S. (2003) · Physical Review A · doi:10.1103/physreva.68.042317 · Cited by 1,771
Theoretically efficient high-capacity quantum-key-distribution scheme
Long, G. L., & Liu, X. S. (2002) · Physical Review A · doi:10.1103/physreva.65.032302 · Cited by 1,741
Deterministic Secure Direct Communication Using Entanglement
Boström, K., & Felbinger, T. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.187902 · Cited by 1,072
Cited by
Quantum secure direct communication with high-dimension quantum superdense coding
Wang, C., Deng, F.-G., Li, Y.-S., Liu, X.-S., & Long, G. L. (2005) · Physical Review A · doi:10.1103/physreva.71.044305 · Cited by 935
Improving the security of multiparty quantum secret sharing against Trojan horse attack
Deng, F.-G., Li, X.-H., Zhou, H.-Y., & Zhang, Z.-J. (2005) · Physical Review A · doi:10.1103/physreva.72.044302 · Cited by 578
Li, X.-H., Deng, F.-G., & Zhou, H.-Y. (2006) · Physical Review A · doi:10.1103/physreva.74.054302 · Cited by 485
Deng, F.-G., Li, X.-H., Li, C.-Y., Zhou, P., & Zhou, H.-Y. (2005) · Physical Review A · doi:10.1103/physreva.72.044301 · Cited by 462
Low Earth Orbit Satellite Security and Reliability: Issues, Solutions, and the Road Ahead
Yue, P., An, J., Zhang, J., Ye, J., Pan, G., Wang, S., Xiao, P., & Hanzo, L. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3296160 · Cited by 291
Metadata
- Authors
- Yan, F. L., & Zhang, X. Q.
- Venue
- The European Physical Journal B
- Published
- 2004-09
- Volume
- 41
- Issue
- 1
- Pages
- 75-78
- ISSN
- 1434-6028 (ISSN-L)
- 1434-6036
- OpenAlex
- W2040462370
- Cited by
- 301
- References
- 25
- FWCI
- 17.62
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A scheme for secure direct communication using EPR pairs and teleportation. https://app.cochat.ai/papers/10.1140/epjb/e2004-00296-4
- The paper
- Yan, F. L., & Zhang, X. Q. (2004). A scheme for secure direct communication using EPR pairs and teleportation. The European Physical Journal B. https://doi.org/10.1140/epjb/e2004-00296-4
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
