Verification Protocol Research Articles

Implementation of a novel secured authentication protocol for cyber security applications

Robust verification protocols are crucial for maintaining the security and reliability of sensitive information due to the increasing complexity of cyber-attacks. This paper introduces a novel 5G Secure Handover Protocol aimed at addressing security and effectiveness issues encountered in existing systems. The proposed protocol is robust against various attacks, including de-synchronization, replay, man-in-the-middle (MITM), denial of services (DoS), and jamming, ensures perfect forward key secrecy, safeguarding communication confidentiality. The proposed protocol utilizes a combination of spiking neural network and fuzzy logic (SNN-FL) techniques that must choose the goal cell as carefully as possible before initiating the transfer process. By combining fuzzy logic and spiking neural networks to reduce handover latency and thwart several types of cyberattacks, the proposed 5G Secure Handover Protocol improves security. Extensive simulations show its efficacy and emphasize its potential for safe communication in large-scale cybersecurity applications. The paper presents a novel secure authentication protocol that significantly reduces handover delays and improves efficiency. Simulations show its resilience against common security threats, protecting sensitive information and maintaining secure communication channels. The protocol, with low communication expenses, complex spatial, and latency for changeover verification, is ideal for large-scale cybersecurity applications, contributing to the development of secure digital authentication mechanisms.

EKV-VBQ: Ensuring Verifiable Boolean Queries in Encrypted Key-Value Stores

To address the deficiencies in privacy-preserving expressive query and verification mechanisms in outsourced key-value stores, we propose EKV-VBQ, a scheme designed to ensure verifiable Boolean queries over encrypted key-value data. We have integrated blockchain and homomorphic Xor operations and pseudo-random functions to create a secure and verifiable datastore, while enabling efficient encrypted Boolean queries. Additionally, we have designed a lightweight verification protocol using bilinear map accumulators to guarantee the correctness of Boolean query results. Our security analysis demonstrates that EKV-VBQ is secure against adaptive chosen label attacks (IND-CLA) and guarantees Integrity and Unforgeability under the bilinear q-strong Diffie–Hellman assumption. Our performance evaluations showed reduced server-side storage overhead, efficient proof generation, and a significant reduction in user-side computational complexity by a factor of log n. Finally, GPU-accelerated optimizations significantly enhance EKV-VBQ’s performance, reducing computational overhead by up to 50%, making EKV-VBQ highly efficient and suitable for deployment in environments with limited computational resources.

Evaluating RhD Assessment By Automated Methodology: A Potential ‘Blind Spot’ For RhD Variant Identification

Abstract Background Automated blood typing platforms are ideal for blood donor centers, given their broad recognition of RhD antigen variants, resulting in products from such donors to be labeled as RhD positive. However, this ‘blind spot’ for variants may be problematic for hospital-based transfusion services, since RhD variants may require provision of RhD- RBC units and Rh immune globulin. The extent to which automated methods accurately characterize variant D antigen expression is not known. As such, the objective of our study was to assess D typing results, as well as RHD genotyping, among two automated testing platforms at our facility. Methods The study site is a single tertiary care center with analysis done from 12/2020-1/2024. At our facility, all females <60 years of age with RhD antigen testing results of ≤2+ agglutination (0-4+ scale) via automated methods [solid phase testing 12/20-4/22 (Neo, Immucor, Norcross, GA) and gel testing 5/22-1/24 (Erytra, Grifols, Emeryville, CA)] are assessed by a tube RhD antigen test (Grifols reagents). If tube testing confirms a ≤2+ result (0-4+ scale), molecular variant D analysis is performed (Versiti, Milwaukee, WI). Patients typed as Rh negative with anti-D antibodies, or those with inconsistent D typing, are also subjected to genetic D testing. The Wilcoxon matched pairs signed rank test was employed for comparative data (P< 0.05 was deemed significant). Results Amongst tested patients, 73 demonstrated ≤2+ agglutination via an automated typing method, leading to variant D genetic analysis. Of these, 71% (n=52) harbored variant D antigens. Within this subgroup, 29 (56%) subjects exhibited variants associated with potential allo-anti-D development (n=5 partial D variants; n=24 weak D variants). Notably, 4 patients with partial D and 1 with weak D demonstrated allo-anti-D antibodies. Of 23 patients with variant D who underwent automated gel testing, 20 concurrent tube testing results were available. Gel testing revealed significantly stronger agglutination compared to tube testing (p < 0.001). In contrast, for paired solid phase and tube testing (n=11), there was no statistically significant difference in agglutination strength (p = 0.28). Conclusion Automated testing, particularly gel-based platforms, exhibits reduced sensitivity to RhD antigen variant identification when compared to tube testing, placing subsets of patients potentially at risk for forming allo-anti-D. Implementing protocols for verification of D status could enhance the sensitivity of variant D detection for facilities that largely rely on automated methods for antigen typing.

