随机选择基站的安全位置验证

Matthew Holiday, N. Mittal, S. Venkatesan
{"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}
引用次数: 8

摘要

在某些网络中,移动节点必须既安全又准确地定位。定位的一种方法是基站使用到达时间差乘法。攻击者可以在不同的时间向不同的方向进行传输,可以伪造其相对于已知基站的位置。先前的工作建议隐藏基站,遵循“通过模糊实现安全”的模型。我们建议随机选择一组基站,这样即使它们的位置已知,攻击者在一次试验中最多有50%的成功机会。通过迭代,我们将成功的可能性降低到任意小的概率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信