A Security-Enhanced Pairing-Free Certificateless Aggregate Signature for Vehicular Ad-Hoc Networks
As self-organizing, highly heterogeneous and multi-interactive networks, vehicular ad-hoc networks (VANETs) are rapidly improving the efficiency of modern traffic. This promising technology is significant for supporting current intelligent transportation by cooperative data sharing and processing. C...
Gespeichert in:
Veröffentlicht in: | IEEE systems journal 2023-09, Vol.17 (3), p.3822-3833 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 3833 |
---|---|
container_issue | 3 |
container_start_page | 3822 |
container_title | IEEE systems journal |
container_volume | 17 |
creator | Zheng, Hangcheng Luo, Min Zhang, Yunru Peng, Cong Feng, Qi |
description | As self-organizing, highly heterogeneous and multi-interactive networks, vehicular ad-hoc networks (VANETs) are rapidly improving the efficiency of modern traffic. This promising technology is significant for supporting current intelligent transportation by cooperative data sharing and processing. Considering requirements for secure interactions and the limitation of resources in VANETs, protecting data authenticity while enhancing computational efficiency has become the main challenge. A certificateless aggregate signature (CLAS) can not only ensure data security, but also reduce communication costs, which is suitable for a resource-constrained environment. However, most existing CLAS schemes either own serious security vulnerabilities or result in tremendous computational overhead. In this article, we propose an efficient, privacy-preserving, and pairing-free CLAS scheme with enhanced security. We prove that it is existentially unforgeable against adaptive chosen message attacks in the random oracle model. Performance evaluation illustrates that our proposed scheme is more appropriate to the VANETs scenario. |
doi_str_mv | 10.1109/JSYST.2022.3220869 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_9955378</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9955378</ieee_id><sourcerecordid>2858748123</sourcerecordid><originalsourceid>FETCH-LOGICAL-c295t-bef09b632e52f3c60193e9cbc51d7d24d0456f28afd6a36f42148bb1a84196e23</originalsourceid><addsrcrecordid>eNo9kN9LwzAQx4soOKf_gL4EfO5MLk2bPI6hThkqdAo-lTS91OhsZ9Ii--_tfuDT3cH3c3d8ouiS0QljVN085u_5cgIUYMIBqEzVUTRiimexAp4c73qIJZPJaXQWwielQopMjaJySnI0vXfdJr5tPnRjsCIv2nnX1PGdRyQz9J2zzugOVxgCmda1x3qYSO7qRne9R2JbT97ww5l-pT2ZVvG8NeQJu9_Wf4Xz6MTqVcCLQx1Hr3e3y9k8XjzfP8ymi9iAEl1coqWqTDmgAMtNSoeXUZnSCFZlFSQVTURqQWpbpZqnNgGWyLJkWiZMpQh8HF3v9659-9Nj6IrPtvfNcLIAKWSWSAZ8SME-ZXwbgkdbrL371n5TMFpsXRY7l8XWZXFwOUBXe8gh4j-glBA8k_wP6Z9wnQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2858748123</pqid></control><display><type>article</type><title>A Security-Enhanced Pairing-Free Certificateless Aggregate Signature for Vehicular Ad-Hoc Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Zheng, Hangcheng ; Luo, Min ; Zhang, Yunru ; Peng, Cong ; Feng, Qi</creator><creatorcontrib>Zheng, Hangcheng ; Luo, Min ; Zhang, Yunru ; Peng, Cong ; Feng, Qi</creatorcontrib><description>As self-organizing, highly heterogeneous and multi-interactive networks, vehicular ad-hoc networks (VANETs) are rapidly improving the efficiency of modern traffic. This promising technology is significant for supporting current intelligent transportation by cooperative data sharing and processing. Considering requirements for secure interactions and the limitation of resources in VANETs, protecting data authenticity while enhancing computational efficiency has become the main challenge. A certificateless aggregate signature (CLAS) can not only ensure data security, but also reduce communication costs, which is suitable for a resource-constrained environment. However, most existing CLAS schemes either own serious security vulnerabilities or result in tremendous computational overhead. In this article, we propose an efficient, privacy-preserving, and pairing-free CLAS scheme with enhanced security. We prove that it is existentially unforgeable against adaptive chosen message attacks in the random oracle model. Performance evaluation illustrates that our proposed scheme is more appropriate to the VANETs scenario.</description><identifier>ISSN: 1932-8184</identifier><identifier>EISSN: 1937-9234</identifier><identifier>DOI: 10.1109/JSYST.2022.3220869</identifier><identifier>CODEN: ISJEB2</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Ad hoc networks ; Aggregates ; Certificateless aggregate signature (CLAS) ; Costs ; digital signature scheme ; Elliptic curves ; Games ; Mobile ad hoc networks ; Performance evaluation ; Privacy ; provably security ; Security ; vehicular ad-hoc networks</subject><ispartof>IEEE systems journal, 2023-09, Vol.17 (3), p.3822-3833</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c295t-bef09b632e52f3c60193e9cbc51d7d24d0456f28afd6a36f42148bb1a84196e23</citedby><cites>FETCH-LOGICAL-c295t-bef09b632e52f3c60193e9cbc51d7d24d0456f28afd6a36f42148bb1a84196e23</cites><orcidid>0000-0003-2313-6560 ; 0000-0002-6927-7855 ; 0000-0002-1819-9332 ; 0000-0002-9958-3255</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9955378$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9955378$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Zheng, Hangcheng</creatorcontrib><creatorcontrib>Luo, Min</creatorcontrib><creatorcontrib>Zhang, Yunru</creatorcontrib><creatorcontrib>Peng, Cong</creatorcontrib><creatorcontrib>Feng, Qi</creatorcontrib><title>A Security-Enhanced Pairing-Free Certificateless Aggregate Signature for Vehicular Ad-Hoc Networks</title><title>IEEE systems journal</title><addtitle>JSYST</addtitle><description>As self-organizing, highly heterogeneous and multi-interactive networks, vehicular ad-hoc networks (VANETs) are rapidly improving the efficiency of modern traffic. This promising technology is significant for supporting current intelligent transportation by cooperative data sharing and processing. Considering requirements for secure interactions and the limitation of resources in VANETs, protecting data authenticity while enhancing computational efficiency has become the main challenge. A certificateless aggregate signature (CLAS) can not only ensure data security, but also reduce communication costs, which is suitable for a resource-constrained environment. However, most existing CLAS schemes either own serious security vulnerabilities or result in tremendous computational overhead. In this article, we propose an efficient, privacy-preserving, and pairing-free CLAS scheme with enhanced security. We prove that it is existentially unforgeable against adaptive chosen message attacks in the random oracle model. Performance evaluation illustrates that our proposed scheme is more appropriate to the VANETs scenario.</description><subject>Ad hoc networks</subject><subject>Aggregates</subject><subject>Certificateless aggregate signature (CLAS)</subject><subject>Costs</subject><subject>digital signature scheme</subject><subject>Elliptic curves</subject><subject>Games</subject><subject>Mobile ad hoc networks</subject><subject>Performance evaluation</subject><subject>Privacy</subject><subject>provably security</subject><subject>Security</subject><subject>vehicular ad-hoc networks</subject><issn>1932-8184</issn><issn>1937-9234</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kN9LwzAQx4soOKf_gL4EfO5MLk2bPI6hThkqdAo-lTS91OhsZ9Ii--_tfuDT3cH3c3d8ouiS0QljVN085u_5cgIUYMIBqEzVUTRiimexAp4c73qIJZPJaXQWwielQopMjaJySnI0vXfdJr5tPnRjsCIv2nnX1PGdRyQz9J2zzugOVxgCmda1x3qYSO7qRne9R2JbT97ww5l-pT2ZVvG8NeQJu9_Wf4Xz6MTqVcCLQx1Hr3e3y9k8XjzfP8ymi9iAEl1coqWqTDmgAMtNSoeXUZnSCFZlFSQVTURqQWpbpZqnNgGWyLJkWiZMpQh8HF3v9659-9Nj6IrPtvfNcLIAKWSWSAZ8SME-ZXwbgkdbrL371n5TMFpsXRY7l8XWZXFwOUBXe8gh4j-glBA8k_wP6Z9wnQ</recordid><startdate>202309</startdate><enddate>202309</enddate><creator>Zheng, Hangcheng</creator><creator>Luo, Min</creator><creator>Zhang, Yunru</creator><creator>Peng, Cong</creator><creator>Feng, Qi</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0003-2313-6560</orcidid><orcidid>https://orcid.org/0000-0002-6927-7855</orcidid><orcidid>https://orcid.org/0000-0002-1819-9332</orcidid><orcidid>https://orcid.org/0000-0002-9958-3255</orcidid></search><sort><creationdate>202309</creationdate><title>A Security-Enhanced Pairing-Free Certificateless Aggregate Signature for Vehicular Ad-Hoc Networks</title><author>Zheng, Hangcheng ; Luo, Min ; Zhang, Yunru ; Peng, Cong ; Feng, Qi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c295t-bef09b632e52f3c60193e9cbc51d7d24d0456f28afd6a36f42148bb1a84196e23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Ad hoc networks</topic><topic>Aggregates</topic><topic>Certificateless aggregate signature (CLAS)</topic><topic>Costs</topic><topic>digital signature scheme</topic><topic>Elliptic curves</topic><topic>Games</topic><topic>Mobile ad hoc networks</topic><topic>Performance evaluation</topic><topic>Privacy</topic><topic>provably security</topic><topic>Security</topic><topic>vehicular ad-hoc networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zheng, Hangcheng</creatorcontrib><creatorcontrib>Luo, Min</creatorcontrib><creatorcontrib>Zhang, Yunru</creatorcontrib><creatorcontrib>Peng, Cong</creatorcontrib><creatorcontrib>Feng, Qi</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><jtitle>IEEE systems journal</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Zheng, Hangcheng</au><au>Luo, Min</au><au>Zhang, Yunru</au><au>Peng, Cong</au><au>Feng, Qi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Security-Enhanced Pairing-Free Certificateless Aggregate Signature for Vehicular Ad-Hoc Networks</atitle><jtitle>IEEE systems journal</jtitle><stitle>JSYST</stitle><date>2023-09</date><risdate>2023</risdate><volume>17</volume><issue>3</issue><spage>3822</spage><epage>3833</epage><pages>3822-3833</pages><issn>1932-8184</issn><eissn>1937-9234</eissn><coden>ISJEB2</coden><abstract>As self-organizing, highly heterogeneous and multi-interactive networks, vehicular ad-hoc networks (VANETs) are rapidly improving the efficiency of modern traffic. This promising technology is significant for supporting current intelligent transportation by cooperative data sharing and processing. Considering requirements for secure interactions and the limitation of resources in VANETs, protecting data authenticity while enhancing computational efficiency has become the main challenge. A certificateless aggregate signature (CLAS) can not only ensure data security, but also reduce communication costs, which is suitable for a resource-constrained environment. However, most existing CLAS schemes either own serious security vulnerabilities or result in tremendous computational overhead. In this article, we propose an efficient, privacy-preserving, and pairing-free CLAS scheme with enhanced security. We prove that it is existentially unforgeable against adaptive chosen message attacks in the random oracle model. Performance evaluation illustrates that our proposed scheme is more appropriate to the VANETs scenario.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/JSYST.2022.3220869</doi><tpages>12</tpages><orcidid>https://orcid.org/0000-0003-2313-6560</orcidid><orcidid>https://orcid.org/0000-0002-6927-7855</orcidid><orcidid>https://orcid.org/0000-0002-1819-9332</orcidid><orcidid>https://orcid.org/0000-0002-9958-3255</orcidid></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1932-8184 |
ispartof | IEEE systems journal, 2023-09, Vol.17 (3), p.3822-3833 |
issn | 1932-8184 1937-9234 |
language | eng |
recordid | cdi_ieee_primary_9955378 |
source | IEEE Electronic Library (IEL) |
subjects | Ad hoc networks Aggregates Certificateless aggregate signature (CLAS) Costs digital signature scheme Elliptic curves Games Mobile ad hoc networks Performance evaluation Privacy provably security Security vehicular ad-hoc networks |
title | A Security-Enhanced Pairing-Free Certificateless Aggregate Signature for Vehicular Ad-Hoc Networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T17%3A32%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Security-Enhanced%20Pairing-Free%20Certificateless%20Aggregate%20Signature%20for%20Vehicular%20Ad-Hoc%20Networks&rft.jtitle=IEEE%20systems%20journal&rft.au=Zheng,%20Hangcheng&rft.date=2023-09&rft.volume=17&rft.issue=3&rft.spage=3822&rft.epage=3833&rft.pages=3822-3833&rft.issn=1932-8184&rft.eissn=1937-9234&rft.coden=ISJEB2&rft_id=info:doi/10.1109/JSYST.2022.3220869&rft_dat=%3Cproquest_RIE%3E2858748123%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2858748123&rft_id=info:pmid/&rft_ieee_id=9955378&rfr_iscdi=true |