Bots and fake participants: ensuring valid and reliable data collection using online participant recruitment methods

ABSTRACT Recruitment for successful health sciences research requires balancing efficiency, cost, accessibility, and reliability of available recruitment methods. Our case-control study used online recruitment methods, which broadened our reach to potential participants across the United States. However, this approach also exposed us to challenges associated with bot interference and fraudulent participation. This paper focuses on maintaining data integrity, specifically when utilizing online participant recruitment methods. Drawing from our experience, we propose The Swiss Cheese Model of Study Participant Fraud Prevention, adapted from Reason’s Swiss Cheese Model, and illustrate 10 prevention and verification measures that can be taken to minimize fraud in research studies that rely on online recruitment. We emphasize the importance of a layered approach, including carefully designed recruitment media and compensation protocols, vetting of participant eligibility, and data verification protocols to ensure the validity and reliability of research findings in the digital age.

Gaining confidence on the correct realization of arbitrary quantum computations

We present verification protocols to gain confidence in the correct performance of a device implementing an arbitrary quantum computation. The derivation of the protocols is based on the fact that matchgate computations, which are classically efficiently simulable, become universal if supplemented with additional resources. We combine tools from weak simulation, randomized compiling, and statistics to derive verification circuits that (i) strongly resemble the original circuit and (ii) can be classically efficiently simulated not only in the ideal, i.e., error free scenario, but also in the realistic situation where errors are present. In fact, in one of the protocols we apply exactly the same circuit as in the original computation, however, to a slightly modified input state. Published by the American Physical Society 2024

A Blockchain-Based Privacy-Preserving Charging Station Reservation and Payment Scheme for Electric Vehicles

EV charging infrastructures traditionally rely on untrusted centralized infrastructures that pose several privacy and security threats to EVs’ personal information. Targeted advertisements, privacy leaks, selling data to third parties, are among the threats to privacy and security. By utilizing blockchain-based solutions, recent work address the security and privacy problems associated with EV charging protocols. Most of them are geared toward maintaining EV anonymity rather than preserving end-to-end privacy. As EV owners’ charging histories and payment information are associated with their wallet address on the blockchain, any threat of linkability of these blockchain addresses to physical identities can pose a serious risk to their privacy. In this paper, we propose a ring signature based privacy-preserving end-to-end charging station (CS) reservation and payment protocol, which provides EV owners with the ability to reserve and pay for a charging slot privately, without sharing private information or exposing their identity or addresses at CS locations. Additionally, we provide EV owners with a decentralized charging slot information verification protocol with the help of secure multiparty computation (SMC), which allows them to verify available slots. A dispute resolution mechanism is also proposed that handles disputes between EVs and CSs and penalizes them accordingly by utilizing trusted execution environment (TEE). Results show that the proposed protocol ensures end-to-end EV owners’ privacy with low blockchain transaction and computation overhead.

Secure Data Sharing in Decentralized Networks: Encryption Techniques, Access Control Mechanisms, and Data Integrity Verification

The introduction of decentralized systems in a rapidly changing technological world has introduced many issues and risks regarding privacy and secure data exchange. This paper addresses the complexities of secure data exchange within decentralized systems, focusing on encryption techniques, access control mechanisms, and data integrity verification. We begin by analyzing the impending risks and limitations within decentralized systems, including the potential for unauthorized access and data breaches from vulnerable points present in decentralized system entities. Subsequently, we analyze and explore modern methods of encryption to safeguard confidential data while also ensuring privacy. Furthermore, we examine access control strategies and integrity verification protocols, which play crucial roles in ensuring that data remains secure against unwarranted access and reliable across distributed ecosystems. Our findings emphasize the need for robust and intricate security measures adapted to the unique framework of decentralized systems. This study aims to advance the understanding of privacy and security in decentralized systems while serving as a stepping stone and valuable resource for future research.

