Verification Time Research Articles

Blockchain-Based Practical and Privacy-Preserving Federated Learning with Verifiable Fairness

Federated learning (FL) has been widely used in both academia and industry all around the world. FL has advantages from the perspective of data security, data diversity, real-time continual learning, hardware efficiency, etc. However, it brings new privacy challenges, such as membership inference attacks and data poisoning attacks, when parts of participants are not assumed to be fully honest. Moreover, selfish participants can obtain others’ collaborative data but do not contribute their real local data or even provide fake data. This violates the fairness of FL schemes. Therefore, advanced privacy and fairness techniques have been integrated into FL schemes including blockchain, differential privacy, zero-knowledge proof, etc. However, most of the existing works still have room to enhance the practicality due to our exploration. In this paper, we propose a Blockchain-based Pseudorandom Number Generation (BPNG) protocol based on Verifiable Random Functions (VRFs) to guarantee the fairness for FL schemes. Next, we further propose a Gradient Random Noise Addition (GRNA) protocol based on differential privacy and zero-knowledge proofs to protect data privacy for FL schemes. Finally, we implement both two protocols on Hyperledger Fabric and analyze their performance. Simulation experiments show that the average time that proof generation takes is 18.993 s and the average time of on-chain verification is 2.27 s under our experimental environment settings, which means the scheme is practical in reality.

Theoretical modeling and verification of storage time of cold box based on network method of radiation heat transfer

The storage time of cold box is an important subject. At present, the research method of the storage time is mainly an experiment, and the theoretical research is incomplete. Therefore, in this work, theoretical modeling combined with a network method of radiation heat transfer, the shape factor of heat conduction, and sensible heat of refrigerant were proposed to calculate the storage time of a cold box at various ambient temperatures and amounts of refrigerant. The experimental and simulation results were used to verify the theoretical modeling of the storage time. The influences of the sensible heat of refrigerant and radiation heat transfer in the cold box were analyzed. The stability of the theoretical modeling was studied via simulation of the different cold box and refrigerant materials. The results of the accuracy of the theoretical model confirmed that the maximum error between the theoretical and the experimental storage times is 8.45%, and the error between the theoretical and the simulation results is 7.51%, indicating that the sensible heat of refrigerant and radiation heat transfer have big impacts on the storage time. The stability of the theoretical model is confirmed under the different box and refrigerant materials, and different shapes of refrigerant. The storage time model has stability on different box materials and refrigerant materials. The theoretical model can be severed as a fundamentally guidance for the cold box production design.

Security Verification of an Authentication Algorithm Based on Verifiable Encryption

A new class of cryptosystems called verifiable encryption (VE) that facilitates the verification of two plaintexts without decryption was proposed in our previous paper. The main contributions of our previous study include the following. (1) Certain cryptosystems such as the one-time pad belong to the VE class. (2) We constructed an authentication algorithm for unlocking local devices via a network that utilizes the property of VE. (3) As a result of implementing the VE-based authentication algorithm using the one-time pad, the encryption, verification, and decryption processing times are less than 1 ms even with a text length of 8192 bits. All the personal information used in the algorithm is protected by Shanon’s perfect secrecy. (4) The robustness of the algorithm against man-in-the-middle attacks and plaintext attacks was discussed. However, the discussion about the security of the algorithm was insufficient from the following two perspectives: (A) its robustness against other theoretical attacks such as ciphertext-only, known-plaintext, chosen-plaintext, adaptive chosen-plaintext, chosen-ciphertext, and adaptive chosen-ciphertext attacks was not discussed; (B) a formal security analysis using security verification tools was not performed. In this paper, we analyze the security of the VE-based authentication algorithm by discussing its robustness against the above theoretical attacks and by validating the algorithm using a security verification tool. These security analyses, show that known attacks are ineffective against the algorithm.

Peer-to-Peer User Identity Verification Time Optimization in IoT Blockchain Network.

