# Forensics System for Internet of Vehicles Based on Post-Quantum Blockchain

## TL;DR

This paper introduces a blockchain-based system for vehicle networks that uses quantum-resistant cryptography to improve data security and privacy.

## Contribution

The novel integration of lattice cryptography and ring signatures into blockchain for secure and efficient IoV forensics.

## Key findings

- The proposed system achieves privacy protection and traceability using lattice cryptography and ring signatures.
- DualRing technology significantly reduces computational time and storage consumption for ring signatures.
- Simulation results show improved computational efficiency with signature and verification times of 65.76 ms and 21.46 ms for 256 ring members.

## Abstract

Internet of Vehicles (IoV) serves as the data support for intelligent transportation systems, and the information security of the IoV is of paramount importance. In view of the problems of centralized processing, easy information leakage, and weak anti-interference ability in traditional vehicle networking systems, this paper proposes a blockchain architecture suitable for IoV forensics scenario. By leveraging the decentralized, distributed storage and tamper-proof capabilities of blockchain, it solves the privacy protection and data security issues of the system. Considering the threat of quantum computing to the encryption technology in traditional blockchain, this paper integrates lattice cryptography and ring signatures into digital signature technology, achieving privacy protection and traceability of the signer’s identity. To enhance the efficiency of lattice-based cryptographic algorithms, the DualRing technology is introduced, which reduces the computational time and storage consumption of ring signatures. Theoretical analysis has proved the correctness, anonymity, unlinkability, and traceability of the proposed scheme, which is applicable to the IoV forensics system. Simulation comparisons demonstrated that the proposed scheme significantly improves computational efficiency and reduces storage overhead. When the number of ring members is 256, the signature and verification times require only 65.76 ms and 21.46 ms, respectively.