PrOLoc: Resilient Localization with Private Observers Using Partial Homomorphic Encryption

被引:38
作者
Alanwar, Amr [1 ]
Shoukry, Yasser [1 ,2 ]
Chakraborty, Supriyo [3 ]
Martin, Paul [1 ]
Tabuada, Paulo [1 ]
Srivastava, Mani [1 ]
机构
[1] Univ Calif Los Angeles, Los Angeles, CA 90095 USA
[2] Univ Calif Berkeley, Berkeley, CA 94720 USA
[3] IBM TJ Watson Res Lab, Yorktown Hts, NY USA
来源
2017 16TH ACM/IEEE INTERNATIONAL CONFERENCE ON INFORMATION PROCESSING IN SENSOR NETWORKS (IPSN) | 2017年
基金
美国国家科学基金会;
关键词
Secure localization; privacy; homomorphic encryption; Paillier cryptosystem;
D O I
10.1145/3055031.3055080
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Aided by advances in sensors and algorithms, systems for localizing and tracking target objects or events have become ubiquitous in recent years. Most of these systems operate on the principle of fusing measurements of distance and/or direction to the target made by a set of spatially distributed observers using sensors that measure signals such as RF, acoustic, or optical. The computation of the target's location is done using multilateration and multiangulation algorithms, typically running at an aggregation node that, in addition to the distance/direction measurements, also needs to know the observers' locations. This presents a privacy risk for an observer that does not trust the aggregation node or other observers and could in turn lead to lack of participation. For example, consider a crowd-sourced sensing system where citizens are required to report security threats, or a smart car, stranded with a malfunctioning GPS, sending out localization requests to neighboring cars - in both cases, observer (i.e., citizens and cars respectively) participation can be increased by keeping their location private. This paper presents PrOLoc, a localization system that combines partially homomorphic encryption with a new way of structuring the localization problem to enable efficient and accurate computation of a target's location without requiring observers to make public their locations or measurements. Moreover, and unlike previously proposed perturbation based techniques, PrOLoc is also resilient to malicious active false data injection attacks. We present two realizations of our approach, provide rigorous theoretical guarantees, and also compare the performance of each against traditional methods. Our experiments on real hardware demonstrate that PrOLoc yields location estimates that are accurate while being at least 500x faster than state-of-art secure function evaluation techniques.
引用
收藏
页码:41 / 52
页数:12
相关论文
共 34 条
  • [1] [Anonymous], 2015, P 22 ANN NETW DISTR
  • [2] [Anonymous], 2009, P C USENIX SEC S
  • [3] [Anonymous], P 24 ANN INT C THEOR
  • [4] [Anonymous], IEEE T SUST ENERGY
  • [5] [Anonymous], 2002, IPTPS 01
  • [6] Bogdanov Dan., 2012, INT C FINANCIAL CRYP, P57
  • [7] Optimal Geo-Indistinguishable Mechanisms for Location Privacy
    Bordenabe, Nicolas E.
    Chatzikokolakis, Konstantinos
    Palamidessi, Catuscia
    [J]. CCS'14: PROCEEDINGS OF THE 21ST ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2014, : 251 - 262
  • [8] Boyle J.P., 1986, LECTURE NOTES STATIS, P28, DOI DOI 10.1007/978-1-4613-9940-7_3
  • [9] Capkun S., 2006, Secure RSS-based Localization in Sensor Networks
  • [10] FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
    Ducas, Leo
    Micciancio, Daniele
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2015, PT I, 2015, 9056 : 617 - 640