Blockchain introduces challenges related to the reliability of user identity and identity management systems; this includes detecting unfalsified identities linked to IoT applications. This study focuses on optimizing user identity verification time by employing an efficient encryption algorithm for the user signature in a peer-to-peer decentralized IoT blockchain network. To achieve this, a user signature-based identity management framework is examined by using various encryption techniques and contrasting various hash functions built on top of the Modified Merkle Hash Tree (MMHT) data structure algorithm. The paper presents the execution of varying dataset sizes based on transactions between nodes to test the scalability of the proposed design for secure blockchain communication. The results show that the MMHT data structure algorithm using SHA3 and AES-128 encryption algorithm gives the lowest execution time, offering a minimum of 36% gain in time optimization compared to other algorithms. This work shows that using the AES-128 encryption algorithm with the MMHT algorithm and SHA3 hash function not only identifies malicious codes but also improves user integrity check performance in a blockchain network, while ensuring network scalability. Therefore, this study presents the performance evaluation of a blockchain network considering its distinct types, properties, components, and algorithms' taxonomy.

ARE-Platform: An Augmented Reality-Based Ergonomic Evaluation Solution for Smart Manufacturing

In light of Industry 4.0, rapid analysis and optimization of manufacturing processes are emerging as a vital demand of smart manufacturing factories. Ergonomics is an essential aspect of the ongoing screening of working conditions and a fundamental variable in Industry 4.0, as it calls for a flexible manufacturing system to strengthen the competitiveness of factories in the global market. This paper proposes a new augmented reality-based ergonomic evaluation platform: Augmented Reality-based Ergonomic Platform (ARE Platform). Introducing the Augmented Reality technology by superimposing virtual planning objects into the physically existing production environment. Utilizing the motion capture system collects data for a set of ergonomic indexes (RULA, OWAS, and NIOSH), accessibility and visibility verification. ARE platform could be used in the verification phase of smart manufacturing systems to evaluate the level of risk to workers’ bodies during operations in real-time. The platform reduces the time and economic cost of verification and satisfies the rapid response of ergonomic evaluation and feedback in the context of smart manufacturing. Finally, the developed ARE platform is validated in two rigorous automotive assembly cases in the laboratory. Meanwhile, the ergonomic assessment results are analysed and reported for a people-oriented manufacturing system.

Multi-party co-signature scheme based on SM2.

Two-party collaborative signature scheme is an important cryptographic technology for user authentication and data integrity protection when using mobile devices for financial and securities transactions. However, the two-party collaboration scheme has the following shortcomings: firstly, it is not flexible enough, and it requires the collaborating parties to be secure and trusted; secondly, the two-party collaboration security still needs to be improved. Once a hacker obtains the signature private key and collaborative identity of a mobile device, it can construct a legitimate two-party collaborative signature. Third, the application scenario of two-party co-signature is limited and cannot meet the application scenario of multi-device co-signature. For this reason, this paper designs a multi-party collaborative signature scheme based on SM2 digital signature algorithm in the standard "SM2 Elliptic Curve Public Key Cryptography" of GM/T003-2012. This scheme consists of multiple (more than 2) participants to jointly generate the signature group public key and valid signature in an interactive manner, while ensuring that each user cannot know the signature key other than their own during the signing process. We implement this scheme based on the GMP library. The experimental results show that this scheme is not only flexible but also more secure and trustworthy to meet the application scenario of multi-device collaborative signing. In addition, the time for multiple participants to construct signatures in this scheme is similar, and the time for signature verification is less different from that of the original SM2 signature.

Generation and experimental verification of time and energy optimal coverage motion for industrial machines using a modified S-curve trajectory

Generation and experimental verification of time and energy optimal coverage motion for industrial machines using a modified S-curve trajectory

A remote sensing encrypted data search method based on a novel double-chain

