Cryptographic Hash Research Articles

An Efficient EHR Secure Exchange Among Healthcare Servers Using Light Weight Scheme

This work addresses the critical need for secure and patient-controlled Electronic Health Records (EHR) migration among healthcare hospitals' cloud servers (HHS). The relevant approaches often lack robust access control and leave data vulnerable during transfer. Our proposed scheme empowers patients to delegate EHR migration to a trusted Third-Party Hospital (TTPH); which is the Certification Authority (CA) while enforcing access control. The system leverages asymmetric encryption utilizing the Elliptic Curve Digital Signature Algorithm (ECDSA), EEC and ECDSA added robust security and lightness EHR sharing. Patient and user privacy is managed due to anonymity through cryptographic hashing for data protection and utilizes mutual authentication for secure communication. Formal security analysis using the Scyther tool and informal analysis was conducted to validate the system's robustness. The proposed scheme achieved EHR integrity due to the verification of the communicated HHS and ensuring the integrity of the HHS digital certificate during EHR migration. Ultimately, the result achieved in the proposed work demonstrated the scheme's high balance between data security and accuracy of communication, where the best result obtained represented 7.7/ ms as computational cost and 1248 /bits as communication cost compared with the relevant approaches.

RELAKA: Robust ECC based Privacy Preserving Lightweight Authenticated Key Agreement protocol for healthcare applications

With the advancement of cutting-edge technologies, the Internet of Medical Things (IoMT) has assisted the healthcare sector by facilitating interaction between healthcare service providers and patients in remote areas. In IoMT, wearable or implantable sensors collect the patient’s record and share the information through a public network. Health-related information about the patient must be protected from a variety of attacks by the adversary since it is sensitive and extremely vulnerable to attacks. The sensor equipment that is implanted in the patient is also resource-constrained and has a low power capacity. The entities involved in the communication must be authenticated with one another in order to protect patients’ health information, anonymity, and reliability. While several authenticated key agreement protocols have been proposed, many suffer from high computational costs and storage cost, making them unsuitable for lightweight applications. This paper proposes a secure three-factor robust Elliptic Curve Cryptography (ECC) based mutually authenticated and key agreement protocol known as RELAKA for the IoMT environment, utilizing the benefits of one-way hash function. In proposed scheme, all entities, including the healthcare service providers and wearable sensors, are authenticated by the medical server. Subsequently, a secret key is established for each communication session and shared between all the entities. Additionally, mechanism for appropriate user revocation and re-registration is integrated to provide additional security in cases where a user’s QR code is tampered with by the attacker. The privacy of the proposed protocol is investigated by the potential use of zero knowledge proof. Furthermore, the efficacy of the authentication is examined by challenge and response mechanism. The informal security analysis demonstrates its resistance to threats such as DoS, impersonation, message modification, password guessing, and so on. The performance evaluation of RELAKA protocol indicates that the execution, communication, and storage costs is reduced by 87.59%, 43% and 60.71% respectively. Moreover, the outcomes of the AVISPA simulation illustrate that the RELAKA successfully evades both active and passive attacks. In addition, real-world testbed environment is developed with Raspberry pi 4 model B and the experimental results verifies the robustness of the proposed protocol. According to theoretical analysis and experimental evaluation, the RELAKA scheme is more secure and efficient than the existing protocols.

Comparative study of password storing using hash function with MD5, SHA1, SHA2, and SHA3 algorithm

<span>The main purpose of passwords is to prevent unauthorized people from accessing the system. The rise in internet users has led to an increase in password hacking, which has resulted in a variety of problems. These issues include opponents stealing a company's or nation's private information and harming the economy or the organization's security. Password hacking is a common tool used by hackers for illegal purposes. Password security against hackers is essential. There are several ways to hack passwords, including traffic interception, social engineering, credential stuffing, and password spraying. In an attempt to prevent hacking, hashing algorithms are therefore mostly employed to hash passwords, making password cracking more difficult. In the suggested work, several hashing techniques, including message digest (MD5), secure hash algorithms (SHA1, SHA2, and SHA3) have been used. They have become vulnerable as a result of being used to store passwords. A rainbow table attack is conceivable. Passwords produced with different hash algorithms can have their hash values attacked with the help of the Hashcat program. It is proven that the SHA3 algorithm can help with more secure password storage when compared to other algorithms.</span>

