{"title":"抗克隆网络单元识别","authors":"W. Adi","doi":"10.1109/ICCW.2009.5208013","DOIUrl":null,"url":null,"abstract":"Contemporary networks are lacking resilient identification for their participating entities as switches, hosts, terminals, mobile devices and others. Replacement attacks on such units represent a major security gap in many environments and applications. A provable and un-clonable physical unit identity was not an essential security requirement in most contemporary networks due to flexibility requirements avoiding expected increase in hardware complexity and the difficulty to cope with additional system identity. There has been also no essential necessarily for it in most practical operation. However, this missing physical security represents today serious threat as false network units could allow untraceable attacks. Once a network entity can be physically replaced by another fake unit, many denial of service attacks, intrusion and man-in-the-middle attacks become quite easy. Recently, \"Physical Unclonable Functions\" PUFs were proposed to generate unclonable physical identity (6), (7), (8). PUFs however are costly, complex to manage and exhibit inconsistent reproducibility due to aging and drifts as in voltage and temperature. In this work a practically hard to clone structures for network physical entities are proposed based on clone-resistant evolving dynamic identity concept. Units can be securely traced in an operating network in such a way that it is virtually infeasible to clone due to practical reasons. The proposed technique is combining the time scale as a true irreversible \"one-way function\" together with the transaction profile in the system environment to come up with practically unclonable identity after a short operation time. The paper demonstrates a sample scenario including new core cryptographic primitives towards creating and managing such clone-resistant identity in contemporary network units. Keywords-identification; network security; clone-resistant Identity; authentication","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Clone-Resistant Network Unit Identification\",\"authors\":\"W. Adi\",\"doi\":\"10.1109/ICCW.2009.5208013\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Contemporary networks are lacking resilient identification for their participating entities as switches, hosts, terminals, mobile devices and others. Replacement attacks on such units represent a major security gap in many environments and applications. A provable and un-clonable physical unit identity was not an essential security requirement in most contemporary networks due to flexibility requirements avoiding expected increase in hardware complexity and the difficulty to cope with additional system identity. There has been also no essential necessarily for it in most practical operation. However, this missing physical security represents today serious threat as false network units could allow untraceable attacks. Once a network entity can be physically replaced by another fake unit, many denial of service attacks, intrusion and man-in-the-middle attacks become quite easy. Recently, \\\"Physical Unclonable Functions\\\" PUFs were proposed to generate unclonable physical identity (6), (7), (8). PUFs however are costly, complex to manage and exhibit inconsistent reproducibility due to aging and drifts as in voltage and temperature. In this work a practically hard to clone structures for network physical entities are proposed based on clone-resistant evolving dynamic identity concept. Units can be securely traced in an operating network in such a way that it is virtually infeasible to clone due to practical reasons. The proposed technique is combining the time scale as a true irreversible \\\"one-way function\\\" together with the transaction profile in the system environment to come up with practically unclonable identity after a short operation time. The paper demonstrates a sample scenario including new core cryptographic primitives towards creating and managing such clone-resistant identity in contemporary network units. Keywords-identification; network security; clone-resistant Identity; authentication\",\"PeriodicalId\":271067,\"journal\":{\"name\":\"2009 IEEE International Conference on Communications Workshops\",\"volume\":\"113 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Conference on Communications Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCW.2009.5208013\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Communications Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2009.5208013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

当代网络缺乏对交换机、主机、终端、移动设备等参与实体的弹性识别。对这些单元的替换攻击在许多环境和应用程序中代表了一个主要的安全漏洞。在大多数当代网络中,可证明的和不可克隆的物理单元标识并不是基本的安全要求,因为灵活性要求避免硬件复杂性的预期增加和处理额外系统标识的困难。在大多数实际操作中,也没有必要使用它。然而,这种缺失的物理安全性在今天代表了严重的威胁,因为虚假的网络单元可能允许无法追踪的攻击。一旦网络实体可以被另一个假单元物理替换,许多拒绝服务攻击、入侵和中间人攻击就变得相当容易。最近,“物理不可克隆功能”puf被提出来产生不可克隆的物理身份(6),(7),(8)。然而,puf成本高,管理复杂,并且由于老化和电压和温度的漂移而表现出不一致的可重复性。本文基于抗克隆演化动态同一性概念,提出了一种难以克隆的网络物理实体结构。单元可以在运行网络中安全地跟踪,这样由于实际原因,克隆实际上是不可行的。所提出的技术是将时间尺度作为真正不可逆的“单向函数”与系统环境中的事务概况相结合,在短时间内得到实际上不可克隆的身份。本文演示了一个示例场景,包括在当代网络单元中创建和管理这种抗克隆身份的新核心加密原语。Keywords-identification;网络安全;clone-resistant身份;身份验证
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Clone-Resistant Network Unit Identification
Contemporary networks are lacking resilient identification for their participating entities as switches, hosts, terminals, mobile devices and others. Replacement attacks on such units represent a major security gap in many environments and applications. A provable and un-clonable physical unit identity was not an essential security requirement in most contemporary networks due to flexibility requirements avoiding expected increase in hardware complexity and the difficulty to cope with additional system identity. There has been also no essential necessarily for it in most practical operation. However, this missing physical security represents today serious threat as false network units could allow untraceable attacks. Once a network entity can be physically replaced by another fake unit, many denial of service attacks, intrusion and man-in-the-middle attacks become quite easy. Recently, "Physical Unclonable Functions" PUFs were proposed to generate unclonable physical identity (6), (7), (8). PUFs however are costly, complex to manage and exhibit inconsistent reproducibility due to aging and drifts as in voltage and temperature. In this work a practically hard to clone structures for network physical entities are proposed based on clone-resistant evolving dynamic identity concept. Units can be securely traced in an operating network in such a way that it is virtually infeasible to clone due to practical reasons. The proposed technique is combining the time scale as a true irreversible "one-way function" together with the transaction profile in the system environment to come up with practically unclonable identity after a short operation time. The paper demonstrates a sample scenario including new core cryptographic primitives towards creating and managing such clone-resistant identity in contemporary network units. Keywords-identification; network security; clone-resistant Identity; authentication
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Preserving Privacy in Assistive Technologies Multiuser MIMO-OFDMA with Different QoS Using a Prioritized Channel Adaptive Technique Energy-Efficient Multiaccess Dissemination Networks Cognitive Pilot Channel Enabling Spectrum Awareness High-Performance Indoor Localization with Full-Band GSM Fingerprints
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1