Multi-participant quantum anonymous communication based on high-dimensional entangled states

Anonymous quantum communication (AQC) enables the secure transmission of quantum or classical messages between a sender and a receiver while ensuring the anonymity of their identities. Existing AQC protocols primarily address one-to-one anonymous communication. When there are multiple senders, they must send their messages sequentially to avoid collision problems. In this paper, we propose a multi-participant quantum anonymous communication (MQAC) by employing high-dimensional entangled states. In this protocol, multiple senders establish anonymous entanglement with multiple receivers of their choice and send quantum messages anonymously and simultaneously via quantum teleportation. To propose MQAC, we first present the toolbox we developed, which includes several sub-protocols such as the verification protocol, collision detection protocol, address distribution protocol, and notification protocol. These sub-protocols, which we propose, not only are important parts of MQAC but also serve as the foundation for solving many more complex tasks, such as anonymous commodity transaction. Additionally, the analysis of MQAC demonstrates that neither internal nor external attackers can steal the identities of the communication parties or the transmitted messages by employing any attack. Our work represents an original exploration of anonymous message transmission between multiple senders and receivers in quantum networks.

Digital Homodyne and Heterodyne Detection for Stationary Bosonic Modes.

Homo- and heterodyne detection are fundamental techniques for measuring propagating electromagnetic fields. However, applying these techniques to stationary fields confined in cavities poses a challenge. As a way to overcome this challenge, we propose to use repeated indirect measurements of a two-level system interacting with the cavity. We demonstrate numerically that the proposed measurement scheme faithfully reproduces measurement statistics of homo- or heterodyne detection. The scheme can be implemented in various physical architectures, including circuit quantum electrodynamics. Our results pave the way for implementation of quantum algorithms requiring linear detection of stationary modes, including quantum verification protocols.

A clinical case of acute polyneuropathy, with the onset of bilateral facial nerve palsy in an early childhood

BACKGROUND: The differential diagnosis of peripheral nervous system damage depends on a thorough collection of history, comprehensive assessment of clinical manifestations, and dynamic examination of the patient. This article describes a clinical case of acute polyneuropathy in a young child, which began with gastrointestinal symptoms and bilateral facial neuropathy. CLINICAL CASE DESCRIPTION: The article presents a case of a child with an atypical course of acute polyneuropathy, which began with bilateral facial neuropathy combined with gastrointestinal complaints and pain syndrome. Features of the clinical presentation of the disease required extended laboratory and instrumental testing. Protocols for instrumental verification of diagnosis included nerve conduction studies examining neural conduction and axonal excitability of the affected facial nerve and the healthy side. Additionally, the functional status of the peripheral nerves in the upper and lower limbs was assessed. Polyneuropathic alterations revealed through nerve conduction studies confirmed diagnostic lumbar puncture to determine the presence of neuroinfectious processes. Magnetic resonance imaging of the brain, brachial, and lumbosacral plexuses using intravenous contrast showed the nature and prevalence of a lesion. Based on the overall clinical, laboratory, and instrumental examination data of the patient, “acute inflammatory demyelinating polyneuropathy” was diagnosed; timely etiopathogenetic treatment was initiated. CONCLUSION: In children, the course of a neuroinfection may be atypical. Sometimes, when dissociating the clinical manifestations of the disease from the results of a standard laboratory and instrumental test, expert diagnostic techniques should be used for differential diagnosis purposes.

A Nurse-Driven Protocol for Neonatal Enteral Access Device Placement Confirmation.

