Aggregation Scheme Research Articles

Lightweight verifiable privacy-preserving infectious disease surveillance data aggregation scheme with fault tolerance

Lightweight verifiable privacy-preserving infectious disease surveillance data aggregation scheme with fault tolerance

Data Aggregation Scheme Using Differential Evolution with Sailfish Optimization for Clustering and Routing in IoT

Data Aggregation Scheme Using Differential Evolution with Sailfish Optimization for Clustering and Routing in IoT

A Many-objective Joint Device Selection and Aggregation Scheme for Federated Learning in IoV

A Many-objective Joint Device Selection and Aggregation Scheme for Federated Learning in IoV

A secure and efficient data aggregation scheme for cloud–edge collaborative smart meters

Smart meters are part of the Advanced Measurement Infrastructure (AMI) system in the smart grid. It facilitates data transfer between consumers and electricity suppliers (ES). However, the mass deployment of smart meters (SM) brings heavy overhead to grid operation and poses serious privacy threats. To this end, this paper proposes a secure and efficient data aggregation scheme of cloud–edge collaboration smart meters. At first, we standardize the users’ historical electricity load features and use the improved K-Means clustering algorithm to calculate the Euclidean distance between feature vectors to obtain the classification results of users’ load features. On this basis, ES generates relevant parameters to encrypt meter data and protect users’ data privacy based on classification results. The aggregator (Ag) performs the data aggregation, generates the overall signature using the Schnorr aggregation signature method, and sends it to the cloud server (CS). The ES queries the CS to obtain data and parses it to realize the customer billing service. Meanwhile, this paper executes a series of experiments, and the results show that the proposed scheme exhibits significant advantages in privacy protection and system operation efficiency.

Differential evolution optimization based ensemble framework for accurate cervical cancer diagnosis

Cervical cancer remains a significant global health concern, demanding accurate and efficient diagnostic approaches for early detection and treatment. However, there are situations where a single deep learning model might not be sufficient to adequately capture the pertinent information required for precise disease prediction from intricate datasets. In this paper, we introduce an innovative ensemble learning framework that leverages the Differential Evolution (DE) algorithm to enhance the detection of cervical cancer. Our innovative approach combines the collective strength of a diverse set of base models using feature fusion techniques to achieve precise and robust classification. We have developed three base models, denoted as Fusion 1, Fusion 2, and Fusion 3, where each fusion model incorporates two pre-trained models using a feature fusion technique. To capture sequential dependencies and improve feature attention, we have integrated ConvLSTM layers and Squeeze-and-Excitation (SE) blocks into these base models. Subsequently, we've amalgamated the predictions of each base model using a weighted aggregation scheme, with the weights optimized using the DE algorithm. Our ensemble framework introduces a novel method for dynamic weight adjustment, utilizing advanced fusion techniques to improve cervical cancer detection accuracy. This approach ensures robust diagnostic performance across cancer cells datasets, enhancing patient outcomes and community health. Our evaluation covers two datasets, SIPaKMeD and Mendeley LBC, demonstrating the remarkable performance and robustness of our ensemble model. It consistently outperforms individual base models and even surpasses state-of-the-art methods, achieving an impressive accuracy rate of 98.96 % on the Mendeley LBC dataset and 95.68 % on the SIPaKMeD dataset. The incorporation of ConvLSTM layers, SE blocks, and DE optimization significantly contributes to the model's exceptional accuracy, its ability to generalize effectively, and its adaptability to diverse scenarios. Additionally, we employ Grad-CAM to visualize how the base models focus on crucial regions for accurate predictions, providing insights into the model's decision-making process. Our ensemble model exhibits outstanding Area under the Curve (AUC) values in Receiver Operating Characteristic (ROC) analysis, further confirming its effectiveness. This research represents a significant advancement in cervical cancer detection, underscoring the potential of ensemble learning techniques optimized through DE for enhancing diagnostic accuracy and advancing patient care.

UCC: A unified cascade compression framework for vision transformer models

