Suppr超能文献

基于安全物理不可克隆功能的认证系统。

Secure PUF-Based Authentication Systems.

作者信息

Tun Naing Win, Mambo Masahiro

机构信息

Division of Electrical Engineering and Computer Science, Graduate School of Natural Science and Technology, Kanazawa University, Kanazawa 920-1192, Ishikawa, Japan.

Institute of Science and Engineering, Kanazawa University, Kanazawa 920-1192, Ishikawa, Japan.

出版信息

Sensors (Basel). 2024 Aug 15;24(16):5295. doi: 10.3390/s24165295.

Abstract

The Internet of Things faces significant security challenges, particularly in device authentication. Traditional methods of PUF-based authentication protocols do not fully address IoT's unique security needs and resource constraints. Existing solutions like Identity-Based Encryption with Physically Unclonable Functions enhance security but still struggle with protecting data during transmission. We show a new protocol that leverages PUFs for device authentication by utilizing Paillier homomorphic encryption or the plaintext equality test to enhance security. Our approach involves encrypting both the challenge-response pairs (CRPs) using Paillier homomorphic encryption scheme or ElGamal encryption for plaintext equality testing scheme. The verifier does not need access to the plaintext CRPs to ensure that sensitive data remain encrypted at all times and our approach reduces the computational load on IoT devices. The encryption ensures that neither the challenge nor the response can be deciphered by potential adversaries who obtain them during the transmission. The homomorphic property of the Paillier scheme or plaintext equality testing scheme allows a verifier to verify device authenticity without decrypting the CRPs, preserving privacy and reducing the computational load on IoT devices. Such an approach to encrypting both elements of the CRP provides resistance against CRP disclosure, machine learning attacks, and impersonation attacks. We validate the scheme through security analysis against various attacks and evaluate its performance by analyzing the computational overhead and the communication overhead. Comparison of average computational and communication time demonstrates Paillier scheme achieves approximately 99% reduction while the plaintext equality test achieves approximately 94% reduction between them.

摘要

物联网面临重大安全挑战,尤其是在设备认证方面。基于物理不可克隆函数(PUF)的传统认证协议方法不能完全满足物联网独特的安全需求和资源限制。诸如基于身份的加密与物理不可克隆函数等现有解决方案增强了安全性,但在传输过程中保护数据方面仍存在困难。我们展示了一种新协议,该协议通过利用Paillier同态加密或明文相等性测试来利用PUF进行设备认证,以增强安全性。我们的方法包括使用Paillier同态加密方案对挑战-响应对(CRP)进行加密,或者使用ElGamal加密进行明文相等性测试方案。验证者无需访问明文CRP,以确保敏感数据始终保持加密状态,并且我们的方法减少了物联网设备的计算负载。加密确保在传输过程中获取挑战或响应的潜在对手无法解密它们。Paillier方案或明文相等性测试方案的同态属性允许验证者在不解密CRP的情况下验证设备的真实性,保护隐私并减少物联网设备的计算负载。这种对CRP的两个元素进行加密的方法能够抵御CRP泄露、机器学习攻击和假冒攻击。我们通过针对各种攻击的安全分析来验证该方案,并通过分析计算开销和通信开销来评估其性能。平均计算时间和通信时间的比较表明,Paillier方案实现了约99%的减少,而明文相等性测试实现了约94%的减少。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d069/11487452/88f558280d6f/sensors-24-05295-g0A1.jpg

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验