首页> 外文会议>SAI Computing Conference >A graph matching algorithm for user authentication in data networks using image-based physical unclonable functions
【24h】

A graph matching algorithm for user authentication in data networks using image-based physical unclonable functions

机译:使用基于图像的物理不可克隆函数在数据网络中进行用户身份验证的图匹配算法

获取原文

摘要

Recently, Physically Unclonable Functions (PUFs) received considerable attention in order to developing security mechanisms for applications such as Internet of Things (IoT) by exploiting the natural randomness in device-specific characteristics. This approach complements and improves the conventional security algorithms that are vulnerable to security attacks due to recent advances in computational technology and fully automated hacking systems. In this project, we propose a new authentication mechanism based on a specific implementation of PUF using metallic dendrites. Dendrites are nanomaterial devices that contain unique, complex and unclonable patterns (similar to human DNAs). We propose a method to process dendrite images. The proposed framework comprises several steps including denoising, skeletonizing, pruning and feature points extraction. The feature points are represented in terms of a tree-based weighted algorithm that converts the authentication problem to a graph matching problem. The test object is compared against a database of valid patterns using a novel algorithm to perform user identification and authentication. The proposed method demonstrates a high level of accuracy and a low computational complexity that grows linearly with the number of extracted points and database size. It also significantly reduces the required in-network storage capacity and communication rates to maintain database of users in large-scale networks.
机译:近来,物理上不可克隆的功能(PUF)受到了相当大的关注,以便通过利用特定于设备的特性中的自然随机性来开发诸如物联网(IoT)之类的应用程序的安全机制。这种方法补充并改进了由于计算技术和全自动黑客系统的最新发展而易于受到安全攻击的传统安全算法。在这个项目中,我们提出了一种新的身份验证机制,该机制基于使用金属树突的PUF的特定实现。树突是包含独特,复杂和不可克隆的模式(类似于人类DNA)的纳米材料设备。我们提出了一种处理枝晶图像的方法。所提出的框架包括几个步骤,包括去噪,去骨架,修剪和特征点提取。用基于树的加权算法表示特征点,该算法将身份验证问题转换为图匹配问题。使用新颖的算法将测试对象与有效模式的数据库进行比较,以执行用户识别和身份验证。所提出的方法显示出较高的准确性和较低的计算复杂度,并且随着提取的点数和数据库大小的增加而线性增长。它还显着降低了在大型网络中维护用户数据库所需的网络内存储容量和通信速率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号