A secure and privacy preserving model for healthcare applications based on blockchain-layered architecture

Blockchain is one of the emerging technologies that are applied in various fields and its application in Healthcare 4.0 is crucial to handle the vast amount of health records that are growing continuously everyday. This paper explores the application of blockchain technology-based layered architecture integrated with Interplanetary File System (IPFS) storage to provide a secure and robust sharing platform for healthcare system. A multilayer security is provided in the proposed system including a 128-bit Random Deoxyribonucleic Acid (DNA) encoding sequence with a modified version of the 128-bit Advanced Encryption Standard (AES) key expansion symmetric key technique is being used before storing the records in the IPFS storage, Rivest–Shamir–Adleman (RSA) 2048 digital envelope is used for secure transmission of symmetric keys, RSA 1024 is used for digital signature, and Secure Hash Algorithm 256-bit (SHA-256) is used for hashing the record files. Comparative analysis with existing state-of-the-art in blockchain-based E-healthcare system is discussed. The performance of various assessment metrics is evaluated, including encryption and decryption time for EHR records, mining time, record retrieval time, smart contract execution time and network latency. Additionally, a reputation-based filtering mechanism specifically designed in the proposed model to detect and mitigate the various attacks.

Message Authentication Scheme on Light Weight Parallel Encryption Model With Digit Artithmetic of Covertext using Secure Hash Algorithm

This research aims to enhance message security by developing a Light Weight Parallel Digit Arithmetic of Covertext (PDAC) encryption-based authentication scheme that adopts the Secure Hash Algorithm (SHA) algorithm to ensure message integrity and authentication aspects. Through experiments, tests are conducted on two main aspects: entropy and collision resistance. The experimental results show that the average entropy generated reaches 4.992, or 62.41% of the optimal entropy value. While this result shows a good randomness, there is room for further improvement to reach the optimal level. Collision resistance testing using Google's SHAttered tool showed very positive results. No collisions were found in any of the samples tested, indicating that the PDAC scheme combined with SHA can maintain message integrity well. This indicates that PDAC has strong resistance to hash-based attacks, ensuring that messages remain authentic and safe from manipulation. Thus, this study concludes that PDAC schemes offer a good balance between efficiency, security, and low power consumption, making it suitable for use in resource-constrained environments such as IoT devices and mobile applications

Enhancing Blockchain Security by Developing the SHA256 Algorithm

Security plays a vital role in various domains, including blockchain technology. The Blockchain serves as a secure data structure for storing transactional records. Hash functions are employed in cryptography to ensure integrity and authentication within the blockchain. The widely used SHA256 algorithm has faced recent attacks, prompting the development of stronger hash functions. This paper presents a novel modification approach to enhance the performance of SHA256 by introducing an extended mechanism for generating a 288-bit message digest and reducing the number of rounds to 44 instead of 64 while preserving the diffusion of data through its complex iterative process, which involves multiple rounds of bitwise and logical operations. The change makes sure that even small changes to the input data cause noticeable variations in the output hash, thereby maintaining cryptographic properties. The suggested hash function SHA288 achieves improved security, collision resistance, and preimage resistance, while maintaining a faster execution time compared to SHA256. The tables and tests conducted on the suggested algorithm have revealed its remarkable safety and robustness in countering attacks as well as demonstrated outstanding performance in random tests, which further enhances its security measures.

Developing a nationwide dataset of UK veterans seeking help from sector charities

Abstract Background The assistance to military veterans and their families in the UK is provided by both the NHS and over 1800 military charities. These charities count services using different definitions and reporting systems, so to date a national registry of service usage does not exist. The aim of the MONARCH study is to build a standardised registry of service usage data for the military charity sector, in order to identify patterns of use, gain insight on possible risk factors, and guide the allocation of resources. Methods Data is anonymised and a unique identifier is generated by adopting a Secure Hashing Algorithm, allowing both privacy protection and avoiding double counts. Data is standardised, and linked with an automated process to create an aggregated dataset. The dataset describes the population, using both a-priori and machine learning approaches (K-means clustering) to unveil different usage patterns. In addition, it will be linked to an online interactive dashboard. Results To date 5 national charities have shared data, for a total of 42,509 veterans with 128,423 needs. The mean age of beneficiaries was 60.1 years (SD 20.5), and 90% were male. 65% were receiving some other form of statutory benefit, 5% was homeless and 1% was imprisoned. 65% of the needs recorded concerned social wellbeing. 40% of veterans were helped at least in two different years. The k-means clustering approach based on the number of accesses, number of needs and repetition of need returned 4 subgroups of use that were identical to those created using a priori knowledge. Conclusions The dataset is the most comprehensive source of charity usage data in the UK to date. Service usage is generally homogenous among subgroups, but some differences were highlighted indicating that younger, non-officer veterans may be more at risk of presenting with more complex needs. These first useful insights can help allocate resources to build an effective preventive strategy for more complex cases. Key messages • The MONARCH dataset is the first comprehensive nationwide registry in the UK of military charity data. • The understanding of usage patterns can lead to the design of targeted preventive strategies.

