Client-server Research Articles

A complete client–server architecture providing prevention from insider attack using homogeneous multi-core RSA crypto-processor

A complete client–server architecture providing prevention from insider attack using homogeneous multi-core RSA crypto-processor

Smart-KG: Partition-Based Linked Data Fragments for querying knowledge graphs

RDF and SPARQL provide a uniform way to publish and query billions of triples in open knowledge graphs (KGs) on the Web. Yet, provisioning of a fast, reliable, and responsive live querying solution for open KGs is still hardly possible through SPARQL endpoints alone: while such endpoints provide a remarkable performance for single queries, they typically can not cope with highly concurrent query workloads by multiple clients. To mitigate this, the Linked Data Fragments (LDF) framework sparked the design of different alternative low-cost interfaces such as Triple Pattern Fragments (TPF), that partially offload the query processing workload to the client side. On the downside, such interfaces still come with the expense of unnecessarily high network load due to the necessary transfer of intermediate results to the client, leading to query performance degradation compared with endpoints. To address this problem, in the present work, we investigate alternative interfaces, refining and extending the original TPF idea, which also aims at reducing server-resource consumption, by shipping query-relevant partitions of KGs from the server to the client. To this end, first, we align formal definitions and notations of the original LDF framework to uniformly present existing LDF implements and such “partition-based” LDF approaches. These novel LDF interfaces retrieve, instead of the exact triples matching a particular query pattern, a subset of pre-materialized, compressed, partitions of the original graph, containing all answers to a query pattern, to be further evaluated on the client side. As a concrete representative of partition-based LDF, we present smart-KG+, extending and refining our prior work (In WWW ’20: The Web Conference 2020 (2020) 984–994 ACM / IW3C2) in several respects. Our proposed approach is a step forward towards a better-balanced share of the query processing load between clients and servers by shipping graph partitions driven by the structure of RDF graphs to group entities described with the same sets of properties and classes, resulting in significant data transfer reduction. Our experiments demonstrate that the smart-KG+ significantly outperforms existing Web SPARQL interfaces on both pre-existing benchmarks for highly concurrent query execution as well as an accustomed query workload inspired by query logs of existing SPARQL endpoints.

Efficient federated learning for pediatric pneumonia on chest X-ray classification

According to the World Health Organization (WHO), pneumonia kills about 2 million children under the age of 5 every year. Traditional machine learning methods can be used to diagnose chest X-rays of pneumonia in children, but there is a privacy and security issue in centralizing the data for training. Federated learning prevents data privacy leakage by sharing only the model and not the data, and it has a wide range of application in the medical field. We use federated learning method for classification, which effectively protects data security. And for the data heterogeneity phenomenon existing in the actual scenario, which will seriously affect the classification effect, we propose a method based on two-end control variables. Specifically, based on the classical federated learning FedAvg algorithm, we modify the loss function on the client side by adding a regular term or a penalty term, and add momentum after the average aggregation on the server side. The federated learning approach prevents the data privacy leakage problem compared to the traditional machine learning approach. In order to solve the problem of low classification accuracy due to data heterogeneity, our proposed method based on two-end control variables achieves an average improvement of 2% and an accuracy of 98% on average, and 99% individually, compared to the previous federated learning algorithms and the latest diffusion model-based method. The classification results and methodology of this study can be utilized by clinicians worldwide to improve the overall detection of pediatric pneumonia.

Federated influencer learning for secure and efficient collaborative learning in realistic medical database environment.

Enhancing deep learning performance requires extensive datasets. Centralized training raises concerns about data ownership and security. Additionally, large models are often unsuitable for hospitals due to their limited resource capacities. Federated learning (FL) has been introduced to address these issues. However, FL faces challenges such as vulnerability to attacks, non-IID data, reliance on a central server, high communication overhead, and suboptimal model aggregation. Furthermore, FL is not optimized for realistic hospital database environments, where data are dynamically accumulated. To overcome these limitations, we propose federated influencer learning (FIL) as a secure and efficient collaborative learning paradigm. Unlike the server-client model of FL, FIL features an equal-status structure among participants, with an administrator overseeing the overall process. FIL comprises four stages: local training, qualification, screening, and influencing. Local training is similar to vanilla FL, except for the optional use of a shared dataset. In the qualification stage, participants are classified as influencers or followers. During the screening stage, the integrity of the logits from the influencer is examined. If the integrity is confirmed, the influencer shares their knowledge with the others. FIL is more secure than FL because it eliminates the need for model-parameter transactions, central servers, and generative models. Additionally, FIL supports model-agnostic training. These features make FIL particularly promising for fields such as healthcare, where maintaining confidentiality is crucial. Our experiments demonstrated the effectiveness of FIL, which outperformed several FL methods on large medical (X-ray, MRI, and PET) and natural (CIFAR-10) image dataset in a dynamically accumulating database environment, with consistently higher precision, recall, Dice score, and lower standard deviation between participants. In particular, in the PET dataset, FIL achieved about a 40% improvement in Dice score and recall.

