Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2411.01380

Help | Advanced Search

Computer Science > Cryptography and Security

arXiv:2411.01380 (cs)
[Submitted on 2 Nov 2024 ]

Title: Signer-Optimal Multiple-Time Post-Quantum Hash-Based Signature for Heterogeneous IoT Systems

Title: 异构物联网系统的签名者最优多时间后量子哈希基签名

Authors:Kiarash Sedghighadikolaei, Attila A. Yavuz, Saif E. Nouma
Abstract: Heterogeneous Internet of Things (IoTs) harboring resource-limited devices like wearable sensors are essential for next-generation networks. Ensuring the authentication and integrity of security-sensitive telemetry in these applications is vital. Digital signatures provide scalable authentication with non-repudiation and public verifiability, making them essential tools for IoTs. However, emerging quantum computers necessitate post-quantum (PQ) secure solutions, yet existing NIST-PQC standards are costlier than their conventional counterparts and unsuitable for resource-limited IoTs. There is a significant need for lightweight PQ-secure digital signatures that respect the resource constraints of low-end IoTs. We propose a new multiple-time hash-based signature called Maximum Utilization Multiple HORS (MUM-HORS) that offers PQ security, short signatures, fast signing, and high key utilization for an extended lifespan. MUM-HORS addresses the inefficiency and key loss issues of HORS in offline/online settings by introducing compact key management data structures and optimized resistance to weak-message attacks. We tested MUM-HORS on two embedded platforms (ARM Cortex A-72 and 8-bit AVR ATmega2560) and commodity hardware. Our experiments confirm up to 40x better utilization with the same signing capacity (2^20 messages, 128-bit security) compared to multiple-time HORS while achieving 2x and 156-2463x faster signing than conventional-secure and NIST PQ-secure schemes, respectively, on an ARM Cortex. These features make MUM-HORS ideal multiple-time PQ-secure signature for heterogeneous IoTs.
Abstract: 承载资源受限设备(如可穿戴传感器)的异构物联网(IoTs)对于下一代网络至关重要。 确保这些应用中安全敏感遥测的身份验证和完整性至关重要。 数字签名提供了可扩展的身份验证,并具备不可否认性和公钥验证性,使其成为IoTs的重要工具。 然而,新兴的量子计算机需要后量子(PQ)安全解决方案,但现有的NIST-PQC标准比传统的方案成本更高,且不适合资源受限的IoTs。 迫切需要一种轻量级的PQ安全数字签名,以符合低端IoTs的资源限制。 我们提出了一种新的多次哈希基签名,称为最大利用率多重HORS(MUM-HORS),它提供了PQ安全性、短签名、快速签名以及高密钥利用率以延长使用寿命。 通过引入紧凑型密钥管理数据结构和优化对弱消息攻击的抵抗能力,MUM-HORS解决了HORS在离线/在线设置中的效率低下和密钥丢失问题。 我们在两个嵌入式平台(ARM Cortex A-72 和 8位AVR ATmega2560)以及通用硬件上测试了MUM-HORS。 我们的实验表明,与多次HORS相比,在相同的签名容量(2^20条消息,128位安全性)下,MUM-HORS的利用率提高了40倍;在ARM Cortex上,其签名速度分别是传统安全方案的2倍和NIST PQ安全方案的156-2463倍。 这些特性使MUM-HORS成为异构IoTs的理想多次PQ安全签名方案。
Subjects: Cryptography and Security (cs.CR) ; Systems and Control (eess.SY)
Cite as: arXiv:2411.01380 [cs.CR]
  (or arXiv:2411.01380v1 [cs.CR] for this version)
  https://doi.org/10.48550/arXiv.2411.01380
arXiv-issued DOI via DataCite

Submission history

From: Kiarash Sedghighadikolaei [view email]
[v1] Sat, 2 Nov 2024 23:11:16 UTC (1,056 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.CR
< prev   |   next >
new | recent | 2024-11
Change to browse by:
cs
cs.SY
eess
eess.SY

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号