In recent years, Vision Transformer (ViT) and its variants have dominated many computer vision tasks. However, the high computational consumption and training data requirements of ViT make it challenging to be deployed directly on resource-constrained devices and environments. Model compression is an effective approach to accelerate deep learning networks, but existing methods for compressing ViT models are limited in their scopes and struggle to strike a balance between performance and computational cost. In this paper, we propose a novel Unified Cascaded Compression Framework (UCC) to compress ViT in a more precise and efficient manner. Specifically, we first analyze the frequency information within tokens and prune them based on a joint score of their both spatial and spectral characteristics. Subsequently, we propose a similarity-based token aggregation scheme that combines the abundant contextual information contained in all pruned tokens with the host tokens according to their weights. Additionally, we introduce a novel cumulative cascaded pruning strategy that performs bottom-up cascaded pruning of tokens based on cumulative scores, avoiding information loss caused by individual idiosyncrasies of blocks. Finally, we design a novel two-level distillation strategy, incorporating imitation and exploration, to ensure the diversity of knowledge and better performance recovery. Extensive experiments demonstrate that our unified cascaded compression framework outperforms most existing state-of-the-art approaches, compresses the floating-point operations of ViT-Base as well as DeiT-Base models by 22 % and 54.1 %, and improves the recognition accuracy of the models by 3.74 % and 1.89 %, respectively, significantly reducing model computational consumption while enhancing performance, which enables efficient end-to-end training of compact ViT models.

Fermatean trapezoidal fuzziness average aggregation scheme for selection of infant clothing by group decision-making

The textile industry has gradually increased its use of various chemicals and the quantity of residues produced. Newborn baby apparel should be made of safe materials since it often comes into touch with them. Infant cloth selection is determined via group decision-making in Fermatean trapezoidal fuzzy number (FTFN). This study provides a new score and accuracy function and weighted, ordered, and hybrid averaging aggregation operators on FTFN. The properties of the proposed averaging aggregation operators on FTFN are presented. An algorithm for the multi-attribute group decision-making (MAGDM) approach will be proposed by applying the proposed averaging aggregation operators. The case studies concentrate on choosing newborn clothing with reduced chemical content within the textile sector. The presentation of the sensitivity analysis of the criterion weights is conducted to guarantee the durability and stability of the framework that has been implemented. Furthermore, a comprehensive analysis compares the novel framework with previous models, highlighting its superior performance.

A Short term Electricity Load Forecasting for Community Residents Based on Federated Learning and Considering Privacy Protection

INTRODUCTION: As the penetration rate of renewable energy increases and patterns of energy demand evolve, fluctuations on both the supply and demand sides of electricity are becoming more pronounced. Consequently, accurate forecasting of community residential electrical loads has become crucial. OBJECTIVES: Although the widespread adoption of smart meters among residents provides abundant data for model training, strict challenges arise during the training process due to the need for privacy protection and data security. METHODS: This paper proposes a privacy-preserving community residential short-term electric load forecasting method based on federated learning. Initially, the method applies shared random masking encryption to the sensitive data of community residents, ensuring data privacy while maintaining consistency with the original data after preprocessing. Subsequently, a private data aggregation scheme is established to perform dynamic clustering of the community’s electrical load. RESULTS: The clustered model then serves as the basis for establishing individual load forecasting models for each category of community residents to predict short-term electrical loads. Finally, an empirical analysis is performed using the electrical load data from 120 households across 6 communities in a city in Southern China. CONCLUSION: The analysis demonstrates that the proposed method can achieve the prediction of community residential electrical loads without sharing residents’ data, thus verifying the effectiveness of this approach.

Polyvinyl alcohol assisted citrate based reduction of gold(III) ions: Theoretical design and experimental study on green synthesis of spherical and biocompatible gold nanoparticles

In this study, we demonstrate the synthesis of small gold nanoparticles (typically 8-10 nm) through a green synthesis approach. This method involves utilizing chloroauric acid as the gold precursor, trisodium citrate as a mild reducing and co-capping agent, and polyvinyl alcohol (PVA), as a co-capping and shape-directing agent. This novel synthesis method stands alone as a protocol that involves just mixing the reagents at room temperature and allowing the reaction to proceed at ambient temperature without any disturbance. In the absence of PVA, spherical particles are not formed and the reaction mixture slowly turns black followed by precipitation.The synthesis process was meticulously tracked using time-resolved monitoring of the growth of the localized surface plasmon resonance (LSPR) by UV-vis spectroscopy and transmission electron microscopy. The as-prepared colloidal gold solution was bright red, attributed to the small size (≤ 10 nm) and spherical geometry of nanoparticles. This colloidal solution could be stored indefinitely at room temperature without precipitation or a change in its absorption profile. The nanoparticles remained stable in adverse conditions such as 100 mM NaCl solution, 1×PBS and cell culture medium. Additionally, they could be easily loaded with drugs like doxorubicin by adsorption. The particles were thoroughly characterized using a range of techniques, including UV-vis spectroscopy, attenuated total reflectance Fourier-transform infrared spectroscopy (ATR-FTIR), high-resolution transmission electron microscopy (HRTEM), hyperspectral-enhanced dark field microscopy (HEDFM), dynamic light scattering (DLS), and X-ray photoelectron spectroscopy (XPS). Cell viability tests conducted on 2D cell lines and 3D spheroids revealed negligible toxicity even at high concentrations. Furthermore, we demonstrate that an advanced version of conventional diffusion-limited aggregation (DLA) schemes, which allows individual clusters to move freely within a domain to form larger aggregates, can effectively replicate the intricate interactions between chloroauric acid, trisodium citrate, and PVA, the agents involved in the synthesis of gold nanoparticles.