Remote sensing is considered to be a key technology for the development of smart cities. By analysing the data obtained by remote sensing, it is effective to manage and develop smart cities. However, with the rapid urbanisation and the increase in data capacity, how to store and retrieve remote sensing data which have more potential value and privacy with a more effective and safe method has become an imminent issue. In this paper, we propose an efficient verifiable and dynamic multi-keyword searchable encryption scheme for remote sensing data in smart cities. Moreover, we construct a double-chain index to support a multi-keyword search, where the Verification Index Chain is used to identify the users and the Keyword Index Chain is used to store the information of keywords. In addition, we adopt extended bitmap technology to realise update operations and verify the correctness and integrity of the search results. Experiments show that compared to the related existing schemes, the search time of the proposed scheme is reduced by 35% at most, the verification time is reduced by 14% at most and the update time is reduced by 57% at most.

Standardised colour-coded compartmentalised syringe trays improve anaesthetic medication visual search and mitigate cognitive load

BackgroundAnaesthetic procedures are complex and subject to human error. Interventions to alleviate medication errors include organised syringe storage trays, but no standardised methods for drug storage have yet been widely implemented. MethodsWe used experimental psychology methods to explore the potential benefits of colour-coded compartmentalised trays compared with conventional trays in a visual search task. We hypothesised that colour-coded compartmentalised trays would reduce search time and improve error detection for both behavioural and eye-movement responses. We recruited 40 volunteers to identify syringe errors presented in pre-loaded trays for 16 trials in total: 12 error present and four error absent, with eight trials presented for each tray type. ResultsErrors were detected faster when presented in the colour-coded compartmentalised trays than in conventional trays (11.1 s vs 13.0 s, respectively; P=0.026). This finding was replicated for correct responses for error-absent trays (13.3 s vs 17.4 s, respectively; P=0.001) and in the verification time of error-absent trays (13.1 s vs 17.2 s, respectively; P=0.001). On error trials, eye-tracking measures revealed more fixations on the drug error for colour-coded compartmentalised trays (5.3 vs 4.3, respectively; P<0.001), whilst more fixations on the drug lists for conventional trays (8.3 vs 7.1, respectively; P=0.010). On error-absent trials, participants spent longer fixating on the conventional trials (7.2 s vs 5.6 s, respectively; P=0.002). ConclusionsColour-coded compartmentalisation enhanced visual search efficacy of pre-loaded trays. Reduced fixations and fixation times for the loaded tray were shown for colour-coded compartmentalised trays, indicating a reduction in cognitive load. Overall, colour-coded compartmentalised trays were associated with significant performance improvements when compared with conventional trays.

A Numerical Method of Aligning the Optical Stacks for All Pixels

Reducing performance verification time is significant in product launch and production costs. This is especially true because aligning the optical stacks of off-axis pixels is a time-consuming task, but it is important to maintain sensitivity. In this paper, a numerical method to align the optical stacks of off-axis pixels is suggested in order to reduce performance test time. The components of the numerical method are the optical stack height, refractive index, and chief ray angle in order to calculate the optical stacks' optimal shift distance. The proposed method was investigated to confirm effectiveness by using optical simulation. The sub-micron backside illumination (BSI) pixels were simulated, having 2 × 2 microlens, quad-color filter array, and in-pixel deep trench isolation (DTI). Moreover, the proposed method was evaluated for various pixel pitches, microlens shapes, and CRAs. As a result, the optical stacks were optimized by using the numerical method and validated via optical simulation. Therefore, the proposed numerical method is expected to help reduce the time and cost.

Dynamic Signature Verification Technique for the Online and Offline Representation of Electronic Signatures in Biometric Systems

