{"title":"随机选择基站的安全位置验证","authors":"Matthew Holiday, N. Mittal, S. Venkatesan","doi":"10.1109/ICDCSW.2011.44","DOIUrl":null,"url":null,"abstract":"In some networks, a mobile node must be located securely as well as accurately. One way to locate is for base stations to use time-difference-of-arrival multilateration. An attacker that can transmit at different times in different directions may falsify its position with respect to known base stations. Previous work proposed hiding the base stations, following a model of \"security through obscurity.\" We propose randomly selecting a set of base stations such that even if their locations are known, the attacker has at most a 50% chance of succeeding in one trial. Through iteration we reduce the likelihood of success to an arbitrarily small probability.","PeriodicalId":133514,"journal":{"name":"2011 31st International Conference on Distributed Computing Systems Workshops","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Secure Location Verification with Randomly-Selected Base Stations\",\"authors\":\"Matthew Holiday, N. Mittal, S. Venkatesan\",\"doi\":\"10.1109/ICDCSW.2011.44\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In some networks, a mobile node must be located securely as well as accurately. One way to locate is for base stations to use time-difference-of-arrival multilateration. An attacker that can transmit at different times in different directions may falsify its position with respect to known base stations. Previous work proposed hiding the base stations, following a model of \\\"security through obscurity.\\\" We propose randomly selecting a set of base stations such that even if their locations are known, the attacker has at most a 50% chance of succeeding in one trial. Through iteration we reduce the likelihood of success to an arbitrarily small probability.\",\"PeriodicalId\":133514,\"journal\":{\"name\":\"2011 31st International Conference on Distributed Computing Systems Workshops\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 31st International Conference on Distributed Computing Systems Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCSW.2011.44\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 31st International Conference on Distributed Computing Systems Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCSW.2011.44","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Secure Location Verification with Randomly-Selected Base Stations
In some networks, a mobile node must be located securely as well as accurately. One way to locate is for base stations to use time-difference-of-arrival multilateration. An attacker that can transmit at different times in different directions may falsify its position with respect to known base stations. Previous work proposed hiding the base stations, following a model of "security through obscurity." We propose randomly selecting a set of base stations such that even if their locations are known, the attacker has at most a 50% chance of succeeding in one trial. Through iteration we reduce the likelihood of success to an arbitrarily small probability.