A novel computational signal processing framework towards multimodal vital signs extraction using neck-worn wearable devices

Pulse rate (PR) and respiratory rate (RR) are two of the most important vital signs. Monitoring them would benefit from easy-to-use technologies. Hence, wearable devices would, in principle, be ideal candidates for such systems. The neck, although highly susceptible to artifacts, presents an attractive location for a diverse pool of physiological biomarkers monitoring purposes such as airflow sensing in a non-obstructive manner. This paper presents a methodology for PR and RR estimation using photoplethysmography (PPG) and accelerometry (Acc) sensors placed on the neck. Neck PPG and Acc signals were recorded from 22 healthy participants for RR estimation, where the resting subjects performed guided breathing following a visual metronome. Neck PPG signals were obtained from 16 healthy participants who breathed through an altitude generator machine in order to acquire a wider range of PR readings while at rest. The proposed methodology was able to provide rate estimates via a combination of recursive FFT-based dominance scoring coupled with an exponentially weighted moving average (EWMA)-driven aggregation scheme. The recursion aimed at bypassing sudden intra-window amplitude deviations caused by momentary artifacts, while the EWMA-based aggregation was utilized for handling inter-window artifact-induced deviations. To further improve estimation stability and confidence, estimates were calculated in the form of rate bands taking into account the relevant clinically acceptable error margins, and results when considering rate values and rate bands are presented and discussed. The framework was able to achieve an overall pulse rate value accuracy of 93.67±7.64\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$93.67\\pm 7.64$$\\end{document}% within the clinically acceptable ± 5 BPM with reference to the gold-standard reference devices while providing an overall respiratory rate value accuracy within the clinically appropriate ± 3 BrPM of 94.94±3.56\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$94.94\\pm 3.56$$\\end{document}% with reference to the guiding visual metronome, and 88.4±7.63\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$88.4\\pm 7.63$$\\end{document}% with respect to the gold-standard reference device. The proposed methodology achieves acceptable PR and RR estimation capabilities, even when signals are acquired from an unusual location such as the neck. This work introduces novel ideas that can lead to the development of medical device outputs for PR and RR monitoring, especially capitalizing on the advantages of the neck as a multi-modal physiological monitoring location.

VCSA: Verifiable and collusion-resistant secure aggregation for federated learning using symmetric homomorphic encryption

As a novel distributed learning framework for protecting personal data privacy, federated learning, (FL) has attained widespread attention through sharing gradients among users without collecting their data. However, an untrusted cloud server may infer users’ individual information from gradients and global model. In addition, it may even forge incorrect aggregated results to save resources. To deal with these issues, despite that the existing works can protect local model privacy and achieve verifiability of aggregated results, they are defective in protecting global model privacy, guaranteeing verifiability if collusion attacks occur, and suffer from high computation cost. To further tackle the above challenges, a verifiable and collusion-resistant secure aggregation scheme for FL is proposed, named VCSA. Concretely, we combine symmetric homomorphic encryption with single masking to protect model privacy. Meanwhile, we adopt verifiable multi-secret sharing and generalized Pedersen commitment to achieve verifiability and prevent users from uploading incorrect shares. Furthermore, high model accuracy can be ensured even if some users go offline. Security analysis illustrates that our VCSA enhances the security of FL, realizes verifiability despite collusion attacks and robustness to dropout. Performance evaluation displays that our VCSA can reduce at least 28.27% and 79.15% regarding computation cost compared to existing schemes.

Rank-transformed subsampling: inference for multiple data splitting and exchangeable p-values

