用于距离边界的超宽带快速比特交换系统

Nils Ole Tippenhauer, H. Luecken, M. Kuhn, Srdjan Capkun
{"title":"用于距离边界的超宽带快速比特交换系统","authors":"Nils Ole Tippenhauer, H. Luecken, M. Kuhn, Srdjan Capkun","doi":"10.1145/2766498.2766504","DOIUrl":null,"url":null,"abstract":"Distance bounding protocols enable one device (the verifier) to securely establish an upper bound on its distance to another device (the prover). These protocols can be used for secure location verification and detection of relay attacks, even in presence of strong attackers. The rapid-bit-exchange is the core of distance bounding protocols---the verifier sends single bit challenges, which the prover is expected to answer with minimal and stable processing delay. Based on the measured round trip time of flight, the verifier calculates its upper bound to the prover. Although several aspects of distance bounding implementations have been discussed in the past, no full implementation of a wireless distance bounding system has been presented so far. In this work, we present the first full realization of a rapid bit exchange system for distance bounding. Our system consists of an Ultra-Wideband (UWB) ranging radio and of an efficient digital processing implemented on an Field-Programmable-Gate-Array (FPGA) board; it achieves a ranging accuracy of 7:5 cm and a short processing delay at the prover (< 100 ns). This minimal processing delay is the lowest reported so far for provers that demodulate the challenge before responding.","PeriodicalId":261845,"journal":{"name":"Proceedings of the 8th ACM Conference on Security & Privacy in Wireless and Mobile Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":"{\"title\":\"UWB rapid-bit-exchange system for distance bounding\",\"authors\":\"Nils Ole Tippenhauer, H. Luecken, M. Kuhn, Srdjan Capkun\",\"doi\":\"10.1145/2766498.2766504\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Distance bounding protocols enable one device (the verifier) to securely establish an upper bound on its distance to another device (the prover). These protocols can be used for secure location verification and detection of relay attacks, even in presence of strong attackers. The rapid-bit-exchange is the core of distance bounding protocols---the verifier sends single bit challenges, which the prover is expected to answer with minimal and stable processing delay. Based on the measured round trip time of flight, the verifier calculates its upper bound to the prover. Although several aspects of distance bounding implementations have been discussed in the past, no full implementation of a wireless distance bounding system has been presented so far. In this work, we present the first full realization of a rapid bit exchange system for distance bounding. Our system consists of an Ultra-Wideband (UWB) ranging radio and of an efficient digital processing implemented on an Field-Programmable-Gate-Array (FPGA) board; it achieves a ranging accuracy of 7:5 cm and a short processing delay at the prover (< 100 ns). This minimal processing delay is the lowest reported so far for provers that demodulate the challenge before responding.\",\"PeriodicalId\":261845,\"journal\":{\"name\":\"Proceedings of the 8th ACM Conference on Security & Privacy in Wireless and Mobile Networks\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"32\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 8th ACM Conference on Security & Privacy in Wireless and Mobile Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2766498.2766504\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 8th ACM Conference on Security & Privacy in Wireless and Mobile Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2766498.2766504","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 32

摘要

距离边界协议使一个设备(验证者)能够安全地建立到另一个设备(证明者)的距离上限。这些协议可用于安全的位置验证和中继攻击检测,即使存在强大的攻击者。快速比特交换是距离边界协议的核心——验证者发送单比特挑战,证明者被期望以最小和稳定的处理延迟来回答。根据测量到的往返飞行时间,验证方计算出其与证明方的上界。尽管过去已经讨论了距离边界实现的几个方面,但到目前为止还没有提出无线距离边界系统的完整实现。在这项工作中,我们首次全面实现了用于距离边界的快速比特交换系统。我们的系统由一个超宽带(UWB)测距无线电和一个在现场可编程门阵列(FPGA)板上实现的高效数字处理组成;它实现了7:5 cm的测距精度和短的处理延迟在验证器(< 100 ns)。这个最小的处理延迟是迄今为止报告的在响应之前解调挑战的证明程序的最低处理延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
UWB rapid-bit-exchange system for distance bounding
Distance bounding protocols enable one device (the verifier) to securely establish an upper bound on its distance to another device (the prover). These protocols can be used for secure location verification and detection of relay attacks, even in presence of strong attackers. The rapid-bit-exchange is the core of distance bounding protocols---the verifier sends single bit challenges, which the prover is expected to answer with minimal and stable processing delay. Based on the measured round trip time of flight, the verifier calculates its upper bound to the prover. Although several aspects of distance bounding implementations have been discussed in the past, no full implementation of a wireless distance bounding system has been presented so far. In this work, we present the first full realization of a rapid bit exchange system for distance bounding. Our system consists of an Ultra-Wideband (UWB) ranging radio and of an efficient digital processing implemented on an Field-Programmable-Gate-Array (FPGA) board; it achieves a ranging accuracy of 7:5 cm and a short processing delay at the prover (< 100 ns). This minimal processing delay is the lowest reported so far for provers that demodulate the challenge before responding.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信