Lightweight and Anonymous Mutual Authentication and Key Agreement Scheme for WBAN

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher
AI-generated summary by claude@2026-07, 2026-07-14

This paper proposes a new lightweight mutual authentication and key agreement scheme for WBANs using XOR and hash functions, addressing vulnerabilities in a previous protocol and demonstrating enhanced security and efficiency.

One-sentence paraphrase of the abstract; not a substitute for reading it. No clinical advice. How this works

AI-generated deep summary by claude@2026-07, 2026-07-14 · read from full text

The paper studies lightweight, anonymous mutual authentication and key agreement for wearable body area networks (WBANs), targeting resource-constrained wearable sensors that transmit sensitive health data. The authors analyze a previously proposed mutual authentication/key agreement scheme and report that it is vulnerable to sensor node impersonation and sensor node capture attacks, then propose a new protocol using symmetric cryptographic primitives such as XOR and hash functions. They evaluate the proposed scheme’s security using BAN-logic, the AVISPA tool, and a Real-or-Random (ROR) model, and compare performance against related protocols, finding lower communication and computational complexity. The paper does not explicitly discuss limitations beyond noting the prior protocol weaknesses and the need for lightweight cryptography; the security evaluation is theoretical/automated rather than involving experimental deployments. The paper does not explicitly discuss endometriosis or adenomyosis; it was included in the corpus via a keyword match in the upstream search index.

Read from the paper's body, not the abstract. Not a substitute for reading the paper. No clinical advice. How this works

Abstract