Abstract Many testing problems are readily amenable to randomized tests, such as those employing data splitting. However, despite their usefulness in principle, randomized tests have obvious drawbacks. Firstly, two analyses of the same dataset may lead to different results. Secondly, the test typically loses power because it does not fully utilize the entire sample. As a remedy to these drawbacks, we study how to combine the test statistics or p-values resulting from multiple random realizations, such as through random data splits. We develop rank-transformed subsampling as a general method for delivering large-sample inference about the combined statistic or p-value under mild assumptions. We apply our methodology to a wide range of problems, including testing unimodality in high-dimensional data, testing goodness-of-fit of parametric quantile regression models, testing no direct effect in a sequentially randomized trial and calibrating cross-fit double machine learning confidence intervals. In contrast to existing p-value aggregation schemes that can be highly conservative, our method enjoys Type I error control that asymptotically approaches the nominal level. Moreover, compared to using the ordinary subsampling, we show that our rank transform can remove the first-order bias in approximating the null under alternatives and greatly improve power.

LB-CLAS: Lattice-based conditional privacy-preserving certificateless aggregate signature scheme for VANET

The rapid development of vehicular ad-hoc networks (VANETs) has brought great convenience to intelligent transportation, and the secure transmission of information in VANETs has become a serious problem. In addition, the protection of private information of vehicles is also a key issue. Aiming at the problem of how to guarantee the secure transmission of information in VANETs under the condition of satisfying security and privacy, we propose a lattice-based conditional privacy-preserving certificateless aggregate signature scheme (LB-CLAS) for VANETs. Instead of using Number Theory Research Unit (NTRU) lattices and discrete Gaussian sampling, the proposed LB-CLAS scheme is based on algebraic lattice. In addition, based on the module version of Small Integer Solution (MSIS) and module version of Learning With Error (MLWE) hard problems, we prove that the LB-CLAS scheme is existential unforgeability under adaptively chosen message attacks (EUF-CMA). Our LB-CLAS scheme employs individual signature verification in vehicle-to-vehicle (V2V) mode, while utilizing aggregate signatures and batch verification in vehicle-to-infrastructure (V2I) mode, with slightly differing transmission parameters between the two modes. Based on Dilithium, our LB-CLAS scheme solves the problem of high storage overhead and computational cost of existing schemes. The performance analysis shows that our LB-CLAS scheme is more efficient in terms of computation cost, storage overhead, and power consumption compared to existing schemes. Compared with existing schemes, our LB-CLAS scheme reduces the signature and verification overheads by more than 17.6% and 43.4%, respectively. Our LB-CLAS program also has significant advantages in batch verification. As the number of vehicles increases, our batch certification time cost is reduced by more than 90%. In addition, our LB-CLAS scheme has the smallest signature length, with a signature size that is 1X smaller than the most efficient existing scheme for the same level of security.

ECC based certificateless aggregate signature scheme for healthcare wireless sensor networks

ECC based certificateless aggregate signature scheme for healthcare wireless sensor networks

An Efficient and Multi-Private Key Secure Aggregation Scheme for Federated Learning

An Efficient and Multi-Private Key Secure Aggregation Scheme for Federated Learning

Improved Scheme for Data Aggregation of Distributed Oracle for Intelligent Internet of Things.

Oracle is a data supply mechanism that provides real-world data for blockchain. It serves as a bridge between blockchain and the IoT world, playing a crucial role in solving problems such as data sharing and device management in the IoT field. The main challenge at this stage is determining how to achieve data privacy protection in distributed Oracle machines to safeguard the value hidden in data on the blockchain. In this paper, we propose an improved scheme for distributed Oracle data aggregation based on Paillier encryption algorithm, which achieves end-to-end data privacy protection from devices to users. To address the issue of dishonest distributed Oracle machines running out of funds, we have designed an algorithm called PICA (Paillier-based InChain Aggregation). Based on the aggregation on the Chainlink chain and the Paillier encryption algorithm, random numbers are introduced to avoid the problem of dishonest Oracle machines running out of funds. We use the traffic coverage method to solve the problem of exposed request paths in distributed Oracle machines. Simulation and experimental results show that in small and medium-sized IoT application scenarios with 10,000 data nodes, each additional false request in a single request will result in a delay of about 2 s in data acquisition and can achieve a request response time of 20 s. The proposed method can achieve user data privacy protection.

Secure pairing-free certificateless aggregate signcryption scheme for IoT

