Scholarlink

<p>To cope with the challenge of using different cryptosystems for secure data transmission in Vehicular Ad-hoc Networks. A heterogeneous and aggregated signcryption scheme CPHASC that satisfies multi-message simultaneous verification and a heterogeneous and multi-receiver signcryption scheme PCHMSC that satisfies single signcryption for multi-message are proposed. Using mobile edge nodes to perform complex operations, such as partial signcryption, ciphertext aggregation, etc., greatly reduces the computational pressure on road-side units and on-board units, and improves the efficiency of message signcryption and verification. In addition, relying on the bilinear Diffie-Hellman problem in the framework of the random oracle model, it is proved that both schemes satisfy confidentiality and unforgeability. The analysis results show that, compared with similar schemes, the two schemes have more functional characteristics and lower computational overhead, and satisfy higher security.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Efficient and mutual heterogeneous signcryption schemes for VANETs

  • 期刊论文

  • 发表日期：

    2025年7月16日

查看全文
  • Xiaodong Yang,
  • Ke Yao,
  • Songyu Li,
  • Ningning Ren,
  • Caifen Wang

摘要

To cope with the challenge of using different cryptosystems for secure data transmission in Vehicular Ad-hoc Networks. A heterogeneous and aggregated signcryption scheme CPHASC that satisfies multi-message simultaneous verification and a heterogeneous and multi-receiver signcryption scheme PCHMSC that satisfies single signcryption for multi-message are proposed. Using mobile edge nodes to perform complex operations, such as partial signcryption, ciphertext aggregation, etc., greatly reduces the computational pressure on road-side units and on-board units, and improves the efficiency of message signcryption and verification. In addition, relying on the bilinear Diffie-Hellman problem in the framework of the random oracle model, it is proved that both schemes satisfy confidentiality and unforgeability. The analysis results show that, compared with similar schemes, the two schemes have more functional characteristics and lower computational overhead, and satisfy higher security.