Limits...
Security of modified Ping-Pong protocol in noisy and lossy channel.

Han YG, Yin ZQ, Li HW, Chen W, Wang S, Guo GC, Han ZF - Sci Rep (2014)

Bottom Line: Although this protocol was proposed in 2002, its security in the noisy and lossy channel has not been proven.In this report, we add a simple and experimentally feasible modification to the original PP protocol, and prove the security of this modified PP protocol against collective attacks when the noisy and lossy channel is taken into account.Simulation results show that our protocol is practical.

View Article: PubMed Central - PubMed

Affiliation: 1] Key Laboratory of Quantum Information, University of Science and Technology of China, Hefei 230026, China [2] Synergetic Innovation Center of Quantum Information & Quantum Physics, University of Science and Technology of China, Hefei, Anhui 230026, China [3].

ABSTRACT
The "Ping-Pong" (PP) protocol is a two-way quantum key protocol based on entanglement. In this protocol, Bob prepares one maximally entangled pair of qubits, and sends one qubit to Alice. Then, Alice performs some necessary operations on this qubit and sends it back to Bob. Although this protocol was proposed in 2002, its security in the noisy and lossy channel has not been proven. In this report, we add a simple and experimentally feasible modification to the original PP protocol, and prove the security of this modified PP protocol against collective attacks when the noisy and lossy channel is taken into account. Simulation results show that our protocol is practical.

No MeSH data available.


Coding system of modified PP protocol.There are two modes: message mode(solid line) and control mode(dash line) in the operations of Alice and Bob. In message mode, if Alice wants to encode bit 0, she will randomly perform I0 or I1. If Alice wants to encode bit 1, she will randomly perform Y0 or Y1. The operations are defined as I0{/v〉, /0〉, /1〉} = {/v〉, /0〉, /1〉}, I1{/v〉, /0〉, /1〉} = {/v〉, −/0〉, −/1〉}, Y0{/v〉, /0〉, /1〉} = {/v〉, /0〉, −/1〉}, Y1{/v〉, /0〉, /1〉} = {/v〉, −/0〉, /1〉}. BSM is for Bell-states measurement, and Z represents the measurement defined by projectors {/v〉〈v/, /0〉〈0/, /1〉〈1/}.
© Copyright Policy - open-access
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC4017212&req=5

f1: Coding system of modified PP protocol.There are two modes: message mode(solid line) and control mode(dash line) in the operations of Alice and Bob. In message mode, if Alice wants to encode bit 0, she will randomly perform I0 or I1. If Alice wants to encode bit 1, she will randomly perform Y0 or Y1. The operations are defined as I0{/v〉, /0〉, /1〉} = {/v〉, /0〉, /1〉}, I1{/v〉, /0〉, /1〉} = {/v〉, −/0〉, −/1〉}, Y0{/v〉, /0〉, /1〉} = {/v〉, /0〉, −/1〉}, Y1{/v〉, /0〉, /1〉} = {/v〉, −/0〉, /1〉}. BSM is for Bell-states measurement, and Z represents the measurement defined by projectors {/v〉〈v/, /0〉〈0/, /1〉〈1/}.

Mentions: The protocol flow is illustrated in Fig. 1.


Security of modified Ping-Pong protocol in noisy and lossy channel.

Han YG, Yin ZQ, Li HW, Chen W, Wang S, Guo GC, Han ZF - Sci Rep (2014)

Coding system of modified PP protocol.There are two modes: message mode(solid line) and control mode(dash line) in the operations of Alice and Bob. In message mode, if Alice wants to encode bit 0, she will randomly perform I0 or I1. If Alice wants to encode bit 1, she will randomly perform Y0 or Y1. The operations are defined as I0{/v〉, /0〉, /1〉} = {/v〉, /0〉, /1〉}, I1{/v〉, /0〉, /1〉} = {/v〉, −/0〉, −/1〉}, Y0{/v〉, /0〉, /1〉} = {/v〉, /0〉, −/1〉}, Y1{/v〉, /0〉, /1〉} = {/v〉, −/0〉, /1〉}. BSM is for Bell-states measurement, and Z represents the measurement defined by projectors {/v〉〈v/, /0〉〈0/, /1〉〈1/}.
© Copyright Policy - open-access
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC4017212&req=5

f1: Coding system of modified PP protocol.There are two modes: message mode(solid line) and control mode(dash line) in the operations of Alice and Bob. In message mode, if Alice wants to encode bit 0, she will randomly perform I0 or I1. If Alice wants to encode bit 1, she will randomly perform Y0 or Y1. The operations are defined as I0{/v〉, /0〉, /1〉} = {/v〉, /0〉, /1〉}, I1{/v〉, /0〉, /1〉} = {/v〉, −/0〉, −/1〉}, Y0{/v〉, /0〉, /1〉} = {/v〉, /0〉, −/1〉}, Y1{/v〉, /0〉, /1〉} = {/v〉, −/0〉, /1〉}. BSM is for Bell-states measurement, and Z represents the measurement defined by projectors {/v〉〈v/, /0〉〈0/, /1〉〈1/}.
Mentions: The protocol flow is illustrated in Fig. 1.

Bottom Line: Although this protocol was proposed in 2002, its security in the noisy and lossy channel has not been proven.In this report, we add a simple and experimentally feasible modification to the original PP protocol, and prove the security of this modified PP protocol against collective attacks when the noisy and lossy channel is taken into account.Simulation results show that our protocol is practical.

View Article: PubMed Central - PubMed

Affiliation: 1] Key Laboratory of Quantum Information, University of Science and Technology of China, Hefei 230026, China [2] Synergetic Innovation Center of Quantum Information & Quantum Physics, University of Science and Technology of China, Hefei, Anhui 230026, China [3].

ABSTRACT
The "Ping-Pong" (PP) protocol is a two-way quantum key protocol based on entanglement. In this protocol, Bob prepares one maximally entangled pair of qubits, and sends one qubit to Alice. Then, Alice performs some necessary operations on this qubit and sends it back to Bob. Although this protocol was proposed in 2002, its security in the noisy and lossy channel has not been proven. In this report, we add a simple and experimentally feasible modification to the original PP protocol, and prove the security of this modified PP protocol against collective attacks when the noisy and lossy channel is taken into account. Simulation results show that our protocol is practical.

No MeSH data available.