A Secure Data Transfer and Effective Key Management Scheme for Vehicle Ad-Hoc Networks

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract Vehicle Ad-Hoc Networks (VANETs) have garnered significant academic interest due to the increasing demand for both safer driving solutions and in-vehicle entertainment systems. Ensuring robust information security within these networks is critical, given their potential impact on public safety. This work introduces a secure authentication framework that utilizes a hash chaining technique, where each vehicle iteratively applies a cryptographic hash function to its master key, generating a sequence of authentication codes that are both unique and tamper-resistant. Roadside Units (RSUs) serve as intermediaries, facilitating data exchange between vehicles and a centralized Authentication Authority (AA)—a trusted entity responsible for verifying vehicle identities. The hash chain mechanism accommodates the highly dynamic topology of VANETs, enabling vehicles to authenticate without continuous reliance on a central server. To further enhance security, a Dual Key Management Mechanism (DKMM) is proposed, involving two separate group keys: one dedicated to Trusted Authorities (TAs) and another for verified vehicles. Unlike conventional schemes that employ static keying materials, DKMM dynamically updates cryptographic keys in response to vehicular motion and changes in network topology. This dynamic strategy not only maintains high security levels in fast-moving environments but also reduces computational burden by limiting the frequency of hash computations. Furthermore, the integration of Elliptic Curve Cryptography (ECC) streamlines secure key exchanges while optimizing key revocation procedures. Although the scheme proves highly efficient, it also addresses practical challenges such as increased processing overhead in densely populated areas and the complexities of synchronizing keys across rapidly changing network configurations.
Full text 14,073 characters · extracted from preprint-html · click to expand
A Secure Data Transfer and Effective Key Management Scheme for Vehicle Ad-Hoc Networks | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article A Secure Data Transfer and Effective Key Management Scheme for Vehicle Ad-Hoc Networks KRISHNA KOMARAM, NAGARJUNA KARYEMSETTY This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7972221/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 14 You are reading this latest preprint version Abstract Vehicle Ad-Hoc Networks (VANETs) have garnered significant academic interest due to the increasing demand for both safer driving solutions and in-vehicle entertainment systems. Ensuring robust information security within these networks is critical, given their potential impact on public safety. This work introduces a secure authentication framework that utilizes a hash chaining technique, where each vehicle iteratively applies a cryptographic hash function to its master key, generating a sequence of authentication codes that are both unique and tamper-resistant. Roadside Units (RSUs) serve as intermediaries, facilitating data exchange between vehicles and a centralized Authentication Authority (AA)—a trusted entity responsible for verifying vehicle identities. The hash chain mechanism accommodates the highly dynamic topology of VANETs, enabling vehicles to authenticate without continuous reliance on a central server. To further enhance security, a Dual Key Management Mechanism (DKMM) is proposed, involving two separate group keys: one dedicated to Trusted Authorities (TAs) and another for verified vehicles. Unlike conventional schemes that employ static keying materials, DKMM dynamically updates cryptographic keys in response to vehicular motion and changes in network topology. This dynamic strategy not only maintains high security levels in fast-moving environments but also reduces computational burden by limiting the frequency of hash computations. Furthermore, the integration of Elliptic Curve Cryptography (ECC) streamlines secure key exchanges while optimizing key revocation procedures. Although the scheme proves highly efficient, it also addresses practical challenges such as increased processing overhead in densely populated areas and the complexities of synchronizing keys across rapidly changing network configurations. Vehicle Ad-hoc networks Information security Hash Chaining Authentication Centre Road Side Units Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 23 Mar, 2026 Reviews received at journal 23 Mar, 2026 Reviewers agreed at journal 23 Mar, 2026 Reviewers agreed at journal 23 Mar, 2026 Reviews received at journal 08 Mar, 2026 Reviewers agreed at journal 06 Mar, 2026 Reviews received at journal 04 Mar, 2026 Reviewers agreed at journal 23 Feb, 2026 Reviewers agreed at journal 21 Feb, 2026 Reviewers agreed at journal 11 Feb, 2026 Reviewers invited by journal 10 Feb, 2026 Editor assigned by journal 30 Oct, 2025 Submission checks completed at journal 29 Oct, 2025 First submitted to journal 28 Oct, 2025 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-7972221","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":589388304,"identity":"26b13da5-64a2-4c09-ace9-01898028cde6","order_by":0,"name":"KRISHNA KOMARAM","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA/ElEQVRIiWNgGAWjYBACCQbGBmYgbcDPw9j84AOQxcZOrBbJHuY2wxkgLcwEtTAwgLUYnGFvkOZhgHLxAcnZh5s/F+6wM2Y4c7DB2ObXNnk+ZgbGDx9zcGuR5ktsk555JtmMsbex4XFu323DNmYGZsmZ23BrkeNhbGPmbWO2YeZnbDDO7bkN5AK9w4tfS/Nn3rZ6GzagFmnLntv2BLVI8wBV8rYdNuPhbWyQZvhxO5GgFskexjagluPGEjwH2wx7G24ntzEzNuP1i8QZ9sdAh1Ub7j+T/vjBjz+3bee3Nx/88BGPFlTA2AYmG4hVDwJ/SFE8CkbBKBgFIwUAAHTjSyFHhh6GAAAAAElFTkSuQmCC","orcid":"","institution":"Koneru Lakshmaiah Education Foundation","correspondingAuthor":true,"prefix":"","firstName":"KRISHNA","middleName":"","lastName":"KOMARAM","suffix":""},{"id":589388305,"identity":"7b96675b-6366-4cd3-a7af-683e2265d3aa","order_by":1,"name":"NAGARJUNA KARYEMSETTY","email":"","orcid":"","institution":"Koneru Lakshmaiah Education Foundation","correspondingAuthor":false,"prefix":"","firstName":"NAGARJUNA","middleName":"","lastName":"KARYEMSETTY","suffix":""}],"badges":[],"createdAt":"2025-10-28 17:28:16","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7972221/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7972221/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":102747707,"identity":"4f989fcf-75be-4919-8419-a2f6f97cd08f","added_by":"auto","created_at":"2026-02-16 09:05:15","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":643989,"visible":true,"origin":"","legend":"","description":"","filename":"SecureDataTransferandKeyManagementinVANETs.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7972221/v1_covered_bc7d5777-00e6-4421-b4ce-89e8dae902df.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"A Secure Data Transfer and Effective Key Management Scheme for Vehicle Ad-Hoc Networks","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"international-journal-of-networked-and-distributed-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [International Journal of Networked and Distributed Computing](https://link.springer.com/journal/44227)","snPcode":"44227","submissionUrl":"https://submission.springernature.com/new-submission/44227/3","title":"International Journal of Networked and Distributed Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Open","inReviewEnabled":true,"inReviewRevisionsEnabled":true},"keywords":"Vehicle Ad-hoc networks, Information security, Hash Chaining, Authentication Centre, Road Side Units","lastPublishedDoi":"10.21203/rs.3.rs-7972221/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7972221/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eVehicle Ad-Hoc Networks (VANETs) have garnered significant academic interest due to the increasing demand for both safer driving solutions and in-vehicle entertainment systems. Ensuring robust information security within these networks is critical, given their potential impact on public safety. This work introduces a secure authentication framework that utilizes a hash chaining technique, where each vehicle iteratively applies a cryptographic hash function to its master key, generating a sequence of authentication codes that are both unique and tamper-resistant. Roadside Units (RSUs) serve as intermediaries, facilitating data exchange between vehicles and a centralized Authentication Authority (AA)\u0026mdash;a trusted entity responsible for verifying vehicle identities. The hash chain mechanism accommodates the highly dynamic topology of VANETs, enabling vehicles to authenticate without continuous reliance on a central server. To further enhance security, a Dual Key Management Mechanism (DKMM) is proposed, involving two separate group keys: one dedicated to Trusted Authorities (TAs) and another for verified vehicles. Unlike conventional schemes that employ static keying materials, DKMM dynamically updates cryptographic keys in response to vehicular motion and changes in network topology. This dynamic strategy not only maintains high security levels in fast-moving environments but also reduces computational burden by limiting the frequency of hash computations. Furthermore, the integration of Elliptic Curve Cryptography (ECC) streamlines secure key exchanges while optimizing key revocation procedures. Although the scheme proves highly efficient, it also addresses practical challenges such as increased processing overhead in densely populated areas and the complexities of synchronizing keys across rapidly changing network configurations.\u003c/p\u003e","manuscriptTitle":"A Secure Data Transfer and Effective Key Management Scheme for Vehicle Ad-Hoc Networks","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-02-13 16:50:28","doi":"10.21203/rs.3.rs-7972221/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2026-03-23T06:26:30+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-03-23T06:22:19+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"288953563508182624198318247605093058061","date":"2026-03-23T06:07:47+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"77940490529622606466019404688368718593","date":"2026-03-23T05:50:54+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-03-08T09:01:04+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"270470110325435604568583925233139645813","date":"2026-03-07T03:00:53+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-03-04T10:41:49+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"233325195529949645389174624440202269139","date":"2026-02-23T05:57:55+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"125184441936874832270535592762840988365","date":"2026-02-21T08:14:52+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"10198730615866215856661274555729048021","date":"2026-02-11T06:20:22+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2026-02-10T10:06:48+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-10-30T16:58:07+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-10-29T04:55:39+00:00","index":"","fulltext":""},{"type":"submitted","content":"International Journal of Networked and Distributed Computing","date":"2025-10-28T15:44:04+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"international-journal-of-networked-and-distributed-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [International Journal of Networked and Distributed Computing](https://link.springer.com/journal/44227)","snPcode":"44227","submissionUrl":"https://submission.springernature.com/new-submission/44227/3","title":"International Journal of Networked and Distributed Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Open","inReviewEnabled":true,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"6e532b25-4e80-48ca-9976-b9fb49c13f69","owner":[],"postedDate":"February 13th, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-04-26T06:23:26+00:00","versionOfRecord":[],"versionCreatedAt":"2026-02-13 16:50:28","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7972221","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7972221","identity":"rs-7972221","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00