Inverting Cryptographic Hash Functions via Cube-and-Conquer

MD4 and MD5 are fundamental cryptographic hash functions proposed in the early 1990s. MD4 consists of 48 steps and produces a 128-bit hash given a message of arbitrary finite size. MD5 is a more secure 64-step extension of MD4. Both MD4 and MD5 are vulnerable to practical collision attacks, yet it is still not realistic to invert them, i.e., to find a message given a hash. In 2007, the 39-step version of MD4 was inverted by reducing to SAT and applying a CDCL solver along with the so-called Dobbertin’s constraints. As for MD5, in 2012 its 28-step version was inverted via a CDCL solver for one specified hash without adding any extra constraints. In this study, Cube-and-Conquer (a combination of CDCL and lookahead) is applied to invert step-reduced versions of MD4 and MD5. For this purpose, two algorithms are proposed. The first one generates inverse problems for MD4 by gradually modifying the Dobbertin’s constraints. The second algorithm tries the cubing phase of Cube-and-Conquer with different cutoff thresholds to find the one with the minimum runtime estimate of the conquer phase. This algorithm operates in two modes: (i) estimating the hardness of a given propositional Boolean formula; (ii) incomplete SAT solving of a given satisfiable propositional Boolean formula. While the first algorithm is focused on inverting step-reduced MD4, the second one is not area-specific and is therefore applicable to a variety of classes of hard SAT instances. In this study, 40-, 41-, 42-, and 43-step MD4 are inverted for the first time via the first algorithm and the estimating mode of the second algorithm. Also, 28-step MD5 is inverted for four hashes via the incomplete SAT solving mode of the second algorithm. For three hashes out of them, it is done for the first time.

Securing oil port logistics: A blockchain framework for efficient and trustworthy trade documents.

The oil port logistics involves multiple parties including oil tanker owners, port authorities, customs, oil suppliers, and shipping companies. These parties need to exchange a significant amount of data and documentation related to cargo, such as bills of lading, customs declarations, and cargo manifests. This huge amount of data and documentation provides ample opportunities for data manipulation and corruption. Moreover, physical documentation is slow and prone to errors and manipulation. This data can be securely stored and shared between different parties in a tamper-proof and transparent manner using blockchain. Blockchain is a decentralized technology that employs secure hashing and consensus algorithms that can detect any data modification. Hence, this work proposes a blockchain-enabled immutable, and efficient framework for trade documentation in oil port logistics. The proposed framework provides timely processing of oil trade documents and ensures immutability while increasing trust among the trade entities. In addition, this work implements a private blockchain for the execution of smart contracts, which can ensure that all parties involved in the logistics process comply with pre-agreed rules and regulations. Simulation results validate the effectiveness of the proposed framework in terms of transparency, immutability, network latency, throughput, and resource utilization.

Blockchain technology for secure electronic healthcare record in cloud based cryptographic hash generator

Blockchain technology for secure electronic healthcare record in cloud based cryptographic hash generator

Design of Provably Secure and Lightweight Authentication Protocol for Unmanned Aerial Vehicle systems

