Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4950206 | Future Generation Computer Systems | 2018 | 28 Pages |
Abstract
In this paper, we solve this problem by giving constructions of secure positioning protocol with location privacy in the bounded retrieval model. More precisely, we first explore how to define location privacy, which requires that nearly all parties except the prover, including verifiers and outside attackers, cannot learn any additional information about the exact position of the prover, for secure positioning protocol in the bounded retrieval model. Then we illustrate how to construct protocols satisfying this definition. In particular, we present a construction in the one-dimension setting, which explains the basic idea of our construction, and a construction in the three-dimensions setting, which can capture most practical scenarios. Amazingly, privacy is achieved without introducing additional computation overhead, and our system is as efficient as the one constructed in Chandran et al. (CRYPTO 2009). Besides, based on our proposed secure positioning protocols with location privacy, we also build more advanced cryptographic protocols exploiting location verification, e.g., position based key exchange, position based multi-party computation, position based public key infrastructure, etc., all of which still preserve the location privacy. Finally, we also give a proof of concept implementation of our system, which demonstrates that our system is quite practical in practice.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Rupeng Yang, Qiuliang Xu, Man Ho Au, Zuoxia Yu, Hao Wang, Lu Zhou,