An Efficient SM9 Aggregate Signature Scheme for IoV Based on FPGA

Bolin Zhang, Bin Li, Jiaxin Zhang, Yuanxin Wei, Yunfei Yan, Heru Han, Qinglei Zhou2024 · DOI

TL;DR

This paper presents an efficient SM9 aggregate signature scheme optimized for the Internet of Vehicles (IoV) and implemented on an FPGA. It introduces both fault-tolerant and non-fault-tolerant modes, significantly reducing verification time compared to existing methods by accelerating critical point multiplication operations.

What Problem Does This Paper Address?

The Internet of Vehicles (IoV) is rapidly expanding, leading to an increasing number of vehicles exchanging information. This necessitates efficient and secure signature verification, especially given challenges like communication delays and resource limitations in IoV networks. Traditional signature verification can be a bottleneck, particularly when dealing with a large volume of signatures. Existing aggregate signature schemes, while reducing the number of signatures to verify, still face issues with verification time and potential batch invalidation if even a single signature is faulty. This paper aims to address these challenges by proposing an optimized SM9 aggregate signature scheme that leverages FPGA hardware acceleration and incorporates fault tolerance.

Methods

The core of this work lies in optimizing the SM9 aggregate signature scheme for FPGA implementation. Key techniques include:

  • FPGA Acceleration: The computationally intensive point multiplication operations, crucial for signature verification, are offloaded to an FPGA. This is achieved through a parallel hardware architecture.
  • Parallel Point Multiplication: An eight-way parallel point multiplication architecture is designed. This architecture utilizes the Montgomery point multiplication algorithm and optimizes the data flow for point addition and point doubling modules.
  • Optimized Finite Field Arithmetic: Efficient hardware modules for modular addition, subtraction, multiplication, and inversion are developed. This includes using combinational logic for addition/subtraction, the KOA algorithm for fast modular multiplication, and a binary modular inversion algorithm.
  • Fault-Tolerant Mechanism: The scheme incorporates a fault-tolerant mode based on the uniform(k,n)-set combinatorial theory. This allows the system to handle scenarios where some signatures might be erroneous without requiring individual verification of all signatures.
  • SM9 Algorithm Adaptation: The SM9 identity-based encryption algorithm is adapted for aggregate signatures, with specific optimizations for its verification process.
  • Security Proof: The security of the proposed scheme is analyzed and proven based on the K-ary Computational Additive Diffie-Hellman (K-CAA) difficult problem, demonstrating its resistance to existential forgery.

Datasets

Not discussed in the paper. The evaluation is based on simulations and experimental results on an FPGA platform, using parameters derived from the SM9 Chinese National Standard.

Key Insights and Ideas

  • FPGA is Key for IoV Security: The paper strongly demonstrates that offloading computationally heavy cryptographic operations like point multiplication to FPGAs is crucial for achieving the performance required for real-time IoV applications.
  • Parallelism is Paramount: Simply using aggregate signatures isn't enough; achieving significant speedups requires parallelizing the verification process itself, especially the point multiplication steps, which the FPGA architecture effectively enables.
  • Fault Tolerance Doesn't Have to Be Slow: The introduction of a fault-tolerant mode, while adding some overhead, is shown to be significantly more efficient than individual verification when errors occur, and still competitive even in error-free scenarios compared to some non-fault-tolerant schemes.
  • Modular Design for Efficiency: Breaking down the complex SM9 verification into optimized, reusable hardware modules (like modular arithmetic units and point operation units) is key to achieving high performance.

Key Results

The paper reports significant performance improvements:

  • Non-Fault-Tolerant Mode: Achieves a verification time reduction of up to 97.1% compared to other schemes and 80.9% compared to the original SM9 scheme.
  • Fault-Tolerant Mode: Reduces verification time by up to 77.2% compared to other schemes and is 28.9% of the consumption of a comparable fault-tolerant scheme [35].
  • FPGA vs. Software: The FPGA implementation achieves a computational throughput of approximately 70,776 operations per second for point multiplication, a massive improvement over software implementations which achieve only 551 operations per second.
  • Resource Utilization: The eight-way parallel point multiplication algorithm on FPGA utilizes LUT: 57.48%, FF: 23.38%, DSP: 93.91%.

Limitations and Future Work

  • Limitations:
    • The paper focuses on the SM9 algorithm and its adaptation. While efficient, it's specific to this cryptographic standard.
  • The security proof relies on the K-CAA problem being hard, which is a standard assumption but not a guarantee of absolute security.
  • The current implementation is tested on a specific FPGA platform; performance might vary on different hardware.
  • Future Work:
    • Explore hardware security design for the SM9 parallel point multiplication architecture to prevent side-channel attacks and ensure computational information leakage prevention.
  • Develop new fault-tolerance theories to further optimize the construction speed of fault-tolerant sets.

Summary updated

BibTeX
@misc{zhang2024efficient,
  author = {Bolin Zhang and Bin Li and Jiaxin Zhang and Yuanxin Wei and Yunfei Yan and Heru Han and Qinglei Zhou},
  title = {{An Efficient SM9 Aggregate Signature Scheme for IoV Based on FPGA}},
  year = {2024},
  doi = {10.3390/s24186011},
}
Figure