Software tools for organizing cloud computing in psychophysiological research based on eyetracking data

The architecture and web version of the software complex have been developed, which significantly expands the diagnostic capabilities of model-oriented information technologies for the assessment of the neurophysiological state. The complex provides cross-platform cloud computing, increases the productivity and efficiency of scientific research, using methods of non-parametric identification of the oculomotor system based on eyetracking data, which is achieved thanks to a new concept of cloud computing organization. Cloud computing technology has been further developed thanks to the proposed concept that combines the principles of PaaS (Platform as a Service) and SaaS (Software as a Service). The key feature of this software complex is its undemanding hardware on the client side thanks to the use of cloud computing, and its modular structure, which allows it to be easily scaled. Compared to other similar services, the complex has several advantages: it provides effective work in research and educational areas, supports several programming languages for improving algorithms, and also allows the use of ready-made identification methods through specially developed GUI interfaces. In addition, it offers social capabilities and a high level of abstraction that optimizes the research process.

Design of software system architecture for reading and publishing amateur literary works

The article discusses the functionality and key requirements for a web application for reading and publishing amateur literary works. Against the backdrop of current changes in the book industry caused by the development of technology and the emergence of self-publishing, the need to create platforms that provide authors with the opportunity to publish content independently is emphasized. One of the main problems that authors face when publishing is the loss of the original formatting of their works when transferring them to text editors on web platforms. This paper proposes a solution to this problem by developing a web application with the function of importing the content of text files while preserving their original formatting. The article also contains a comparative analysis of popular web-based platforms for publishing works, such as Archive of Our Own, Wattpad, and Arkush, which helped to highlight the advantages and disadvantages of each of them. In particular, the difficulties associated with storing and processing unstructured data, such as images and text files, were investigated. To solve the problem of storing such data, a comparative analysis of three approaches was conducted: storing data in relational databases, local file systems, and cloud storage. Taking into account the results of this analysis, the web application under development was chosen to integrate with the Amazon Web Services cloud provider and use Amazon S3 cloud storage, which provides scalability, reliability, and convenience in managing large amounts of unstructured data. It was also decided to use the Amazon CloudFront CDN service to improve the speed of data access and increase overall system performance. In addition, the article describes the choice of a technology stack for implementing the web application, which includes Java, Spring Framework, MySQL, ORM Hibernate for the server side and HTML, CSS, React.js for the client side. The article highlights important aspects of designing a web application architecture aimed at scalability and resilience to large amounts of data and an increase in the number of active users, and provides a basis for further system improvement.

Bidirectional Corrective Model-Contrastive Federated Adversarial Training

When dealing with non-IID data, federated learning confronts issues such as client drift and sluggish convergence. Therefore, we propose a Bidirectional Corrective Model-Contrastive Federated Adversarial Training (BCMCFAT) framework. On the client side, we design a category information correction module to correct biases caused by imbalanced local data by incorporating the local client’s data distribution information. Through local adversarial training, more robust local models are obtained. Secondly, we propose a model-based adaptive correction algorithm in the server that leverages a self-attention mechanism to handle each client’s data distribution information and introduces learnable aggregation tokens. Through the self-attention mechanism, model contrast learning is conducted on each client to obtain aggregation weights of corrected client models, thus addressing the issues of accuracy degradation and slow convergence caused by client drift. Our algorithm achieves the best natural accuracy on the CIFAR-10, CIFAR-100, and SVHN datasets and demonstrates excellent adversarial defense performance against FGSM, BIM, and PGD attacks.

Real-Time Document Collaboration—System Architecture and Design

