EUVIMEDEUVIMED entdecken
Crossref

Post-Quantum Verifiable Decryption for Secure and Scalable V2I Communication in Consumer Driven-Intelligent Transportation Systems

Mahmood Alsaadi, Hamad Aldawsari, Bhavani Prasad Kasaraneni, Krishna Kanth Kondapaka, Swaroop Reddy Gayam, Praveen Thuniki, Sudharshan Putha, Pardayeva Zulfizar Alimovna, Sheifali Gupta

IEEE Transactions on Consumer Electronics · 2025-11 · 71 (4) · 11248-11257

DOI: 10.1109/tce.2025.3593587 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Consumer Electronics, 2025-11. Verfasst von Mahmood Alsaadi und 8 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 27 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Efficient cryptographic verification methods are critical for secure communication in intelligent transportation systems (ITS), especially with the proliferation of Internet of Vehicles (IoV) devices powered by consumer technology. However, traditional zero-knowledge proofs often face efficiency limitations. This paper proposes a novel verifiable decryption scheme for IoV applications within ITS, leveraging the Module Learning with Errors (MLWE) and Module Small Integer Solution (MSIS) problems to address these challenges using widely available consumer technology platforms. The scheme integrates a compression function tailored for IoV devices and consumer technology in intelligent transportation systems, coupled with error estimation techniques, effectively mitigating disparities in equality relationships between the private data of the prover and verifier during the encryption and decryption process. This enables the prover to selectively share partial information, reducing discrepancies and transforming the verifiable decryption problem into a proof that a vector in the ring satisfies a linear relationship. A rigorous theoretical analysis demonstrates the scheme’s correctness, security, communication overhead, and computational complexity, reducing its soundness and zero-knowledge properties to the hardness assumption of the MSIS problem. The paper also recommends two parameter sets for different security levels that are feasible for deployment on consumer technology devices. To evaluate the scheme’s practicality, a C-language implementation was developed and tested on typical consumer technology hardware. Experimental results show significant advantages in proof size and computation time for a single ciphertext compared to existing schemes, making the proposed method highly efficient for ITS scenarios. This verifiable decryption scheme offers a post-quantum cryptographic solution that ensures secure, efficient, and scalable data exchange, aligning with the stringent demands of intelligent transportation systems and leveraging the accessibility of consumer technology.

Zitieren

APA

Alsaadi, M., Aldawsari, H., Kasaraneni, B. P., Kondapaka, K. K., Gayam, S. R., Thuniki, P., Putha, S., Alimovna, P. Z., & Gupta, S. (2025). Post-Quantum Verifiable Decryption for Secure and Scalable V2I Communication in Consumer Driven-Intelligent Transportation Systems. IEEE Transactions on Consumer Electronics, 71(4), 11248-11257. https://doi.org/10.1109/tce.2025.3593587

Vancouver

Alsaadi M, Aldawsari H, Kasaraneni BP, Kondapaka KK, Gayam SR, Thuniki P, et al. Post-Quantum Verifiable Decryption for Secure and Scalable V2I Communication in Consumer Driven-Intelligent Transportation Systems. IEEE Transactions on Consumer Electronics. 2025;71(4):11248-11257. doi:10.1109/tce.2025.3593587

BibTeX
@article{Alsaadi2025,
  author = {Alsaadi, Mahmood and Aldawsari, Hamad and Kasaraneni, Bhavani Prasad and Kondapaka, Krishna Kanth and Gayam, Swaroop Reddy and Thuniki, Praveen and Putha, Sudharshan and Alimovna, Pardayeva Zulfizar and Gupta, Sheifali},
  title = {Post-Quantum Verifiable Decryption for Secure and Scalable V2I Communication in Consumer Driven-Intelligent Transportation Systems},
  journal = {IEEE Transactions on Consumer Electronics},
  year = {2025},
  volume = {71},
  number = {4},
  pages = {11248--11257},
  doi = {10.1109/tce.2025.3593587}
}
Kostenlos starten →