Proves a 3/4 upper bound on the success probability of unentangled attacks
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.
The results in this paper imply a $\ln(2) \approx 0.69$ upper bound on the success probability of unentangled attacks
Studies QPV based on Bell states, GHZ states and entanglement swapping. Studies the effect of noise/decoherence
Studies a version of the protocol with separable inputs. Proves full loss tolerance and studies practical implementation based on decoy states
Proves insecurity of QPV protocols that were previously claimed secure and studies general principle underlying entanglement attacks. Studies variations of QPV protocols based on Bell/GHZ states and shows that using eigenstates other than Pauli $X$, $Y$, $Z$ leads to protocols that need >1 EPR pair to be attacked