Drones also called Unmanned Aerial Vehicles (UAVs) have become more prominent in several applications such as package delivery, real-time object detection, tracking, traffic monitoring, security surveillance systems, and many others. As a key member of IoT, the group of Radio Frequency IDentification (RFID) technologies is referred to as Automatic Identification and Data Capturing (AIDC). In particular, RFID technology is becoming a contactless and wireless technique used to automatically identify and track the tagged objects via radio frequency signals. It also has drawn a lot of attention among researchers, scientists, industries, and practitioners due to its broad range of real-world applications in various fields. However, RFID systems face two key concerns related to security and privacy, where an adversary performs eavesdropping, tampering, modification, and even interception of the secret information of the RFID tags, which may cause forgery and privacy problems. In contrast to security and privacy, RFID tags have very limited computational power capability. To deal with these issues, this paper puts forward an RFID-based Lightweight and Provably Secure Authentication Protocol (LPSAP) for Unmanned Aerial Vehicle Systems. The proposed protocol uses secure Physically Unclonable Functions (PUFs), Elliptic-Curve Cryptography (ECC), secure one-way hash, bitwise XOR, and concatenation operations. We use Ouafi and Phan’s formal security model for analyzing security and privacy features such as traceability and mutual authentication. The rigorous informal analysis is carried out which ensures that our proposed protocol achieves various security and privacy features as well as resists various known security attacks. The performance analysis demonstrates that our proposed protocol outperforms other existing protocols. In addition, Scyther and Automated Validation of Internet Security Protocols and Applications (AVISPA) tool simulation results demonstrates that there is no security attack possible within bounds. Therefore, our proposed LPSAP protocol achieves an acceptable high level of security with the least computational, communication, and storage costs on passive RFID tags.

Mathematical Approaches to Cryptographic System Design

In the digital age, cryptographic systems are the most important part of safe communication. To protect data security, confidentiality, and validity, they need strong design frameworks. The math methods used in this paper are very important for designing and analyzing secure systems. As basic ideas, it looks at number theory, math, and complexity theory, with an emphasis on both old and new methods. Some important topics are the creation of prime numbers, modular arithmetic, elliptic curves, and finite fields, which are the basis for many encryption methods. The paper also talks about how complexity theory can be used to measure the strength of cryptography. It specifically talks about issues with discrete logarithms and integer factorization, which are at the heart of popular protocols like RSA and ECC. It also looks into lattice-based cryptography, which is seen as a strong option to quantum threats, and shows how hard it is to solve lattice issues. The study also looks at the design principles of symmetric cryptography, mainly block ciphers and stream ciphers, and how they use permutation groups and linear algebra to make sure that key plans and spread methods are safe. The paper also looks at secure hash functions, focusing on collision resistance, pre-image resistance, and how they are made using mathematics concepts such as Merkle-Damgård and sponge functions. Advanced topics like homomorphic encryption and zero-knowledge proofs show how mathematics and cryptography are increasingly coming together. They show how they can be used to make operations safe on protected data and privacy-preserving protocols. This paper gives a full picture of how mathematical theories and methods are used to build strong cryptographic systems by combining strict mathematical models with real-world cryptographic needs. The discussion stresses that the field is always changing because of new threats and improvements in computers. It also calls for constant scientific progress to make cryptography stronger against future problems.

FPGA Implementation of Compact Architecture for Lightweight Hash Algorithm for Resource Constrained Devices

The security implications of the emerging world of smart devices brought about by the Internet of things' recent rise are enormous. IoT devices typically have restricted resources, such as minimal memory, low processing power, and a short battery life, in addition to their stated security level. In the context of IoT, lightweight cryptographic primitives are presented taking into account the trade-off between speed and security assurance. In this research, we proposed lightweight cryptographic hash methods and optimized hardware for devices with limitations. The size, speed, efficiency, and power consumption of our suggested solutions are examined on FPGA systems. Bit permutation, linear transformation, and S-Box functionality are used in the suggested design. To analyze large data sets and Internet of Things applications, conventional hash algorithms need memory and time. Thus, the demand arises for a lightweight cryptographic protocol that is both rapid and safe. This technique offers the necessary security criteria of conventional hash functions and the parameters for lightweight cryptographic protocols. The proposed architecture is tested and validated based on three key criteria: memory, speed, and power consumption, which are important factors in determining its lightweight nature. Based on the findings, the proposed architecture outperforms other lightweight protocols regarding memory usage, performance, and power consumption. For an appropriate FPGA-based application deployment, a thorough comparison of our suggested designs is detailed on various FPGA families.

Algorithm for Key Transparency with Transparent Logs