The widespread application of wireless sensor technology in the Internet of Things (IoT) industry significantly enhances productivity. However, the large scale deployment of IoT and the inherent vulnerabilities of wireless communication methods to attacks present significant new challenges. Consequently, there is a need to address the efficiency and security of information transfer in IoT. To effectively solve these issues, this paper presents a secure and efficient pairing-free certificateless aggregated signcryption (CL-ASC) scheme for IoT based on the elliptic curve cryptosystem. Our scheme avoids the complex certificate management issues associated with Public Key Cryptography (PKC) and the key escrow problem found in identity-based cryptography, while maintaining the storage and communication efficiency benefits of aggregated signcryption. The use of secure signcryption and aggregation techniques effectively resists a variety of potential attacks. Both formal and informal security analyses demonstrate that our scheme meets the expected security requirements. Specifically, our scheme shows significant improvements in computational and communication overheads. Compared to other state-of-the-art protocols, our scheme achieves signcryption computation cost of 0.691 ms, unsigncryption computation cost of 3.917 ms for 5 messages, and a total cost of 4.608 ms for 5 messages. Additionally, it provides a signcryption communication overhead of 128 bytes and aggregated communication overhead of 580 bytes for 5 messages.

Multi-source fully test-time adaptation

Deep neural networks have significantly advanced various fields. However, these models often encounter difficulties in achieving effective generalization when the distribution of test samples varies from that of the training samples. Recently, some fully test-time adaptation methods have been proposed to adapt the trained model with the unlabeled test samples before prediction to enhance the test performance. Despite achieving remarkable results, these methods only involve one trained model, which could only provide certain side information for the test samples. In real-world scenarios, there could be multiple available trained models that are beneficial to the test samples and are complementary to each other. Consequently, to better utilize these trained models, in this paper, we propose the problem of multi-source fully test-time adaptation to adapt multiple trained models to the test samples. To address this problem, we introduce a simple yet effective method utilizing a weighted aggregation scheme and introduce two unsupervised losses. The former could adaptively assign a higher weight to a more relevant model, while the latter could jointly adapt models with online unlabeled samples. Extensive experiments on three image classification datasets show that the proposed method achieves better results than baseline methods, demonstrating the superiority in adapting to multiple models.

Robust Distributed Learning Against Both Distributional Shifts and Byzantine Attacks.

In distributed learning systems, robustness threat may arise from two major sources. On the one hand, due to distributional shifts between training data and test data, the trained model could exhibit poor out-of-sample performance. On the other hand, a portion of working nodes might be subject to Byzantine attacks, which could invalidate the learning result. In this article, we propose a new research direction that jointly considers distributional shifts and Byzantine attacks. We illuminate the major challenges in addressing these two issues simultaneously. Accordingly, we design a new algorithm that equips distributed learning with both distributional robustness and Byzantine robustness. Our algorithm is built on recent advances in distributionally robust optimization (DRO) as well as norm-based screening (NBS), a robust aggregation scheme against Byzantine attacks. We provide convergence proofs in three cases of the learning model being nonconvex, convex, and strongly convex for the proposed algorithm, shedding light on its convergence behaviors and endurability against Byzantine attacks. In particular, we deduce that any algorithm employing NBS (including ours) cannot converge when the percentage of Byzantine nodes is [Formula: see text] or higher, instead of [Formula: see text] , which is the common belief in current literature. The experimental results verify our theoretical findings (on the breakpoint of NBS and others) and also demonstrate the effectiveness of our algorithm against both robustness issues, justifying our choice of NBS over other widely used robust aggregation schemes. To the best of our knowledge, this is the first work to address distributional shifts and Byzantine attacks simultaneously.

CESA: Communication efficient secure aggregation scheme via sparse graph in federated learning

As a distributed learning paradigm, federated learning can be effectively applied to the decentralized system since it can resolve the “data island” problem. However, it is also vulnerable to serious privacy breaches. Although existing secure aggregation technique can address privacy concerns, they also incur significant additional computation and communication costs. To address these challenges, this paper offers a Communication Efficient Secure Aggregation scheme. Firstly, the central server uses the communication delay between terminals as the weight of the fully terminal-connected graph to transform it into a sparse connected graph based on the minimal spanning tree. Secondly, instead of relying on central server for key advertisement, the terminals advertise keys via a neighboring terminal forwarding approach based on sparsely graph. Thirdly, we propose using the central server for auxiliary advertising to address unexpected terminal dropout. Simultaneously, we theoretically demonstrate our scheme’s security and have lower computation and communication costs. Experiments show that CESA can reduce the running time by 28.2% without sacrificing security and model accuracy compared to conventional secure aggregation when there are 10 terminals in the system.