Preterm infants require the use of nasogastric and orogastric enteral access devices (EADs) to provide nutrition and medications. Confirmation of the location of the tip of the EAD is essential to minimize complications. At the study site, EAD location was limited to verifying the centimeter marking at the lip/nares and nonevidence-based methods of visual observation of aspirate and auscultation. Implement an evidenced-based EAD placement confirmation protocol, and by 90days post-education and implementation, achieve adherence of 90%. This quality improvement project implemented a nurse-driven evidence-based protocol for EAD verification. The intervention was based on the New Opportunities for Verification of Enteral Tube Location best practice recommendations. Prior to implementation, education sessions focused on insertion measurement technique and gastric pH measurement. Radiographs, insertion measurement technique, centimeter marking, and gastric pH measurement were used for EAD location confirmation. To determine compliance with the protocol, audits were conducted and questionnaires assessing current practice regarding EAD confirmation were administered pre- and postimplementation. The protocol increased nursing knowledge regarding evidence-based EAD insertion and verification procedures, incorporated pH measurement into practice, and reduced use of auscultation for confirmation. Nursing adherence to the protocol was 92%. This provides a model for how to successfully implement and achieve adherence to an evidence-based EAD placement confirmation nurse-driven protocol. Further research is needed to verify the effectiveness of the protocol and establish consensus on approaches specifically for the neonatal population.

Stabilizer entropy of quantum tetrahedra

How complex is the structure of quantum geometry? In several approaches, the spacetime atoms are obtained by the SU(2) intertwiner called quantum tetrahedron. The complexity of this construction has a concrete consequence in recent efforts to simulate such models and toward experimental demonstrations of quantum gravity effects. There are, therefore, both a computational and an experimental complexity inherent to this class of models. In this paper, we study this complexity under the lens of (SE). We calculate the SE of the gauge-invariant basis states and its average in the SU(2)-gauge invariant subspace. We find that the states of definite volume are singled out by the (near) maximal SE and give precise bounds to the verification protocols for experimental demonstrations on available quantum computers. Published by the American Physical Society 2024

An efficient privacy-preserving and verifiable scheme for federated learning

As one of the most important methods of privacy computing, federated learning has attracted much attention as it makes data available but invisible (i.e., uploading gradients instead of raw data). However, adversaries may still recover some private information such as tabs, memberships or even training data, from gradients. Additionally, the malicious server may return the incorrect or forged aggregated result to clients for certain illegal interests. To ensure verifiability and privacy-preservation, in this paper, we present a verifiable secure aggregation scheme under the dual-server federated learning framework. Specifically, we combine the learning with error (LWE) cryptosystem with the secret sharing technique to guarantee the privacy of the aggregated result and each client’s local gradient. Meanwhile, we skillfully design a double-verification protocol, including the server-side and client-side verification, to efficiently verify the correctness of the aggregated result and ensure data availability. Specifically, two servers mutually verify the correctness of the aggregated result through the linear homomorphic hash technique. After passing the server-side mutual verification, the malicious server may still directly broadcast the forged aggregated result to clients. Our client-side verification protocol can ensure data availability to identify the correct aggregation result sent by the semi-trusted server. To the best of our knowledge, existing solutions do not take data availability into account. Extensive experimental comparisons with the state-of-the-art schemes demonstrate the effectiveness and efficiency of the proposed scheme in terms of accuracy, computational cost and communication overhead.

Virtual mitigation of coherent non-adiabatic transitions by echo verification

Transitions out of the ground space limit the performance of quantum adiabatic algorithms, while hardware imperfections impose stringent limitations on the circuit depth. We propose an adiabatic echo verification protocol which mitigates both coherent and incoherent errors, arising from non-adiabatic transitions and hardware noise, respectively. Quasi-adiabatically evolving forward and backward allows for an echo-verified measurement of any observable. In addition to mitigating hardware noise, our method uses positive-time dynamics only. Crucially, the estimator bias of the observable is reduced when compared to standard adiabatic preparation, achieving up to a quadratic improvement.

How many FIDO protocols are needed? Analysing the technology, security and compliance