Background Cryptography plays a crucial role in securing digital communications and data storage. This study evaluates the Transparent Key Management Algorithm utilizing Merkle trees, focusing on its performance and security effectiveness in cryptographic key handling. Methods The research employs simulated experiments to systematically measure and analyze key operational metrics such as insertion and verification times. Synthetic datasets are used to mimic diverse operational conditions, ensuring rigorous evaluation under varying workloads and security threats. Implementation is carried out using R programming, integrating cryptographic functions and Merkle tree structures for integrity verification. Results Performance analysis reveals efficient insertion and verification times under normal conditions, essential for operational workflows. Security evaluations demonstrate the algorithm's robustness against tampering, with approximately 95% of keys verified successfully and effective detection of unauthorized modifications. Simulated attack scenarios underscore its resilience in mitigating security threats. Conclusions The Transparent Key Management Algorithm, enhanced by Merkle trees and cryptographic hashing techniques, proves effective in ensuring data integrity, security, and operational efficiency. Recommendations include continuous monitoring and adaptive algorithms to bolster resilience against evolving cybersecurity challenges, promoting trust and reliability in cryptographic operations.

Colloidal particles as noise source for random number generation

In this work, we investigate colloidal particle patterns as a possible noise source for random number generation. We systematically analyze the minimum entropy of the noise source over different particle concentrations of {1, 3, 5, 7, 10, 12, 15} mg/ml according to the recommendations of the National Institute of Standards and Technology Special Publication 800-90B. The estimated minimum entropy of the non-independent and identically distributed particle pattern noise source is Hmin = 0.5896/1 bit at a particle amount of 5 mg/ml. For further entropy extraction on the noise source data, the secure hash algorithm is used to construct an entropy source. The randomness of the derived entropy source is verified according to the National Institute of Standards and Technology Special Publication 800-22 Rev. 1a and the accompanying statistical test suite. The entropy source passes all randomness tests of the statistical test suite and shows an estimated minimum entropy of Hmin = 0.9992/1 bit.

Design and Implementation of USB Key System Based on Dual-Factor Identity Authentication Protocol

With the increasing demand for information security, traditional single-factor authentication technology can no longer meet security requirements. To this end, this paper proposes a Universal Serial Bus (USB) Key hardware and software system based on a two-factor authentication protocol, aiming to improve the security and reliability of authentication. This paper first analyzes the current status and technical principles of USB Key-related research domestically and internationally and designs a two-factor authentication protocol that combines impact/response authentication and static password authentication. The system consists of a host computer and a USB Key device. The host computer interacts with the USB Key through a graphical user interface. The Secure Hash Algorithm 1 (SHA-1) and MySQL database are used to implement the authentication function. Experimental results show that the designed two-factor authentication protocol can effectively prevent replay attacks and information tampering, and improve the security of authentication. If the corresponding USB Key is not inserted, the system will prompt that the device is not found. Once the USB Key is inserted, user identity is confirmed through two-factor verification, which includes impact/response authentication and static password authentication.

Sublinear message bounds of authenticated implicit Byzantine agreement

This paper studies the message complexity of authenticated Byzantine agreement (BA) in synchronous, fully-connected distributed networks under an honest majority. We focus on the so-called implicit Byzantine agreement problem where each node starts with an input value and at the end a non-empty subset of the honest nodes should agree on a common input value by satisfying the BA properties (i.e., there can be undecided nodes)3. We show that a sublinear (in n, number of nodes) message complexity BA protocol under honest majority is possible in the standard PKI model when the nodes have access to an unbiased global coin and hash function. In particular, we present a randomized Byzantine agreement algorithm which, with high probability achieves implicit agreement, uses O˜(n) messages, and runs in O˜(1) rounds while tolerating (1/2−ϵ)n Byzantine nodes for any fixed ϵ>0, the notation O˜ hides a O(polylogn) factor4. The algorithm requires standard cryptographic setup PKI and hash function with a static Byzantine adversary. The algorithm works in the CONGEST model and each node does not need to know the identity of its neighbors, i.e., works in the KT0 model. The message complexity (and also the time complexity) of our algorithm is optimal up to a polylog n factor, as we show a Ω(n) lower bound on the message complexity. We further extend the result to Byzantine subset agreement, where a non-empty subset of nodes should agree on a common value. Lastly, we analyze several relevant results that follow from the construction of the main result.To the best of our knowledge, this is the first sublinear message complexity result of Byzantine agreement. A quadratic message lower bound is known for any deterministic BA protocol (due to Dolev-Reischuk [JACM 1985]). The existing randomized BA protocols have at least quadratic message complexity in the honest majority setting. Our result shows the power of a global coin in achieving significant improvement over the existing results. It can be viewed as a step towards understanding the message complexity of randomized Byzantine agreement in distributed networks with PKI.