Biometric systems input physical or personal human characteristics for identification, authentication, and security purposes. With the advancement in communication and intelligent security systems, biometrics are programmed to validate electronic signatures (E-signatures) for online and offline authentication. This article introduces a dynamic signature verification technique (DSVT) using mutual compliance (MC) between the security system and the biometric device. The security system is responsible for online and offline signature approval using personal inputs from humans. This personal verification is related to the stored online/offline signatures using certificates provided for authentication. The certificate-based authentication is valid within a session for online representation. Contrarily, this authentication is valid for persons under offline conditions. In this mode of segregation, application-level authentication verification is performed. A conventional tree classifier for dynamic signature verification is used for differentiating online and offline signatures. Moreover, the security metrics—such as signing bit, key, and size—are verified for both modes using classifier learning. For the segregated mode, the validation of the above is required to be unanimous to accelerate the dynamicity. The proposed technique’s performance is analyzed using the authentication success rate, verification failing ratio, verification time, and complexity.

A SM2 based efficient and lightweight batch verification approach for IC cards

With the rapid development of the Internet of Things (IoT), IoT security has become more and more important. A large number of IoT tasks use digital signatures to ensure authenticity, integrity, and non-repudiation. However, verifying lots of signatures reduces the performance of the IoT system. Batch verification can verify multiple digital signatures at the same time, which reduces the computational overhead and verification time compared with consecutive respective verification. Thus it is suitable for IoT systems. SM2(Shangyong Mima 2) digital signature algorithm is a public key cryptographic algorithm based on elliptic curve cryptography(ECC), and is widely used in IoT applications. We propose SM2Verifi in this paper, a batch verification approach for SM2 digital signatures. SM2Verifi calculates fewer scalar multiplications than consecutive respective verification and uses the KGLP algorithm and the multi-parameter inversion algorithm to speed up scalar multiplications and inversions. Therefore, SM2Verifi greatly reduces the computational overhead and verification time. SM2Verifi generates a set of random integers through the addition chain seminumeric computation to resist possible forged signatures and determines whether to accept a batch of signatures by calculating congruence equations and resultants. Our extensive experiments on NXP smart cards show that SM2Verifi can significantly improve verification efficiency. Specifically, without randomization, batch verification of nine signatures belonging to one signer is 6.41 times faster than respective verification. Considering the verification performance, security, and hardware overhead, SM2Verifi achieves the comprehensive optimum when verifying seven signatures signed either by one signer or seven signers with 32-bit randomization.

An Anonymous Authentication With Received Signal Strength Based Pseudonymous Identities Generation for VANETs

Our proposed key stream derived from shared key generation process based on received signal strength (RSS) represents pseudonymous identities (PIDs) utilized in an anonymous authentication is obtained through an interactive connection between communicating mobile users and an authorized entity taken over by a Group Manager (GM). This process goal is fetching some credentials in advance, when mobile users actively and anonymously are playing their role in the system. These PIDs could be embedded in the credential equipped to the participating mobile users. They should be usually unique and must be secured from any adversary when doing any either attack or treat. In this paper, our proposed shared key generation derived from RSS between communicating mobile users and GM provides unique PIDs. Then, the embedded PID at an epoch time as a part of mobile users secret key together with credential components are used for signing a message anonymously. Based on PID at epoch time and updated revocation list obtained from GM, verifier user ensures the validity of signature. The measurement scenario of system performance is done by varying the traffic conditions either quiet or crowded to create communication impairment combined with mobile users’ speed varying on 20 km/h, 40 km/h, and 60 km/h respectively. The <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ping</i> time interval is varied as well, it is configured to 7 ms, 10 ms, and 20 ms, respectively. Here, the result of evaluation showed that PIDs generation works properly by the number of generated PIDs up to 11 with the highest correlation is achieved up to 0.99. Meanwhile, quantization algorithm works properly for 3000 or more ICMP packets and achieves zero key disagreement rate (KDR). Total signing and verification times are sufficient practical about 90 ms and 100 ms, respectively.

A Data Integrity Verification Scheme for Centralized Database Using Smart Contract and Game Theory

