一种基于RF-PUF的随机森林分类物联网认证方法

A. Ashtari, A. Shabani, B. Alizadeh
{"title":"一种基于RF-PUF的随机森林分类物联网认证方法","authors":"A. Ashtari, A. Shabani, B. Alizadeh","doi":"10.1109/ISCISC48546.2019.8985161","DOIUrl":null,"url":null,"abstract":"This paper presents a novel RF-PUF based authentication framework which exploits the intrinsic non-idealities in physical characteristic of a device/medium to generate a unique identity for wireless nodes. It also takes the advantage of Random Forest classification to securely identify the sender nodes based on their unique features extracting from already-existing modules in the receiver side. In contrast to the neural network-based schemes, our proposed approach incurs lower design complexity and overheads, while it no longer needs a large amount of preparatory and preprocessing works related to the learning process and adjusting the network parameters. Thus, the overall runtime required to preparing and testing of network is drastically lessened. The experimental results show that the proposed scheme can reach to 100% accuracy in the identification of 225 nodes when a forest network with 100 trees and depth of 20 is developed, posing a negligible overhead on the receiver side. This high accuracy can be nearly achieved even in the presence of channel variations as our approach has less sensitivity to environmental conditions.","PeriodicalId":128407,"journal":{"name":"2019 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A New RF-PUF Based Authentication of Internet of Things Using Random Forest Classification\",\"authors\":\"A. Ashtari, A. Shabani, B. Alizadeh\",\"doi\":\"10.1109/ISCISC48546.2019.8985161\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a novel RF-PUF based authentication framework which exploits the intrinsic non-idealities in physical characteristic of a device/medium to generate a unique identity for wireless nodes. It also takes the advantage of Random Forest classification to securely identify the sender nodes based on their unique features extracting from already-existing modules in the receiver side. In contrast to the neural network-based schemes, our proposed approach incurs lower design complexity and overheads, while it no longer needs a large amount of preparatory and preprocessing works related to the learning process and adjusting the network parameters. Thus, the overall runtime required to preparing and testing of network is drastically lessened. The experimental results show that the proposed scheme can reach to 100% accuracy in the identification of 225 nodes when a forest network with 100 trees and depth of 20 is developed, posing a negligible overhead on the receiver side. This high accuracy can be nearly achieved even in the presence of channel variations as our approach has less sensitivity to environmental conditions.\",\"PeriodicalId\":128407,\"journal\":{\"name\":\"2019 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)\",\"volume\":\"139 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCISC48546.2019.8985161\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCISC48546.2019.8985161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文提出了一种新的基于RF-PUF的认证框架,该框架利用设备/介质物理特性固有的非理想性为无线节点生成唯一的身份。它还利用随机森林分类的优势,根据从接收端已经存在的模块中提取的独特特征,安全地识别发送端节点。与基于神经网络的方案相比,我们提出的方法具有较低的设计复杂度和开销,并且不再需要与学习过程和调整网络参数相关的大量准备和预处理工作。因此,准备和测试网络所需的总体运行时间大大减少。实验结果表明,当建立100棵树、深度为20的森林网络时,该方案对225个节点的识别准确率达到100%,对接收端的开销可以忽略不计。由于我们的方法对环境条件的敏感性较低,因此即使在存在通道变化的情况下,也几乎可以实现这种高精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A New RF-PUF Based Authentication of Internet of Things Using Random Forest Classification
This paper presents a novel RF-PUF based authentication framework which exploits the intrinsic non-idealities in physical characteristic of a device/medium to generate a unique identity for wireless nodes. It also takes the advantage of Random Forest classification to securely identify the sender nodes based on their unique features extracting from already-existing modules in the receiver side. In contrast to the neural network-based schemes, our proposed approach incurs lower design complexity and overheads, while it no longer needs a large amount of preparatory and preprocessing works related to the learning process and adjusting the network parameters. Thus, the overall runtime required to preparing and testing of network is drastically lessened. The experimental results show that the proposed scheme can reach to 100% accuracy in the identification of 225 nodes when a forest network with 100 trees and depth of 20 is developed, posing a negligible overhead on the receiver side. This high accuracy can be nearly achieved even in the presence of channel variations as our approach has less sensitivity to environmental conditions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信