This article explores the world of dependable systems, specifically focusing on system design, software solutions, and architectural decisions that facilitate collaborative work on shared text documents across multiple users in near real time. It aims to dive into the intricacies of designing robust and effective document collaboration software focusing on understanding the requirements of such a system, the working principle of collaborative text editing, software architecture, technology stack selection, and tooling that can sustain such a system. To examine the pros and cons of the proposed system, the paper will detail how collaborative text editing software can benefit from such an architecture regarding availability, elasticity, and scaling. The intricate nature of this system renders this paper a valuable resource for prospective investigations within the domain of dependable systems and distributed systems. This research first examines the requirements of a real-time collaboration system and the necessary core features. Then, it analyzes the design, the application structure, and the system organization while also considering key architectural requirements as the necessity of scaling, the usage of microservices, cross-service communications, and client–server communication. For the technology stack of the implementation, this research considers the alternatives at each layer, from client to server. Once these decisions are made, it follows system development while examining possible improvements for the issues previously encountered. To validate the architecture, a testing strategy is developed, to examine the key capabilities of the system, such as resource consumption and throughput. The conclusions review the combination of modern and conventional application development principles needed to address the challenges of conflict-free document replication, decoupled and stateless event-driven architecture, idempotency, and data consistency. This paper not only showcases the design and implementation process but also sets a foundation for future research and innovation in dependable systems, collaborative technologies, sustainable solutions, and distributed system architecture.

FRAST: TFHE-Friendly Cipher Based on Random S-Boxes

A transciphering framework, also known as hybrid homomorphic encryption, is a practical method of combining a homomorphic encryption (HE) scheme with a symmetric cipher in the client-server model to reduce computational and communication overload on the client side. As a server homomorphically evaluates a symmetric cipher in this framework, new design rationales are required for “HE-friendly” ciphers that take into account the specific properties of the HE schemes. In this paper, we propose a new TFHE-friendly cipher, dubbed FRAST, with a TFHE-friendly round function based on a random S-box to minimize the number of rounds. The round function of FRAST can be efficiently evaluated in TFHE by a new optimization technique, dubbed double blind rotation. Combined with our new WoP-PBS method, the double blind rotation allows computing multiple S-box calls in the round function of FRAST at the cost of a single S-box call. In this way, FRAST enjoys 2.768 (resp. 10.57) times higher throughput compared to Kreyvium (resp. Elisabeth) for TFHE keystream evaluation in the offline phase of the transciphering framework at the cost of slightly larger communication overload.

Federated Learning with Multi-Method Adaptive Aggregation for Enhanced Defect Detection in Power Systems

The detection and identification of defects in transmission lines using computer vision techniques is essential for maintaining the safety and reliability of power supply systems. However, existing training methods for transmission line defect detection models predominantly rely on single-node training, potentially limiting the enhancement of detection accuracy. To tackle this issue, this paper proposes a server-side adaptive parameter aggregation algorithm based on multi-method fusion (SAPAA-MMF) and formulates the corresponding objective function. Within the federated learning framework proposed in this paper, each client executes distributed synchronous training in alignment with the fundamental process of federated learning. The hierarchical difference between the global model, aggregated using the improved joint mean algorithm, and the global model from the previous iteration is computed and utilized as the pseudo-gradient for the adaptive aggregation algorithm. This enables the adaptive aggregation to produce a new global model with improved performance. To evaluate the potential of SAPAA-MMF, comprehensive experiments were conducted on five datasets, involving comparisons with several algorithms. The experimental results are analyzed independently for both the server and client sides. The findings indicate that SAPAA-MMF outperforms existing federated learning algorithms on both the server and client sides.

Privacy-SF: An encoding-based privacy-preserving segmentation framework for medical images

Deep learning is becoming increasingly popular and is being extensively used in the field of medical image analysis. However, the privacy sensitivity of medical data limits the availability of data, which constrains the advancement of medical image analysis and impedes collaboration across multiple centers. To address this problem, we propose a novel encoding-based framework, named Privacy-SF, aimed at implementing privacy-preserving segmentation for medical images. Our proposed segmentation framework consists of three CNN networks: 1) two encoding networks on the client side that encode medical images and their corresponding segmentation masks individually to remove the privacy features, 2) a unique mapping network that analyzes the content of encoded data and learns the mapping from the encoded image to the encoded mask. By sequentially encoding data and optimizing the mapping network, our approach ensures privacy protection for images and masks during both the training and inference phases of medical image analysis. Additionally, to further improve the segmentation performance, we carefully design augmentation strategies specifically for encoded data based on its sequence nature. Extensive experiments conducted on five datasets with different modalities demonstrate excellent performance in privacy-preserving segmentation and multi-center collaboration. Furthermore, the analysis of encoded data and the experiment of model inversion attacks validate the privacy-preserving capability of our approach.

