PADS: Practical Attestation for Highly Dynamic Swarm Topologies

Moreno Ambrosin, M. Conti, R. Lazzeretti, Md Masoom Rabbani, Silvio Ranise
{"title":"PADS: Practical Attestation for Highly Dynamic Swarm Topologies","authors":"Moreno Ambrosin, M. Conti, R. Lazzeretti, Md Masoom Rabbani, Silvio Ranise","doi":"10.1109/SIoT.2018.00009","DOIUrl":null,"url":null,"abstract":"Remote attestation protocols are widely used to detect device configuration (e.g., software and/or data) compromise in Internet of Things (IoT) scenarios. Unfortunately, the performances of such protocols are unsatisfactory when dealing with thousands of smart devices. Recently, researchers are focusing on addressing this limitation. The approach is to run attestation in a collective way, with the goal of reducing computation and communication. Despite these advances, current solutions for attestation are still unsatisfactory because of their complex management and strict assumptions concerning the topology (e.g., being time invariant or maintaining a fixed topology). In this paper, we propose PADS, a secure, efficient, and practical protocol for attesting potentially large networks of smart devices with unstructured or dynamic topologies. PADS builds upon the recent concept of non-interactive attestation, by reducing the collective attestation problem into a minimum consensus one. We compare PADS with a state-of-the art collective attestation protocol and validate it by using realistic simulations that show practicality and efficiency. The results confirm the suitability of PADS for low-end devices, and highly unstructured networks.","PeriodicalId":447072,"journal":{"name":"2018 International Workshop on Secure Internet of Things (SIoT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Workshop on Secure Internet of Things (SIoT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIoT.2018.00009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 30

Abstract

Remote attestation protocols are widely used to detect device configuration (e.g., software and/or data) compromise in Internet of Things (IoT) scenarios. Unfortunately, the performances of such protocols are unsatisfactory when dealing with thousands of smart devices. Recently, researchers are focusing on addressing this limitation. The approach is to run attestation in a collective way, with the goal of reducing computation and communication. Despite these advances, current solutions for attestation are still unsatisfactory because of their complex management and strict assumptions concerning the topology (e.g., being time invariant or maintaining a fixed topology). In this paper, we propose PADS, a secure, efficient, and practical protocol for attesting potentially large networks of smart devices with unstructured or dynamic topologies. PADS builds upon the recent concept of non-interactive attestation, by reducing the collective attestation problem into a minimum consensus one. We compare PADS with a state-of-the art collective attestation protocol and validate it by using realistic simulations that show practicality and efficiency. The results confirm the suitability of PADS for low-end devices, and highly unstructured networks.
高度动态群拓扑的实用证明
远程认证协议被广泛用于检测设备配置(例如,软件和/或数据)在物联网(IoT)场景中的危害。不幸的是,当处理成千上万的智能设备时,这些协议的性能并不令人满意。最近,研究人员正致力于解决这一限制。该方法是以集体方式运行认证,目的是减少计算和通信。尽管取得了这些进展,但目前的证明解决方案仍然令人不满意,因为它们的管理复杂,并且对拓扑有严格的假设(例如,保持时不变或保持固定的拓扑)。在本文中,我们提出了一种安全、高效和实用的协议PADS,用于证明具有非结构化或动态拓扑的潜在大型智能设备网络。PADS建立在最近的非交互式认证概念的基础上,通过将集体认证问题减少到最小共识问题。我们将PADS与最先进的集体认证协议进行比较,并通过使用显示实用性和效率的现实模拟来验证它。结果证实垫是否适合低端设备,和高度非结构化网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信