SAPHE:基于启发式树的简单加速度计无线配对

B. Groza, R. Mayrhofer
{"title":"SAPHE:基于启发式树的简单加速度计无线配对","authors":"B. Groza, R. Mayrhofer","doi":"10.1145/2428955.2428989","DOIUrl":null,"url":null,"abstract":"Accelerometers provide a good source of entropy for bootstrapping a secure communication channel in autonomous and spontaneous interactions between mobile devices that share a common context but were not previously associated. We propose two simple and efficient key exchange protocols based on accelerometer data that use only simple hash functions combined with heuristic search trees. Using heuristics such as the Euclidean distance proves to be beneficial as it allows a more effective recovery of the shared key. While the first protocol seems to give just some performance improvements, the second, which we call hashed heuristic tree, is more secure than previous proposals since it increases the difference in protocol execution between benign and malicious parties. Nevertheless, the hashed heuristic tree is an entirely new approach which has the advantage of allowing different heuristics in the search, leaving plenty of room for future variants and optimizations.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"40","resultStr":"{\"title\":\"SAPHE: simple accelerometer based wireless pairing with heuristic trees\",\"authors\":\"B. Groza, R. Mayrhofer\",\"doi\":\"10.1145/2428955.2428989\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Accelerometers provide a good source of entropy for bootstrapping a secure communication channel in autonomous and spontaneous interactions between mobile devices that share a common context but were not previously associated. We propose two simple and efficient key exchange protocols based on accelerometer data that use only simple hash functions combined with heuristic search trees. Using heuristics such as the Euclidean distance proves to be beneficial as it allows a more effective recovery of the shared key. While the first protocol seems to give just some performance improvements, the second, which we call hashed heuristic tree, is more secure than previous proposals since it increases the difference in protocol execution between benign and malicious parties. Nevertheless, the hashed heuristic tree is an entirely new approach which has the advantage of allowing different heuristics in the search, leaving plenty of room for future variants and optimizations.\",\"PeriodicalId\":135195,\"journal\":{\"name\":\"Advances in Mobile Multimedia\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"40\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Mobile Multimedia\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2428955.2428989\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Mobile Multimedia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2428955.2428989","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 40

摘要

加速度计提供了一个很好的熵源,用于在共享公共上下文但以前没有关联的移动设备之间的自主和自发交互中引导安全通信通道。我们提出了两种简单有效的基于加速度计数据的密钥交换协议,它们只使用简单的哈希函数和启发式搜索树。使用诸如欧几里得距离之类的启发式方法被证明是有益的,因为它允许更有效地恢复共享密钥。虽然第一个协议似乎只提供了一些性能改进,但第二个协议,我们称之为哈希启发式树,比以前的提议更安全,因为它增加了良性和恶意方之间协议执行的差异。然而,散列启发式树是一种全新的方法,它的优点是允许在搜索中使用不同的启发式方法,为未来的变体和优化留下了足够的空间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
SAPHE: simple accelerometer based wireless pairing with heuristic trees
Accelerometers provide a good source of entropy for bootstrapping a secure communication channel in autonomous and spontaneous interactions between mobile devices that share a common context but were not previously associated. We propose two simple and efficient key exchange protocols based on accelerometer data that use only simple hash functions combined with heuristic search trees. Using heuristics such as the Euclidean distance proves to be beneficial as it allows a more effective recovery of the shared key. While the first protocol seems to give just some performance improvements, the second, which we call hashed heuristic tree, is more secure than previous proposals since it increases the difference in protocol execution between benign and malicious parties. Nevertheless, the hashed heuristic tree is an entirely new approach which has the advantage of allowing different heuristics in the search, leaving plenty of room for future variants and optimizations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信