Blockchain Based Analytical Bug Tracking in Software Engineering

This article examines a blockchain-based bug tracking system in detail, focusing on its four main components: the Blockchain Platform, the Consensus Mechanism (also known as Proof of Work, PoW), the Data Structure, and Smart Contracts. To improve the efficiency, security, and transparency of bug tracking in software development, we use mathematical models to dissect the operational framework and functionalities that underpin this cutting-edge system. The Blockchain Platform is the foundational layer. It stores data in multiple locations, cannot be changed, and provides a secure environment for fixing software bugs. We use mathematical abstractions to demonstrate how the blockchain is put together, emphasizing the importance of cryptographic hashes in maintaining data integrity and connecting blocks. People pay close attention to the Consensus Mechanism, particularly Proof of Work (PoW), because it is so important for verifying transactions and maintaining the blockchain's integrity. Using a mathematical model, we demonstrate how Proof of Work (PoW) prevents bad behavior while keeping the network safe and democratic by requiring work to be done on a computer to add blocks. The Data Structure module is examined using a model that depicts how bug reports are stored and found on the blockchain. This model demonstrates the efficiency of storing bug reports as transactions, which allows for quick access and unchangeable record-keeping. People associate smart contracts with self-running programs that manage permissions, automate workflows, and provide incentives for reporting bugs. Mathematical models are used to demonstrate how these contracts' conditions and actions are documented, emphasizing their importance in automating tasks and improving system reliability. This article uses mathematical modeling to provide a clear and structured understanding of a blockchain-based bug tracking system and demonstrate how it could change the way bugs are tracked by leveraging blockchain technology's strengths.

SMedIR: secure medical image retrieval framework with ConvNeXt-based indexing and searchable encryption in the cloud

The security and privacy of medical images are crucial due to their sensitive nature and the potential for severe consequences from unauthorized modifications, including data breaches and inaccurate diagnoses. This paper introduces a method for lossless medical image retrieval from encrypted images stored on third-party clouds. The proposed approach employs a symmetric integrity-centric image encryption scheme, leveraging multiple chaotic maps and cryptographic hash techniques, to ensure lossless image reconstruction. Medical images are first encrypted by the image owners and converted into hashcodes encapsulating essential features using a deep hashing technique with the ConvNeXt network as the backbone in parallel. To ensure index privacy, these hashcodes are encrypted in a searchable manner. The encrypted medical images, along with a secure index, are subsequently uploaded to cloud storage. Authorized medical image users can request similar medical images for diagnostic purposes by submitting a query image, from which a search trapdoor is generated and sent to the cloud. The retrieval process involves a secure similar image search over the encrypted indexes, followed by decryption along with integrity verification of the retrieved images. The proposed method has been rigorously tested on three standard medical datasets, demonstrating an improvement of 5-20% in retrieval accuracy compared to standard baselines. Formal security analysis and experimental results indicate that the proposed scheme offers enhanced security and retrieval accuracy, making it an effective solution for the encrypted storage and secure retrieval of medical image data.

Developing a nationwide registry of UK veterans seeking help from sector charities—a machine learning approach to stratification

Abstract The assistance to veterans in the UK is provided by the National Health Service and over 1800 military charities. These charities count services using different definitions and reporting systems, so to date a national registry of service usage does not exist. The aim of the Map Of Need Aggregation ResearCH study is to build a standardized registry of service usage data for the military charity sector. Data are completely anonymized by adopting a Secure Hashing Algorithm. A unique anonymous identifier is generated allowing both privacy protection and avoiding double counts. Data are standardized and linked with an automated process to create an aggregated dataset. The dataset describes the population, using both a priori and machine learning approaches. To date a total of 42 509 veterans with 128 423 needs are included. The mean age was 60.1 years, and 90% were male. 65% were receiving other benefits, 5% were homeless and 1% were in prison. 65% of the needs recorded concerned social wellbeing. 40% of veterans received assistance in at least two different years. The k-means clustering approach returned 4 subgroups of use that were identical to those created using a priori knowledge. The dataset is the most comprehensive source of veteran charity usage data in the UK to date. Service usage is generally homogenous among subgroups, but some differences were highlighted indicating that younger, non-officer veterans may be more at risk of presenting with more complex needs. These first useful insights can help allocate resources to build an effective preventive strategy for more complex cases.