Smart vehicle applications play a crucial role in intelligent transportation systems, enabling sensor-equipped vehicles to establish dynamic networks for efficient collection, sharing, and aggregation. This significantly enhances road security and efficiency by transmitting crucial information to traffic authorities. However, partial research on certificateless aggregation signcryption (CLAS) scheme reveals an intriguing phenomenon where each proposed scheme consistently exhibits numerous security vulnerabilities, particularly susceptible to public key replacement attacks. To address these challenges, this paper proposes a blockchain-assisted certificateless aggregation sign-cryption scheme (BACLAS), leveraging blockchain technology to securely store users’ public key on a distributed ledger and prevent public key replacement attacks effectively. Furthermore, it is a provably secure communication scheme for real-world Vehicle-to-Infrastructure (V2I) communication while addressing practical security concerns. The BACLAS scheme ensures security in terms of existential unforgeability against adaptive chosen message attacks (EUF-CMA) and indistinguishability against adaptive chosen ciphertext attacks (IND-CCA2) based on the hardness assumption of the elliptic curve discrete logarithm problem and computational Diffie-Hellman problem in the random oracle model. The proposed scheme effectively reduces computational costs and time consumption, resulting in a significant reduction of the computation burden ranging from 50.02% to 88.28% compared to other competitive schemes. Moreover, it successfully addresses the key-escrow problem, thereby achieving enhanced security properties.

With the rapid advancement of wireless communication and autonomous driving technology, vehicular ad hoc networks (VANETs) has emerged as a robust network facilitating interactive communication among vehicles, roadside infrastructure, and the surrounding environment. However, VANETs face challenges regarding traffic information security and vehicle identity privacy during wireless transmission. Vehicles require reliable technology to communicate efficiently and securely with roadside infrastructure, especially at high speeds. To address these issues in VANETs environments characterized by diverse nature of vehicles and roadside units (RSUs), we propose an enhanced certificateless and identity-based offline/online heterogeneous signcryption (CLIOOHSC) scheme for VANETs, aiming to achieve confidentiality, integrity, authentication and identity anonymity simultaneously in a unified step. The CLIOOHSC scheme enables vehicles in certificateless cryptography (CLC) environment to transmit messages to RSU in identity-based cryptography (IBC) environment. In the online phase, scalar multiplication operations are omitted since they are performed in the offline phase, significantly reducing the computational load. Then, through security proofs, we demonstrate that the proposed scheme can achieve the expected security properties. The performance analysis shows that our scheme is superior to other schemes in terms of computation and communication costs and is suitable for scenarios where vehicles communicate across cryptosystems.

As intelligent transportation develops by leaps and bounds, there has been a growing interest in leveraging Vehicular Ad-hoc Networks (VANETs) to improve efficiency and security. One key aspect of them is the Conditional Privacy-Preserving Authentication (CPPA) scheme, which addresses challenges of identity authentication and message integrity during communications. Most ID-Based CPPA schemes rely on Tamper-Proof Devices (TPDs), which are vulnerable to side-channel attacks. If sensitive data stored in TPDs are compromised, the entire system would be in danger. To tackle this issue, Xiong et al. introduced a CPPA scheme with double-insurance, claiming its security against adaptively chosen message attacks. However, this paper reveals that their scheme is universally forgeable, allowing anyone to create valid signatures on any message, rendering it inadequate for CPPA. In light of the weaknesses, we propose a novel scheme that inherits the time-tested Schnorr Signature and Abe-Okamoto Message Recovery Signature. Besides, we prove the security under the assumptions of Discrete Logarithms (DL) and Computational Diffie-Hellman (CDH), and conduct experiments and realistic evaluations. The results demonstrate its superiority, and establish its practicality in real-world scenarios.

Shor proposed a quantum polynomial-time integer factorization algorithm to break the RSA public-key cryptosystem. In this paper, we propose a new quantum algorithm for breaking RSA by computing the order of the RSA ciphertext C. The new algorithm has the following properties: 1) recovering the RSA plaintext M from the ciphertext C without factoring n; 2) avoiding the even order of the element; 3) having higher success probability than Shor’s; 4) having the same complexity as Shor’s.

Shor in 1994 proposed a quantum polynomial-time algorithm for finding the order r of an element a in the multiplicative group Z_n^*, which can be used to factor the integer n by computing [see formula in PDF] and hence break the famous RSA cryptosystem. However, the order r must be even. This restriction can be removed. So in this paper, we propose a quantum polynomial-time fixed-point attack for directly recovering the RSA plaintext M from the ciphertext C, without explicitly factoring the modulus n. Compared to Shor’s algorithm, the order r of the fixed-point C for RSA(e, n) satisfying [see formula in PDF] does not need to be even. Moreover, the success probability of the new algorithm is at least [see formula in PDF] and higher than that of Shor’s algorithm, though the time complexity for both algorithms is about the same.

The integration of Unmanned Aerial Vehicles (UAVs) with the Internet of Things (IoT) is revolutionizing a wide range of applications. However, collecting massive sensing data from large-scale fields efficiently remains challenging, constrained by the limited energy of UAVs and sensing nodes. Existing schemes lack the computational intelligence of an Edge Server (ES) for deep coordination. To address this, we propose DC-CSAP, a novel “Edge-UAV-End” collaborative data collection framework. DC-CSAP introduces a systematic workflow orchestrated by the ES, which is operationalized through four dedicated collaboration mechanisms: (1) In our ES–UAV collaboration, we devise a two-phase path optimization algorithm that hybridizes Simulated Annealing (SA) with a convex-hull-inspired greedy method. (2) The ES–ISN collaboration features a prediction-based binary vector mechanism, transmitting only inaccurate data to slash communication overheads. (3) The UAV–ISN and (4) Inter-ISN protocols ensure efficient data exchange and aggregation. Extensive simulations validate that DC-CSAP outperforms benchmarks in terms of Correct Prediction Rate (CPR), energy efficiency, and UAV path length.