Real-Time CNN Training and Compression for Neural-Enhanced Adaptive Live Streaming.

We propose a real-time convolutional neural network (CNN) training and compression method for delivering high-quality live video even in a poor network environment. The server delivers a low-resolution video segment along with the corresponding CNN for super resolution (SR), after which the client applies the CNN to the segment in order to recover high-resolution video frames. To generate a trained CNN corresponding to a video segment in real-time, our method rapidly increases the training accuracy by promoting the overfitting property of the CNN while also using curriculum-based training. In addition, assuming that the pretrained CNN is already downloaded on the client side, we transfer only residual values between the updated and pretrained CNN parameters. These values can be quantized with low bits in real time while minimizing the amount of loss, as the distribution range is significantly narrower than that of the updated CNN. Quantitatively, our neural-enhanced adaptive live streaming pipeline (NEALS) achieves higher SR accuracy and a lower CNN compression loss rate within a constrained training time compared to the state-of-the-art CNN training and compression method. NEALS achieves 15 to 48% higher quality of the user experience compared to state-of-the-art neural-enhanced live streaming systems.

LOGISTICS SERVICE INFORMATION SYSTEM AUDIT USING COBIT 5 FRAMEWORK

KBN Prima Logistik is a subsidiary affiliated with PT. Kawasan Berikat Nusantara which operates in the field of logistics services. In carrying out its business processes, it has implemented an Information System in the form of using desktop-based supporting business applications (Client Server). Some of the current problems are that the applications used are not functioning optimally, IT Governance procedures are not well defined by standards, there is no IT Division in the Organizational Structure that is responsible for IT management and there is a shortage of competent human resources in the IT field. Therefore, it is necessary to measure the Maturity Level and Capability Level of IT governance. So, research was carried out using the COBIT 5 framework as an Information System Audit model. The research method goes through the stages of problem identification, literature study, and domain determination which focuses on the DSS and MEA domains. The data collection method was through interviews and distributing questionnaires filled in by 20 respondents. The research results show that the Maturity Level value in the DSS and MEA domains shows an average value of 1.94 or 194%. Capability Level is still at Level 2 (Managed Process) from the expected Target Level 3 (Established Process). This indicates that although the IT processes has been run and implemented regularly with planning and monitoring according to business process objectives, but the management is not yet optimal and not well standardized. The results of the gap assessment show that the average gap value is 1.06.

A Novel Charging Management and Security Framework for the Electric Vehicle (EV) Ecosystem

The EV charging network has witnessed significant growth in the UK in the last few years due to the net zero emission target of the government by 2030. The related literature in EV charging management mainly focuses on road-traffic-parameter-based optimization and lacks detail in terms of charging statistics and cyber–security-enabled charging management frameworks. In this context, this paper proposes a novel EV Charging Management and Security (EVCMS) framework using real-time charging statistics and an Open Charge Point Protocol (OCPP). Specifically, a system model for EVCMS is presented considering charging data management and security protocols. An EVCMS framework design is detailed, focusing on charging pricing, optimization, and charging security. The experimental implementation is described in terms of client–server and charge-box-based simulation. The performance of the proposed EVCMS framework is evaluated by considering different charging scenarios and a range of charging-related metrics. An analysis of results and comparative study attest to the benefits of the proposed EVCMS framework for enabling the EV charging ecosystem.

Developing information technology for evaluating and enhancing application-layer DDoS attack detection methods

