Distance Lower Bounding

Abstract

Abstract. Distance (upper)-bounding (DUB) allows a verifier to know whether a proving party is located within a certain distance bound. DUB protocols have many applications in secure authentication and location based services. We consider the dual problem of distance lower bounding (DLB), where the prover proves it is outside a distance bound to the verifier. We motivate this problem through a number of application scenarios, and model security against distance fraud (DF), Man-in-theMiddle (MiM), and collusion fraud (CF) attacks. We prove impossibility of security against these attacks without making physical assumptions. We propose approaches to the construction of secure protocols under reasonable assumptions, and give detailed design of our DLB protocol and prove its security using the above model. This is the first treatment of the DLB problem in the untrusted prover setting, with a number of applications and raising new research questions. We discuss our results and propose directions for future research.

Quantum-Resistant Cryptography for the Internet of Things Based on Location-Based Lattices

“…However, studying a number of different attacks about protocols [44], [57], [52], [46], [48], Buhrman et al [6] cited in [23], [24] concluded that the safe positioning (location-verification) task, as well as cryptography based on position, are unattainable in cases where the involved parties exchange quantum data. Although studies such as [6], [23], [57], [52], [33], [38], [58] have mentioned that it is impossible to propose secure position-based cryptography in a typical model or quantum model without constraints, we can propose a secure and advanced position-driven cryptosystem without any constraint by using the lattice problem for the Internet of Moving Things (IoMT) in the pre-and postquantum world and simultaneously resisting quantum attacks and flaws. The proposed cryptographic protocol in this research not only solves the abovementioned problems but also improves the security of wireless networks.…”