2008
DOI: 10.1007/s11433-008-0185-4
|View full text |Cite
|
Sign up to set email alerts
|

Comparing the efficiencies of different detect strategies in the ping-pong protocol

Abstract: The way to compare the efficiencies of different detect strategies (DSs) in the "ping-pong" protocol is studied. The trade-off between information gain and disturbance is calculated and compared for different DSs. The comparison result primely tallies with our intuitional analysis. It is shown that the analysis of this trade-off is a feasible way to compare the performances of different DSs in theory.quantum key distribution, quantum cryptography, quantum secure direct communicationThe task of cryptography is … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
24
0

Year Published

2009
2009
2022
2022

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 29 publications
(24 citation statements)
references
References 39 publications
(48 reference statements)
0
24
0
Order By: Relevance
“…• Ping-pong protocol (and its enhanced variants) (Boström & Felbinger, 2002;Cai & Li, 2004b;Chamoli & Bhandari, 2009;Gao et al, 2008;Ostermeyer & Walenta, 2008;Vasiliu & Nikolaenko, 2009;Vasiliu, 2011). …”
Section: Quantum Secure Direct Communicationmentioning
confidence: 99%
“…• Ping-pong protocol (and its enhanced variants) (Boström & Felbinger, 2002;Cai & Li, 2004b;Chamoli & Bhandari, 2009;Gao et al, 2008;Ostermeyer & Walenta, 2008;Vasiliu & Nikolaenko, 2009;Vasiliu, 2011). …”
Section: Quantum Secure Direct Communicationmentioning
confidence: 99%
“…Since then, to overcome this, scholars [6][7][8][9] in China and abroad have paid great attention to research into quantum computer technology, quantum computation algorithms and quantum cryptology. Grover's algorithm, which offers an exhaustive search of long lists held in a quantum computer, reduces the computational complexity of current exhaustive search attacks from O(2 n ) to O(2 n/2 ), thus raising the security concerns of current crypto-systems to a new level.…”
Section: Label Quantum Search Computation Complexity Ntrumentioning
confidence: 99%
“…In 1992, Deutsch et al [3] designed the first quantum algorithm whose computation capability surpassed that of an electronic computer. Shortly thereafter, Shor's [4] quantum factorization algorithm and Grover's [5] quantum search algorithm added further to the security difficulties associated with modern cryptology.Since then, to overcome this, scholars [6][7][8][9] in China and abroad have paid great attention to research into quantum computer technology, quantum computation algorithms and quantum cryptology. Grover's algorithm, which offers an exhaustive search of long lists held in a quantum computer, reduces the computational complexity of current exhaustive search attacks from O(2 n ) to O(2 n/2 ), thus raising the security concerns of current crypto-systems to a new level.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…Since the pioneering work [2] , various protocols based on different quantum features are proposed, such as quantum key distribution (QKD) [3,4] , quantum secret sharing (QSS) [5,6] , quantum secure direct communication (QSDC) [7,8] and so on. QSDC is a novel branch which allows that the secret is transmitted between users directly without creating a private key in advance.…”
mentioning
confidence: 99%