To overcome the security vulnerabilities caused by weak passwords, thus bridge the gap between user friendly interfaces and advanced security features, the Fast IDentity Online (FIDO) alliance defined a number of authentication protocols. The existing literature leverages all versions of the FIDO protocols, without indicating the reasons behind the choice of each individual FIDO protocol (i.e., U2F, UAF, FIDO2). Inevitably, the question “which protocol is more suitable per case” becomes significant. To provide an answer to the previous question, this article performs a thorough comparative analysis on the different protocol specifications and their technological and market support, to identify whether any protocol has become obsolete. To reach to a conclusion, the proposed approach (i) explores the existing literature, (ii) analyses the specifications released by the FIDO Alliance, elaborating on the security characteristics, (iii) inspects the technical adoption by the industry and (iv) investigates the compliance of the FIDO with standards, regulations and other identity verification protocols. Our results indicate that FIDO2 is the most widely adopted solution; however, U2F remains supported by numerous web services as a two-factor authentication (2FA) choice, while UAF continues to be utilised in mobile clients seeking to offer the Transaction Confirmation feature.

Eigenvalue-based quantum state verification of three-qubit W class states

In quantum many-body systems, W class states are typical examples of states with genuine multipartite entanglement. They have been found to be valuable resources in many quantum information processing tasks. However, the characterization and verification of W class states still remains an intractable problem. Here we first propose an eigenvalue-based verification protocol consisting of four practical adaptive local projective measurement tests, and obtain the optimal test probabilities with particle swarm optimization algorithm. The efficiency achieved by this protocol is far from satisfactory when compared with the theoretical upper bound. Then by utilizing the symmetry of the target states and a class of specific unitaries, we optimize the original verification strategy based on group theory. In this case, our new protocol can realize the efficient verification of three-qubit W class states.

SECURE ELECTRONIC FUND TRANSFER OVER INTERNET USING DES ALGORITHM

The undertaking denoted as Secure Electronic Fund Transfer over Internet Using DES Algorithm epitomizes the fundamental concept of effectuating a secure transference of financial resources between accounts or across international borders. Traditionally, individuals engaging in fund transfers are compelled to either visit a physical banking institution or seek out a computer with internet connectivity to avail themselves of the services proffered by online banking, ensuring a dependable monetary exchange. This system stands as a paragon of efficacy, offering a fortified layer of security to safeguard these financial transactions. The web portal, accessible to a broad spectrum of end users, allows registration by furnishing requisite contact particulars and account information. The preservation of such information is executed meticulously, with the entirety of data subjected to encryption through the application of the DES Algorithm, thus fortifying the impregnability of the stored details. In contrast to numerous insecure websites, where susceptibility to data breaches looms large, this platform assuages such concerns by encrypting all pertinent information prior to its storage in the database, employing a clandestine key and cryptographic algorithm. Facilitating a payment entails a visit to the Electronic Fund Transfer (EFT) center, utilizing a singular portable card. Subsequent to the cards scanning, the user is furnished with an OTP (One Time Password), a crucial requisite for advancing through subsequent stages. The introduction of this OTP, culled from a singular usage, serves as a pivotal augmentation of security, validating the users authorization. Post successful OTP verification, the user is mandated to input account particulars and execute the fund transfer, thereby fortifying the entire process and culminating in a secure electronic fund transfer predicated on the DES Algorithm. In contemporary times, individuals find themselves frequently necessitating the transfer of financial resources between accounts. In such instances, they are compelled to either traverse to a banking institution or seek out a computing apparatus tethered to the internet to avail themselves of the services proffered by online banking, thereby ensuring a reliable conduit for fund transfers. The efficacy of this system is manifestly advantageous, streamlining the user experience to the mere input of account details. The confluence of security measures, including the application of the AES algorithm, immediate verification protocols, and consistency checks, coalesce to fortify the framework of secure electronic fund transfers. To effectuate a secure transaction, an individual need only visit an Electronic Fund Transfer (EFT) center, employing a singular portable card to facilitate an instantaneous transfer. The utilization of the DES algorithm in this mechanism assures the user of a secure transaction, swiftly executed. Following the scanning of the users card, a Short Message Service (SMS) is expeditiously dispatched, encapsulating a unique One Time Password (OTP). The user, in a testament to heightened security, is mandated to input this OTP, thereby fortifying the transaction. Subsequent to the OTP authentication, the user proceeds to input encrypted account details, safeguarded by the AES algorithm before traversing the network. This comprehensive system thereby guarantees the security of electronic fund transfers through the utilization of AES.Contemporary financial institutions, cognizant of the burgeoning opportunities within the electronic domain, have adeptly capitalized on the potentialities of the internet by developing robust payment systems tailored to diverse payment service requisites KEYWORDS: AES, DES, OTP, Encryption, EFT, ATM