Currently, many companies and institutions use centralized or distributed databases to store massive amounts of data. However, the use of untrusted centralized third-party auditors can result in security issues because these auditors may be malicious and tamper with or delete user data. This poses a significant challenge for ensuring the reliability of the data verification results. Although introducing a third-party auditor can help address this issue, it may also be untrustworthy and collude with the database service provider to forge false data verification results. In this study, we propose a data integrity verification scheme using smart contracts (DIV-SC) to address this challenge in a centralized database environment. Our approach utilizes blockchain technology as a decentralized third-party auditor, ensuring that the information stored on the blockchain is immutable and cannot be tampered with maliciously. In addition, smart contracts deployed on the blockchain can ensure that the verification procedures are correct and are not affected by any malicious party. We also leverage game theory to improve the reliability of multiple verifications, reduce verification time and improve overall performance. Our proposed scheme reduces the total verification time consumption by up to 53.44% while increasing the number of verifiable times by nearly 3.8 times, compared to conventional data integrity verification schemes.

Rad-hard RISC-V SoC and ASIP ecosystems studies for high-energy physics applications

The increase in complexity and size of modern ASIC designs in the HEP community and the use of advanced semiconductor fabrication processes raises the need for a shift toward a more abstract design methodology, that takes advantage of modularity and programmability to achieve a faster turnaround time both for design and verification. This contribution will present two complementary approaches, one using a RISC-V based System-on-Chip (SoC) and the other based on Application-Specific Instruction set Processors (ASIP). The SoC uses the PicoRV32 open-source RISC-V core and a rad-hard version of the AMBA APB bus to connect peripherals and is primarily geared towards control and monitoring applications. This solution is a demonstrator of what can become a more complete fully radiation-tolerant SoC platform with a standardized interconnect and an IP block library, to serve as the starting point for future ASIC designs. The ASIP based approach targets more the design of data path elements and the use in data processing applications. The presented approach makes use of a commercial ASIP Designer EDA tool to demonstrate an integrated workflow to define, benchmark and optimize an ASIP for a specific use case, starting from a general-purpose processor.

A planning-based feasibility study of MR-Linac treatment for anal cancer radiation therapy.

The hybrid magnetic resonance image (MRI) scanner and radiation therapy linear accelerator (MR-Linac) has the potential to enhance clinical outcomes for anal cancer (AC) patients with improved soft tissue visualization and daily plan adaption but has planning and delivery limitations due to the incorporation of MRI. We aimed to identify if Elekta Unity MR-Linac-based radiation therapy is feasible for anal cancer. Ten prospectively enrolled AC patients treated with radical chemoradiotherapy were replanned for MR-Linac treatment using departmental planning criteria. For comparison, and to reduce interobserver variability, volumetric modulated arc radiation therapy (VMAT) plans were also created for each patient by the same single senior radiation therapist. Plans were compared using departmental dosimetric plan criteria, as well as conformity and homogeneity indices, monitor units (MUs) and measured plan delivery (beam-on) time. Results were deemed clinically acceptable. Target and organ at risk (OAR) doses were comparable between MR-Linac plans and VMAT plans, although PTV45Gy D98% coverage was compromised in 3 of 10 MR-Linac plans due to caudocranial length exceeding the limits of the MR-Linac. MR-Linac plans had lower MUs, median of 689.1 vs 849.65 (p = 0.002), but took over twice as long to deliver, 529.5s vs 224s (p = <0.0001) as VMAT plans. MR-Linac planning and treatment of AC is feasible for a subset of patients. The current physical limitations of the Elekta Unity system mean patients with large caudocranial elective PTV45Gy target volumes may not be covered dosimetrically to the required clinical standard. Longer image verification and treatment delivery times of the MR-Linac also mean patient selection and intrafractional IGRT are likely to be integral to ensuring high quality clinical outcomes in this rare cancer.

IoT-Based Biometric Recognition Systems in Education for Identity Verification Services: Quality Assessment Approach

