in which one transfers one qubit from Alice to Bob by communicating two classical bits, as long as Alice and Bob have a pre-shared Bell pair. The transmission...

and y {\displaystyle y} , with the least amount of communication between them. While Alice and Bob can always succeed by having Bob send his whole n {\displaystyle...

and Alice and Bob is shown in the figure below. The Alice and Bob and the corresponding components. The schematic representation of the Alice and Bob robots...

secret keys of Alice and Bob are denoted by a and b respectively, with public keys A and B, as well as the ephemeral key pairs x, X and y, Y. Then protocol...

identifier X sent back (in cleartext) from Alice to Bob, but has no way to map that to the secret key Y that Bob and Alice are now using for their ongoing communication...

probability 1/2; if Bob (subscript "B") also measured his qubit, the outcome would be the same as for Alice. Thus, Alice and Bob would each seemingly...

protocol. Alice computes point ( x k , y k ) = d A ⋅ Q B {\displaystyle (x_{k},y_{k})=d_{\text{A}}\cdot Q_{\text{B}}} . Bob computes point ( x k , y k ) =...

c=E(k;m)} Alice transmits (in a single message) both the public ephemeral g y {\displaystyle g^{y}} and the ciphertext c {\displaystyle c} . Bob, knowing...

y ∈ { 0 , 1 } {\displaystyle x,y\in \{0,1\}} uniformly at random, and then sends x {\displaystyle x} to Alice and y {\displaystyle y} to Bob. Alice and...

signature to Bob. Bob verifies Alice's signature. Formally: (1) Alice → Bob : x (2) Alice ← Bob : y, SB(y, x) (3) Alice → Bob : SA(x, y) This protocol...