Fortifying Democracy: Deploying Electoral Justice for Robust Personal Data Protection in the Indonesian Election

Elections stand as a cornerstone of democracy, yet the burgeoning integration of technology and personal data underscores the pressing need for safeguarding individual privacy within the electoral process. This study endeavors to scrutinize the efficacy of the Electoral Justice System in fortifying the protection of personal data throughout the registration, verification, and adjudication phases of political party participation in the forthcoming 2024 elections. Through an empirical juridical methodology, this research delves into the practical application of the Electoral Justice System across diverse national contexts, elucidating its role in mitigating the perils of data misuse and upholding electoral integrity. The findings underscore the imperative of imbuing the Electoral Justice System with structural robustness, substantive fidelity, and a conducive legal culture to ensure the seamless functioning of electoral processes. Additionally, stringent regulations, robust data verification protocols, independent oversight mechanisms, and punitive measures emerge as indispensable facets of effective Electoral Justice System implementation, essential for curtailing infringements of the exploitation of personal data and fostering accountable electoral practices.

Essential oils: a systematic review on revolutionizing health, nutrition, and omics for optimal well-being.

Essential oils from various plants have diverse therapeutic properties and are researched extensively. They have applications in medicine, aromatherapy, microbiology, agriculture, livestock, and the food industry, benefiting the population. This systematic review followed the PRISMA verification protocol. The study focused on the anti-inflammatory effects, nutraceutical properties, antioxidant and antibacterial activity of essential oils in lemon, orange, cumin, cinnamon, coriander, rosemary, thyme, and parsley. We also looked at their presence in the diet, their effect, their mechanism of action on health, and the most important active compounds. The search was conducted in the PubMed database for the last 12 years of publications, including in vitro, in vivo, and online cell model tests. Essential oils have been shown to have multiple health benefits, primarily due to their antimicrobial and anti-inflammatory effects. The mechanism of action of cinnamon oil alters bacterial membranes, modifies lipid profiles, and inhibits cell division, giving a potential benefit in protection against colitis. On the other hand, a significant improvement was observed in the diastolic pressure of patients with metabolic syndrome when supplementing them with cumin essential oil. The antimicrobial properties of coriander essential oil, especially its application in seafood like tilapia, demonstrate efficacy in improving health and resistance to bacterial infections. Cumin essential oil treats inflammation. Parsley essential oil is an antioxidant. Orange peel oil is antibacterial, antifungal, antiparasitic, and pro-oxidative. Lemon essential oil affects mouse intestinal microbiota. Thyme essential oil protects the colon against damage and DNA methylation. Carnosic acid in rosemary oil can reduce prostate cancer cell viability by modifying the endoplasmic reticulum function. Essential oils have many therapeutic and antiparasitic properties. They are beneficial to human health in many ways. However, to understand their potential benefits, more research is needed regarding essential oils such as coriander, parsley, rosemary, cumin, and thyme. These research gaps are relevant since they restrict understanding of the possible benefits of these crucial oils for health-related contexts.

ISTVP: Independent single transaction verification protocol for light node using fraud proofs without collaborator

AbstractMost blockchain users run light nodes on mobile devices. Due to limited storage and computation, light nodes cannot perform transaction validation. This shortage makes opportunities for malicious nodes to produce blocks containing invalid transactions, which results in the loss of funds for light nodes. Fraud proofs play a significant role in ensuring transaction security for light nodes. However, existing fraud proof schemes require honest collaborators and the processing of entire blocks. To address these limitations, Independent Single Transaction Verification Protocol for Light node Using Fraud Proofs without Collaborator called ISTVP is proposed that enables light nodes to independently verify transactions and generate fraud proofs without relying on collaborators or processing the entire block. To support ISTVP, SVST is introduced, an efficient block structure for single‐transaction verification. SVST not only efficiently indexes historical transaction outputs to improve verification efficiency, but also significantly reduces the storage requirements for verifying transactions to . Furthermore, the authors analyze the security of ISTVP and demonstrate that it satisfies both persistence and liveness, while maintaining the level of security of full node.