Position-Based Cryptography from Noisy Channels

We study the problem of constructing secure positioning protocols (Sastry et. al, 2003). Informally, the goal of such protocols is to enable a party P to convince a set of verifiers about P’s location in space, using information about the time it takes P to respond to queries sent from different points. It has been shown by Chandran et al (2009) that in general such task is impossible to achieve if the adversary can position his stations in multiple points in space. Chandran et al proposed to overcome this impossibility result by moving to Maurer’s bounded-storage model. Namely, they construct schemes that are secure under the assumption that the memory of the adversary is bounded. Later Buhrman et al (2010) considered secure positioning protocols schemes in quantum settings.

[1]  Wade Trappe,et al.  Secret Key Extraction from Level Crossings over Unauthenticated Wireless Channels , 2009 .

[2]  Rafail Ostrovsky,et al.  Position Based Cryptography , 2009, CRYPTO.

[3]  Moni Naor,et al.  Nonmalleable Cryptography , 2000, SIAM Rev..

[4]  Ueli Maurer Conditionally-perfect secrecy and a provably-secure randomized cipher , 2004, Journal of Cryptology.

[5]  Rafail Ostrovsky,et al.  Position-Based Quantum Cryptography: Impossibility and Constructions , 2011, IACR Cryptol. ePrint Arch..

[6]  Alessandro Panconesi,et al.  Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .

[7]  David A. Wagner,et al.  Secure verification of location claims , 2003, WiSe '03.

[8]  Elisabeth Oswald,et al.  A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework , 2011, CRYPTO.

[9]  U. Maurer,et al.  Secret key agreement by public discussion from common information , 1993, IEEE Trans. Inf. Theory.

[10]  Shai Halevi Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings , 2009, CRYPTO.

[11]  Srdjan Capkun,et al.  Secure positioning of wireless devices with application to sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[12]  Tor Helleseth,et al.  Advances in Cryptology — EUROCRYPT ’93 , 2001, Lecture Notes in Computer Science.

[13]  Bart Preneel,et al.  Location verification using secure distance bounding protocols , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..