Abstract In the medical field, a wearable body area network is a wireless network in which wearable sensors are implemented in or on patients' bodies to gather their sensitive health information and send it to the medical servers accordingly. These multi-functional sensors provide all users with optimized and convenient services, such as homecare monitoring people’s health conditions. On the other hand, the mobility and insecure communication channels pose a vital threat from unauthorized entities to the information transferred in this network and endanger users' privacy. Therefore, numerous authentication and key agreement schemes have been suggested by researchers to solve this issue. Furthermore, the wearable body area network consists of resource-constrained devices. Thus, lightweight protocols are required to guarantee the authenticity, confidentiality, and integrity of the information. Recently, Ankur Gupta and his colleagues proposed a mutual authentication and key agreement protocol and proved its security against well-known attacks. However, after in-depth analysis, we discovered that their proposed protocol is vulnerable to the sensor node impersonation attack, and sensor node capture attack. In this paper, we propose a new lightweight mutual authentication and key agreement scheme in WBAN based on basic symmetric cryptosystems (Exclusive OR and Hash functions) to overcome the security weaknesses in Gupta's protocol and provide indispensable security for communicating data. Unlike the Gupta’s protocol, our proposed scheme is safe in CK-adversary threat model. The security of the presented scheme is evaluated using BAN-Logic, the AVISPA tool, and Real or Random (ROR) model. Overall, the performance comparison of the proposed protocol with the existing related protocols depicts that our new scheme is more efficient than others in terms of communication and computational complexities.
Full text 14,170 characters · extracted from preprint-html · click to expand
Lightweight and Anonymous Mutual Authentication and Key Agreement Scheme for WBAN | 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 Lightweight and Anonymous Mutual Authentication and Key Agreement Scheme for WBAN Saba Marandi, Farokhlagha Moazami, Amir Malekinezhad This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-3379051/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 23 May, 2024 Read the published version in Peer-to-Peer Networking and Applications → Version 1 posted 10 You are reading this latest preprint version Abstract In the medical field, a wearable body area network is a wireless network in which wearable sensors are implemented in or on patients' bodies to gather their sensitive health information and send it to the medical servers accordingly. These multi-functional sensors provide all users with optimized and convenient services, such as homecare monitoring people’s health conditions. On the other hand, the mobility and insecure communication channels pose a vital threat from unauthorized entities to the information transferred in this network and endanger users' privacy. Therefore, numerous authentication and key agreement schemes have been suggested by researchers to solve this issue. Furthermore, the wearable body area network consists of resource-constrained devices. Thus, lightweight protocols are required to guarantee the authenticity, confidentiality, and integrity of the information. Recently, Ankur Gupta and his colleagues proposed a mutual authentication and key agreement protocol and proved its security against well-known attacks. However, after in-depth analysis, we discovered that their proposed protocol is vulnerable to the sensor node impersonation attack, and sensor node capture attack. In this paper, we propose a new lightweight mutual authentication and key agreement scheme in WBAN based on basic symmetric cryptosystems (Exclusive OR and Hash functions) to overcome the security weaknesses in Gupta's protocol and provide indispensable security for communicating data. Unlike the Gupta’s protocol, our proposed scheme is safe in CK-adversary threat model. The security of the presented scheme is evaluated using BAN-Logic, the AVISPA tool, and Real or Random (ROR) model. Overall, the performance comparison of the proposed protocol with the existing related protocols depicts that our new scheme is more efficient than others in terms of communication and computational complexities. Mutual authentication CK-adversary anonymity WBAN AVISPA tool BAN-logic ROR model Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 23 May, 2024 Read the published version in Peer-to-Peer Networking and Applications → Version 1 posted Editorial decision: Revision requested 17 Dec, 2023 Reviews received at journal 17 Dec, 2023 Reviewers agreed at journal 11 Dec, 2023 Reviews received at journal 10 Dec, 2023 Reviewers agreed at journal 02 Dec, 2023 Reviewers agreed at journal 01 Dec, 2023 Reviewers invited by journal 01 Dec, 2023 Editor assigned by journal 14 Nov, 2023 Submission checks completed at journal 08 Nov, 2023 First submitted to journal 23 Sep, 2023 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-3379051","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":247132021,"identity":"2d1b5d0b-f833-4110-98ab-373b9be4803b","order_by":0,"name":"Saba Marandi","email":"","orcid":"","institution":"shahid beheshti university","correspondingAuthor":false,"prefix":"","firstName":"Saba","middleName":"","lastName":"Marandi","suffix":""},{"id":247132023,"identity":"c5bd39b5-a733-41e7-a3af-1fd168634b3c","order_by":1,"name":"Farokhlagha Moazami","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAzUlEQVRIiWNgGAWjYBAC9gYog429gQ3CYiaghecATAvPAVK1MEgksBHnMB4G7sQHP/7YRPNJPn/2mIfBTp6BnfcBAS28mw17eNJy26RzzI15GJING5jZDfBqsWfg3SbBI3EYpIVNmoeBOYGBmYADgbZsk/xj8D+3TfL4M6CWeuK0SPMkHMhtk2AwA2o5TJSWzcYyB5Jz23hyzA3nGBw3bCNCy8aHb/7Y5c5vP/7swZuKanl+/mP4tTDIP0DmAcOKyNgZBaNgFIyCUYAPAAAKhzNkowS0swAAAABJRU5ErkJggg==","orcid":"","institution":"shahid beheshti university","correspondingAuthor":true,"prefix":"","firstName":"Farokhlagha","middleName":"","lastName":"Moazami","suffix":""},{"id":247132025,"identity":"d79f58fe-7d81-4a50-9352-d855763c2ee7","order_by":2,"name":"Amir Malekinezhad","email":"","orcid":"","institution":"shahid beheshti university","correspondingAuthor":false,"prefix":"","firstName":"Amir","middleName":"","lastName":"Malekinezhad","suffix":""}],"badges":[],"createdAt":"2023-09-23 08:59:17","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-3379051/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-3379051/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s12083-024-01686-y","type":"published","date":"2024-05-23T08:34:11+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":58558331,"identity":"a50fbbb4-31ac-40dc-8571-d233b7c87f74","added_by":"auto","created_at":"2024-06-18 08:34:16","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":513742,"visible":true,"origin":"","legend":"","description":"","filename":"sub.pdf","url":"https://assets-eu.researchsquare.com/files/rs-3379051/v1_covered_04108d50-9813-4cf5-9fbb-2530dcd7f184.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Lightweight and Anonymous Mutual Authentication and Key Agreement Scheme for WBAN","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"peer-to-peer-networking-and-applications","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"ppna","sideBox":"Learn more about [Peer-to-Peer Networking and Applications](http://link.springer.com/journal/12083)","snPcode":"12083","submissionUrl":"https://submission.nature.com/new-submission/12083/3","title":"Peer-to-Peer Networking and Applications","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Mutual authentication, CK-adversary, anonymity, WBAN, AVISPA tool, BAN-logic, ROR model","lastPublishedDoi":"10.21203/rs.3.rs-3379051/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-3379051/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eIn the medical field, a wearable body area network is a wireless network in which wearable sensors are implemented in or on patients' bodies to gather their sensitive health information and send it to the medical servers accordingly. These multi-functional sensors provide all users with optimized and convenient services, such as homecare monitoring people\u0026rsquo;s health conditions. On the other hand, the mobility and insecure communication channels pose a vital threat from unauthorized entities to the information transferred in this network and endanger users' privacy. Therefore, numerous authentication and key agreement schemes have been suggested by researchers to solve this issue. Furthermore, the wearable body area network consists of resource-constrained devices. Thus, lightweight protocols are required to guarantee the authenticity, confidentiality, and integrity of the information. Recently, Ankur Gupta and his colleagues proposed a mutual authentication and key agreement protocol and proved its security against well-known attacks. However, after in-depth analysis, we discovered that their proposed protocol is vulnerable to the sensor node impersonation attack, and sensor node capture attack. In this paper, we propose a new lightweight mutual authentication and key agreement scheme in WBAN based on basic symmetric cryptosystems (Exclusive OR and Hash functions) to overcome the security weaknesses in Gupta's protocol and provide indispensable security for communicating data. Unlike the Gupta\u0026rsquo;s protocol, our proposed scheme is safe in CK-adversary threat model. The security of the presented scheme is evaluated using BAN-Logic, the AVISPA tool, and Real or Random (ROR) model. Overall, the performance comparison of the proposed protocol with the existing related protocols depicts that our new scheme is more efficient than others in terms of communication and computational complexities.\u003c/p\u003e","manuscriptTitle":"Lightweight and Anonymous Mutual Authentication and Key Agreement Scheme for WBAN","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2023-11-09 12:55:31","doi":"10.21203/rs.3.rs-3379051/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2023-12-18T04:17:30+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2023-12-18T04:06:35+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"0618d2ab-1934-4392-9617-3747189ab2b3","date":"2023-12-12T02:27:20+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2023-12-10T06:11:27+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"d2c843b9-74cc-4f73-a0e5-a661c421d1d1","date":"2023-12-02T11:34:58+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"54757128-cb2c-40e1-86b8-07f606726385","date":"2023-12-02T02:16:34+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2023-12-02T02:00:40+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2023-11-14T11:49:05+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2023-11-08T05:51:42+00:00","index":"","fulltext":""},{"type":"submitted","content":"Peer-to-Peer Networking and Applications","date":"2023-09-23T08:49:36+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"peer-to-peer-networking-and-applications","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"ppna","sideBox":"Learn more about [Peer-to-Peer Networking and Applications](http://link.springer.com/journal/12083)","snPcode":"12083","submissionUrl":"https://submission.nature.com/new-submission/12083/3","title":"Peer-to-Peer Networking and Applications","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"0c3bbe79-9be2-4567-bbfc-032cdfc060cc","owner":[],"postedDate":"November 9th, 2023","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[],"tags":[],"updatedAt":"2024-06-18T08:34:11+00:00","versionOfRecord":{"articleIdentity":"rs-3379051","link":"https://doi.org/10.1007/s12083-024-01686-y","journal":{"identity":"peer-to-peer-networking-and-applications","isVorOnly":false,"title":"Peer-to-Peer Networking and Applications"},"publishedOn":"2024-05-23 08:34:11","publishedOnDateReadable":"May 23rd, 2024"},"versionCreatedAt":"2023-11-09 12:55:31","video":"","vorDoi":"10.1007/s12083-024-01686-y","vorDoiUrl":"https://doi.org/10.1007/s12083-024-01686-y","workflowStages":[]},"version":"v1","identity":"rs-3379051","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-3379051","identity":"rs-3379051","version":["v1"]},"buildId":"_2-kVJe1T_tPrBINL-cwx","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. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-22T02:00:06.705733+00:00
License: CC-BY-4.0