pith. sign in

arxiv: 1406.3013 · v4 · pith:4MJF3S4Vnew · submitted 2014-06-11 · 🪐 quant-ph

Secure positioning and non-local correlations

classification 🪐 quant-ph
keywords secureproverschemeverifiersnon-localposition-verificationpositioningcorrelations
0
0 comments X
read the original abstract

Recently, the problem of secure position-verification has been extensively analyzed in a formal notion where distant verifiers send encrypted challenge along with the decryption information to the prover. However, currently it is known that all the existing position-verification scheme are insecure and secure positioning is impossible. We propose here a different notion for position-verification where distant verifiers determine the actions of the prover through non-local correlations generated by local measurements at the provers site. The proposed scheme guarantees secure positioning even if the verifiers do not have any pre-shared data with the prover, position is the only credential of the prover. Our proposed scheme is secure in general and evades known quantum attacks based on instantaneous non-local computations in particular. The scheme enables verifiers to identify dishonest provers with very high probability , where n is the number of entangled pairs used.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.