The subject matter of this article is the methods to detect distributed denial-of-service (DDoS) attacks at the Hypertext Transfer Protocol (HTTP) level with the purpose of justifying the requirements for creating software capable of identifying malicious web server clients. The goal of this article is to develop an information technology to evaluate the efficiency of DDoS attack detection methods, which will quantify their operating time, memory consumption, and approximate classification accuracy. In addition, this paper proposes hypotheses and a potential approach to improve existing application-layer DDoS attack detection methods with the intention of increasing their accuracy and identification speed. The tasks of this study are as follows: to analyse modern methods for detecting application-layer DDoS attacks; to investigate their features and short­comings; to develop a software system to assess DDoS attack detection methods; to programmatically implement these methods and experimentally measure their performance indicators, specifically: classification ac­curacy, operating time, and memory usage; to compare the efficiency of the investigated methods; to formulate hypotheses and propose an approach to improve existing methods and/or develop new methods based on the results obtained. The methods employed are abstraction, analysis, systematic approach, and empirical research. In particular, the datasets generated by DDoS utilities were processed using the synthetic minority oversampling technique (SMOTE) to balance them. Furthermore, the studied DDoS attack detection methods were implemented, including fitting the required parameters and training artificial neural network models for evaluation. The following results were obtained. The average classification accuracy, operating time, and random-access memory (RAM) consumption during Internet traffic classification were determined for six DDoS attack detection methods under the same conditions. This study has demonstrated that the development of a novel method to detect DDoS attacks at the HTTP level with enhanced accuracy and classification speed is strongly required. The experimental results demonstrate that the time series-based method exhibited the shortest operating time (1.33 ms for 5000 vectors), whereas the deep neural network-based method exhibited the highest average classification accuracy (ranging from 99.07% to 99.97%) and the lowest memory consumption (39.09 KB for 5000 vectors). Conclusions. In this study, a software system was developed to assess the average accuracy of DDoS attack classification methods and measure the computational resources utilized. The scientific novelty of the obtained results lies in the formulation of two hypotheses and a potential approach to the creation of a novel method for detecting DDoS attacks at the HTTP level, which will have both high classification accuracy and a short operating time to surpass previously studied analogues in these respects. The first hypothesis is based on the additional usage of HTTP request attributes during Internet traffic classification. The second hypothesis is to analyse a graph of user transitions between website pages. The article also superficially describes a potential approach that involves the implementation of the described hypotheses as well as the proposed software architecture of an application-layer DDoS attack detection system for the Kubernetes platform and the Istio framework, which addresses the issue of collecting web request parameter values for websites that use the cryptographically secured HTTPS protocol.

Evaluation of a New-Concept Secure File Server Solution

Ransomware attacks are becoming increasingly sophisticated, and defensive solutions must necessarily evolve. Unfortunately, automated backup management through validation—critical for data recovery after an attack—and strengthening file server protection are not sufficiently addressed in current protection strategies. To focus on this area, an architectural model has been developed that complements traditional central data storage with an additional high-level file server protection solution. However, in addition to the functional adequacy of file server protection solutions, the measurability of operational performance is also important. In order to validate and evaluate the developed ransomware-proof file server protection, a dynamic performance metric is introduced for comparability, by which the performance results measured on the tested client–server architectures are presented, together with the methodology and results of the measurements. Our results show that the investigated model does not cause any performance degradation when moving sensitive data files and their backups during operation and even shows performance improvements in some frequently used configurations. The result proves that the developed real-time approach provides a solution to this critical problem in terms of the time required to restore key data from backups and to ensure file availability and continuity of accessibility. Based on a review of the literature and available solutions, it is concluded that there is no integrated solution for implementing a similar concept in practice, and therefore, the developed model is a gap-filling in this priority area.

Designing transport scheme of 3D naked-eye system

3D naked-eye is constructed from multi-stream as a typical representation of stereoscopic video. Its enormous data volume and stringent low-delay transport requirements pose significant challenges for high-quality real-time transport. Through analysis and experimental verification that current streaming media transport frameworks using the server–client or peer-to-peer scheme face difficulties when transmitting 3D naked-eye in a one-to-one format. Besides, the existing bandwidth estimation algorithms cannot achieve the expected performance when dealing with delay-sensitive traffic. This results in low bandwidth utilization and slow bandwidth estimation, rendering it unfeasible to deliver multi-stream on time. We propose an effective transport framework with different modules for real-time multi-stream and introduce an Agent-to-Agent transport scheme that provides many-to-one connection as the main implementation way of 3D naked-eye transport framework. Additionally, we propose a direct bandwidth estimation algorithm to quickly match network bandwidth for low-delay transport. The Agent terminal centrally processes consolidates transports, and provides macro-level management of multiple video streams. The algorithm directly detects the available bandwidth using packet interval and packet rate models. Finally, using rate decision algorithm arbitrates the results to directly measure the maximum available bandwidth of the link. The Agent-to-Agent achieves 99% bandwidth utilization, addressing the limitations of existing streaming schemes in handling concurrent data streams. Our algorithm provides precise bandwidth estimates with minimal time overhead, meeting the requirements of a delay-sensitive 3D naked-eye system across diverse environments.