Traditional identity verification of students based on the human proctoring approach can cause a scam identity verification and ineffective processing time, particularly among vast groups of students. Most student identification cards are outdated personal information. Several biometric recognition approaches have been proposed and can be adopted to strengthen students’ identity verification. Most educational adoption technology struggles with evaluation and validation techniques to ensure that biometric recognition systems are unquestionably suitable for utilization and implementation to fulfill student identity verification. This study presents the internet of things to develop flexible biometric recognition systems and an approach to assess the quality of biometric systems for educational use by investigating the effectiveness of identity verification of various biometric recognition technologies compared to the traditional verification method. The unimodal, multimodal, and semi-multimodal biometric technologies were tested using the developed internet of things-base biometric recognition systems examined by applying the proposed quality metrics of scoring factors based on accuracy, error rate, processing time, and cost. Hundreds of undergraduate exam takers were a sample group. Key findings indicate that the designed and presented systems suitably attain identity verification of exam students using a unimodal biometric. A unimodal face biometric system promises excellent support. A unimodal fingerprint biometric system assures the second excellent aid for student identity verification. However, multimodal and semi-multimodal biometric systems provide better accuracy with few handling times and higher costs. This study contributes significantly to the knowledge of utilizing biometric recognition for identity verification in smart educational use.

Secured Access Policy in Ciphertext-Policy Attribute-Based Encryption for Cloud Environment

The cloud allows clients to store and share data. Depending on the user’s needs, it is imperative to design an effective access control plan to share the information only with approved users. The user loses control of their data when the data is outsourced to the cloud. Therefore, access control mechanisms will become a significant challenging problem. The Ciphertext-Policy Attribute-Based Encryption (CP-ABE) is an essential solution in which the user can control data access. CP-ABE encrypts the data under a limited access policy after the user sets some access policies. The user can decrypt the data if they satisfy the limited access policy. Although CP-ABE is an effective access control program, the privacy of the policy might be compromised by the attackers. Namely, the attackers can gather important information from plain text policy. To address this issue, the SHA-512 algorithm is presented to create a hash code for the user’s attributes in this paper. Depending on the created hash codes, an access policy will be formed. It leads to protecting the access policy against attacks. The effectiveness of the proposed scheme is assessed based on decryption time, private key generation time, ciphertext generation time, and data verification time.

Dynamic Evolutionary Game-based Modeling, Analysis and Performance Enhancement of Blockchain Channels

The recent development of channel technology has promised to reduce the transaction verification time in blockchain operations. When transactions are transmitted through the channels created by nodes, the nodes need to cooperate with each other. If one party refuses to do so, the channel is unstable. A stable channel is thus required. Because nodes may show uncooperative behavior, they may have a negative impact on the stability of such channels. In order to address this issue, this work proposes a dynamic evolutionary game model based on node behavior. This model considers various defense strategies' cost and attack success ratio under them. Nodes can dynamically adjust their strategies according to the behavior of attackers to achieve their effective defense. The equilibrium stability of the proposed model can be achieved. The proposed model can be applied to general channel networks. It is compared with two state-of-the-art blockchain channels: Lightning network and Spirit channels. The experimental results show that the proposed model can be used to improve a channel's stability and keep it in a good cooperative stable state. Thus its use enables a blockchain to enjoy higher transaction success ratio and lower transaction transmission delay than the use of its two peers.

A Design Support Tool Set for Interface Circuits Between Synchronous and Asynchronous Modules

In this paper, we propose a design support tool set for interface circuits between synchronous and asynchronous modules. To facilitate the design of interface circuits between synchronous and asynchronous modules, the proposed tool set generates interface circuits and design constraints based on a predefined communication scheme. In addition, the proposed tool set performs timing verification and delay adjustment to guarantee the operations of the generated interface circuits. In the experiment, we evaluated the latency and overhead of the generated interface circuits. The latency and handshake overhead of the interface circuits generated by the proposed tool set depend on the cycle time of the receiver module. In addition, we designed a system which consists of a synchronous RISC-V processor and an asynchronous multilayer perceptron (MLP) circuit using the proposed tool set. The energy consumption of the system was reduced by 34.0% compared with a system which uses a synchronous MLP circuit.