EXTENDED SERIAL GRAPH-VALIDATION QUEUE SCHEME WITH LOCKING STRATEGY

In today's digital landscape, collaborative work in real-time is on the rise, allowing individuals to connect across different locations through applications facilitated by client-server architecture, enabling users to access and work on the same project simultaneously. However, clients' simultaneous access and modifications to the database can result in data inconsistencies, underscoring the importance of concurrency control. Managing concurrent transactions can introduce complexities and potentially adversely impact server performance. Object caching emerges as a viable solution as an alternative approach to handling transaction traffic. Extended Serial Graph-Validation Queue (Extended SG-VQ) is a control concurrency scheme that operates within the client-server architecture framework and incorporates object caching. The cache component implements a queue-based validation algorithm as part of its validation process. At the same time, the server-side employs a graph-based validation algorithm with locking strategies. Through a series of hypothetical transaction scenarios across three cases, this study validates the effectiveness of the Extended SG-VQ, demonstrating its ability to utilize serial graphs, resolve conflicts, and identify cyclic patterns.

Self-adaptive asynchronous federated optimizer with adversarial sharpness-aware minimization

The past years have witnessed the success of a distributed learning system called Federated Learning (FL). Recently, asynchronous FL (AFL) has demonstrated its potential in concurrency compared to mainstream synchronous FL. However, the inherent systematic and statistical heterogeneity has presented several impediments to AFL: On the client side, the discrepancies in trips and local model drift impede global performance enhancement; On the server side, dynamic communication leads to significant fluctuations in gradient arrival time, while asynchronous arrival gradients with ambiguous value are not fully leveraged. In this paper, we propose an adaptive AFL framework, ARDAGH, which systematically addresses the aforementioned challenges: Firstly, to address the discrepancies in client trips, ARDAGH ensures their convergence by incorporating only 1-bit feedback information into the downlink. Secondly, to counter the drift of clients, ARDAGH generalizes the local models by employing our novel adversarial sharpness-aware minimization, which does not necessitate reliance on additional global variables. Thirdly, in the face of gradient latency issues, ARDAGH employs a communication-aware dropout strategy to adaptively compress gradients to ensure similar transmission times. Finally, to fully unleash the potential of each gradient, we establish a consistent optimal direction by conceptualizing the aggregation as an optimizer with successive momentum. In light of the comprehensive solution provided by ARDAGH, an algorithm named FedAMO is derived, and its superiority is confirmed by experimental results obtained under challenging prototype and simulation settings. Particularly in typical sentiment analysis tasks, FedAMO demonstrates an improvement of up to 5.351% with a 20.056-fold acceleration compared to conventional asynchronous methods.

2FAKA-C/S: A Robust Two-Factor Authentication and Key Agreement Protocol for C/S Data Transmission in Federated Learning

As a hot technology trend, the federated learning (FL) cleverly combines data utilization and privacy protection by processing data locally on the client and only sharing model parameters with the server, embodying an efficient and secure collaborative learning model between clients and aggregated Servers. During the process of uploading parameters in FL models, there is susceptibility to unauthorized access threats, which can result in training data leakage. To ensure data security during transmission, the Authentication and Key Agreement (AKA) protocols are proposed to authenticate legitimate users and safeguard training data. However, existing AKA protocols for client–server (C/S) architecture show security deficiencies, such as lack of user anonymity and susceptibility to password guessing attacks. In this paper, we propose a robust 2FAKA-C/S protocol based on ECC and Hash-chain technology. Our security analysis shows that the proposed protocol ensures the session keys are semantically secure and can effectively resist various attacks. The performance analysis indicates that the proposed protocol achieves a total running time of 62.644 ms and requires only 800 bits of communication overhead, showing superior computational efficiency and lower communication costs compared to existing protocols. In conclusion, the proposed protocol securely protects the training parameters in a federated learning environment and provides a reliable guarantee for data transmission.