Decentralized Identifiers have recently expanded into Internet of Things devices and are crucial in securing users' digital identities and data. However, Decentralized Identifiers face challenges in scenarios necessitating authority delegation and anonymity, such as when dealing with legal guardianship for minors, device loss or damage, and specific medical contexts involving patient information. This paper aims to strengthen data sovereignty within the Decentralized Identifier system by implementing a secure authority delegation and anonymity scheme. It suggests optimizing verifiable presentations by utilizing a sequential aggregate signature, a Non-Interactive Zero-Knowledge Proof, and a Merkle tree to prevent against linkage and Sybil attacks while facilitating delegation. This strategy mitigates security risks related to delegation and anonymity, efficiently reduces the computational and verification efforts for signatures, and reduces the size of verifiable presentations by about 1.2 to 2 times.
A ride-sharing system provides many advantages. It reduces energy consumption. Moreover, it mitigates traffic congestion. Furthermore, it provides benefits to drivers and passengers in that they share travel costs (gas, toll ticket). Ride-sharing has been getting very popular since the COVID-19 pandemic. Since COVID-19 is very contagious and spread by infected people via coughs, sneezes, or talking, people avoid using public transportation to get the disease. People prefer to travel with a few people to protect their health. To prevent people from getting the disease and to have the advantages of a ride-sharing system, we introduce a ride-sharing system in which a driver only travels with a passenger for each event. Traveling with only one person provides advantages to both the driver and passenger. The driver (passenger) not only shares the cost of the trip but also reduces the risk of getting or spreading the disease. This paper proposes a smart-contract-based ride-sharing system that uses a $Vickrey$ (second highest bid) auction mechanism during a pandemic to determine the passenger. The system provides a decentralized, transparent, trackable, verifiable, and secure ride-sharing with the help of consortium blockchain. Using smart contracts in the system allows users’ bids to be transparent and verifiable. Furthermore, the proposed system provides a secure and lightweight mechanism to protect users' (drivers and passengers) travel data (locations and cost of travel). Their travel data for each event is going to be unlinkable.
While centralized servers pose a risk of being a single point of failure, decentralized approaches like blockchain offer a compelling solution by implementing a consensus mechanism among multiple entities. Merging distributed computing with cryptographic techniques, decentralized technologies introduce a novel computing paradigm. Blockchain ensures secure, transparent, and tamper-proof data management by validating and recording transactions via consensus across network nodes. Federated Learning (FL), as a distributed machine learning framework, enables participants to collaboratively train models while safeguarding data privacy by avoiding direct raw data exchange. Despite the growing interest in decentralized methods, their application in FL remains underexplored. This paper presents a thorough investigation into Blockchain-based FL (BCFL), spotlighting the synergy between blockchain's security features and FL's privacy-preserving model training capabilities. First, we present the taxonomy of BCFL from three aspects, including decentralized, separate networks, and reputation-based architectures. Then, we summarize the general architecture of BCFL systems, providing a comprehensive perspective on FL architectures informed by blockchain. Afterward, we analyze the application of BCFL in healthcare, IoT, and other privacy-sensitive areas. Finally, we identify future research directions of BCFL.
To address the challenge of balancing privacy protection with regulatory oversight in blockchain transactions, we propose a regulatable privacy protection scheme for blockchain transactions. Our scheme utilizes probabilistic public-key encryption to obscure the true identities of blockchain transaction participants. By integrating commitment schemes and zero-knowledge proof techniques with deep learning graph neural network technology, it provides privacy protection and regulatory analysis of blockchain transaction data. This approach not only prevents the leakage of sensitive transaction information, but also achieves regulatory capabilities at both macro and micro levels, ensuring the verification of the legality of transactions. By adopting an identity-based encryption system, regulatory bodies can conduct personalized supervision of blockchain transactions without storing users’ actual identities and key data, significantly reducing storage computation and key management burdens. Our scheme is independent of any particular consensus mechanism and can be applied to current blockchain technologies. Simulation experiments and complexity analysis demonstrate the practicality of the scheme.
The rapid development of the Hospital Information System has significantly enhanced the convenience of medical research and the management of medical information. However, the internal misuse and privacy leakage of medical big data are critical issues that need to be addressed in the process of medical research and information management. Access control serves as a method to prevent data misuse and privacy leakage. Nevertheless, traditional access control methods, limited by their single usage scenario and susceptibility to single point failures, fail to adapt to the polymorphic, real-time, and sensitive characteristics of medical big data scenarios. This paper proposes a smart contracts and risk-based access control model (SCR-BAC). This model integrates smart contracts with traditional risk-based access control and deploys risk-based access control policies in the form of smart contracts into the blockchain, thereby ensuring the protection of medical data. The model categorizes risk into historical and current risk, quantifies the historical risk based on the time decay factor and the doctor's historical behavior, and updates the doctor's composite risk value in real time. The access control policy, based on the comprehensive risk, is deployed into the blockchain in the form of a smart contract. The distributed nature of the blockchain is utilized to automatically enforce access control, thereby resolving the issue of single point failures. Simulation experiments demonstrate that the access control model proposed in this paper effectively curbs the access behavior of malicious doctors to a certain extent and imposes a limiting effect on the internal abuse and privacy leakage of medical big data.
Open access
Blockchain Technology Applications and Security
Privacy-Preserving Technologies in Data
Artificial Intelligence in Healthcare and Education
S. B. Goyal, Anand Singh Rajawat, Manoj Kumar, Prerna Agarwal
INTRODUCTION: Cloud computing's offshoot, fog computing, moves crucial data storage, processing, and networking capabilities closer to the people who need them. There are certain advantages, such improved efficiency and lower latency, but there are also some major privacy and security concerns. For these reasons, this article presents a new paradigm for fog computing that makes use of blockchain and Artificial Intelligence (AI). OBJECTIVES: The main goal of this research is to create and assess a thorough framework for fog computing that incorporates AI and blockchain technology. With an emphasis on protecting the privacy and integrity of data transactions and streamlining the management of massive amounts of data, this project seeks to improve the security and privacy of Industrial Internet of Things (IIoT) systems that are cloud-based. METHODS: Social network analysis methods are utilised in this study. The efficiency and accuracy of data processing in fog computing are guaranteed by the application of artificial intelligence, most especially Support Vector Machine (SVM), due to its resilience in classification and regression tasks. The network's security and reliability are enhanced by incorporating blockchain technology, which creates a decentralised system that is tamper resistant. To make users' data more private, zero-knowledge proof techniques are used to confirm ownership of data without actually disclosing it. RESULTS: When applied to fog computing data, the suggested approach achieves a remarkable classification accuracy of 99.8 percent. While the consensus decision-making process of the blockchain guarantees trustworthy and secure operations, the support vector machine (SVM) efficiently handles massive data analyses. Even in delicate situations, the zero-knowledge proof techniques manage to keep data private. When these technologies are integrated into the fog computing ecosystem, the chances of data breaches and illegal access are greatly reduced. CONCLUSION: Fog computing, which combines AI with blockchain, offers a powerful answer to the privacy and security issues with cloud centric IIoT systems. Combining SVM with AI makes data processing more efficient, while blockchain's decentralised and immutable properties make it a strong security measure. Additional security for user privacy is provided via zero-knowledge proofs. Improving the privacy and security of fog computing networks has never been easier than with this novel method.
Mohammed Alghazwi, Dewi Davies-Batista, Dimka Karastoyanova, Fatih Türkmen
Aggregate statistics play an important role in extracting meaningful insights from distributed data while preserving privacy. A growing number of application domains, such as healthcare, utilize these statistics in advancing research and improving patient care. In this work, we explore the challenge of input validation and public verifiability within privacy-preserving aggregation protocols. We address the scenario in which a party receives data from multiple sources and must verify the validity of the input and correctness of the computations over this data to third parties, such as auditors, while ensuring input data privacy. To achieve this, we propose the "VPAS" protocol, which satisfies these requirements. Our protocol utilizes homomorphic encryption for data privacy, and employs Zero-Knowledge Proofs (ZKP) and a blockchain system for input validation and public verifiability. We constructed VPAS by extending existing verifiable encryption schemes into secure protocols that enable N clients to encrypt, aggregate, and subsequently release the final result to a collector in a verifiable manner. We implemented and experimentally evaluated VPAS with regard to encryption costs, proof generation, and verification. The findings indicate that the overhead associated with verifiability in our protocol is 10x lower than that incurred by simply using conventional zkSNARKs. This enhanced efficiency makes it feasible to apply input validation with public verifiability across a wider range of applications or use cases that can tolerate moderate computational overhead associated with proof generation.
The explosive growth of Large-Language Models (LLMs), particularly Generative Pre-trained Transformer (GPT) models, has revolutionised fields ranging from natural language processing to creative writing. Yet, their reliance on vast, often unverified data sources introduces a critical vulnerability: unreliability and security concerns. Traditional GPT models, while impressive in their capabilities, struggle with limited factual accuracy and susceptibility to manipulation by biased or malicious data. This poses a significant risk in professional and personal environments where sensitive or mission-critical data is paramount. This work tackles this challenge head-on by proposing a novel approach to enhance GPT security and reliability: leveraging Zero-Knowledge Proofs (ZKPs). Unlike traditional cryptographic methods that require sensitive data exchange, ZKPs allow one party to convincingly prove the truth of a statement, without revealing the underlying information. In the context of GPTs, ZKPs can validate the legitimacy and quality of data sources used in GPT computations, combating data manipulation and misinformation. This ensures trustworthy outputs, even when incorporating third-party data (TPD). ZKPs can securely verify user identities and access privileges, preventing unauthorised access to sensitive data and functionality. This protects critical information and promotes responsible LLM usage. ZKPs can identify and filter out manipulative prompts designed to elicit harmful or biased responses from GPTs. This safeguards against malicious actors and promotes ethical LLM development. ZKPs facilitate training specialised GPT models on targeted datasets, resulting in deeper understanding and more accurate outputs within specific domains. This allows the creation of ‘expert-GPT’ applications in specialised fields like healthcare, finance, and legal services. The integration of ZKPs into GPT models represents a crucial step towards overcoming trust and security barriers. Our research demonstrates the viability and efficacy of this approach, with our ZKP-based authentication system achieving promising results in data verification, user control, and malicious prompt detection. These findings lay the groundwork for a future where GPTs, empowered by ZKPs, operate with unwavering integrity, fostering trust and accelerating ethical AI development across diverse domains.
Blockchain evidence is a technical method for evidence storage, transmission and fixation. Its evidential value has a dual nature, reflected in the fact that it cannot be absolutely tamper-resistant, can only provide periodic assurance of evidence authenticity and the commonly used consortium chains do not possess all the benefits of public chains. Simultaneously, blockchain evidence occupies a unique status within the entire evidence system, it serves as an evidentiary storage mechanism, is essentially an electronic evidence reflecting both the evidence collection process and outcome and its notarisation and forensic examination documents are a type of opinion evidence. It is evident that blockchain evidence does not emerge in a vacuum, rather than serving as a mere replacement for traditional evidence, blockchain evidence represents an upgrade in the functionality and effectiveness of traditional evidence. From this perspective, the improvement of blockchain evidence rules should align with the basic position of ‘technological neutrality’, which means that although technological evolution can lead to rapid changes, legislators are not always required to cater to these dynamic demands. It is essential to distinguish between on-chain and off-chain when addressing issues of authenticity, hearsay and originality, and improvements proposing should within the frameworks of existing electronic evidence rules and opinion evidence rules, thereby unlocking the potential of blockchain evidence.
We construct perfect zero-knowledge probabilistically checkable proofs (PZK-PCPs) for every language in #P. This is the first construction of a PZK-PCP for any language outside BPP. Furthermore, unlike previous constructions of (statistical) zero-knowledge PCPs, our construction simultaneously achieves non-adaptivity and zero knowledge against arbitrary (adaptive) polynomial-time malicious verifiers. Our construction consists of a novel masked sumcheck PCP, which uses the combinatorial nullstellen- satz to obtain antisymmetric structure within the hypercube and randomness outside of it. To prove zero knowledge, we introduce the notion of locally simulatable encodings: randomised encodings in which every local view of the encoding can be efficiently sampled given a local view of the message. We show that the code arising from the sumcheck protocol (the Reed–Muller code augmented with subcube sums) admits a locally simulatable encoding. This reduces the algebraic problem of simulating our masked sumcheck to a combinatorial property of antisymmetric functions.
The wide application of smart contracts allows industry companies to implement some complex distributed collaborative businesses, which involve the calculation of complex functions, such as matrix operations. However, complex functions such as matrix operations are difficult to implement on Ethereum Virtual Machine (EVM)-based smart contract platforms due to their distributed security environment limitations. Existing off-chain methods often result in a significant reduction in contract execution efficiency, thus a platform software development kit interface implementation method has become a feasible way to reduce overheads, but this method cannot verify operation correctness and may leak sensitive user data. To solve the above problems, we propose a verifiable EVM-based smart contract cross-language implementation scheme for complex operations, especially matrix operations, which can guarantee operation correctness and user privacy while ensuring computational efficiency. In this scheme, a verifiable interaction process is designed to verify the computation process and results, and a matrix blinding technology is introduced to protect sensitive user data in the calculation process. The security analysis and performance tests show that the proposed scheme can satisfy the correctness and privacy of the cross-language implementation of smart contracts at a small additional efficiency cost.
In contemporary data-driven economies, data has become a valuable digital asset that is eligible for trading and monetization. Peer-to-peer (P2P) marketplaces play a crucial role in establishing direct connections between data providers and consumers. However, traditional data marketplaces exhibit inadequacies. Functioning as centralized platforms, they suffer from issues such as insufficient trust, transparency, fairness, accountability, and security. Moreover, users lack consent and ownership control over their data. To address these issues, we propose DataMesh+, an innovative blockchain-powered, decentralized P2P data exchange model for self-sovereign data marketplaces. This user-centric decentralized approach leverages blockchain-based smart contracts to enable fair, transparent, reliable, and secure data trading marketplaces, empowering users to retain full sovereignty and control over their data. In this article, we describe the design and implementation of our approach, which was developed to demonstrate its feasibility. We evaluated the model’s acceptability and reliability through experimental testing and validation. Furthermore, we assessed the security and performance in terms of smart contract deployment and transaction execution costs, as well as the blockchain and storage network performance.
Federated learning combines with fog computing to transform data sharing into model sharing, which solves the issues of data isolation and privacy disclosure in fog computing. However, existing studies focus on centralized single-layer aggregation federated learning architecture, which lack the consideration of cross-domain and asynchronous robustness of federated learning, and rarely integrate verification mechanisms from the perspective of incentives. To address the above challenges, we propose a Blockchain and Signcryption enabled Asynchronous Federated Learning (BSAFL) framework based on dual aggregation for asynchronous cross-domain federated learning scenarios. In particular, we first design two types of signcryption schemes to secure the interaction and access control of collaborative learning between domains. Second, we construct a differential privacy approach that adaptively adjusts privacy budgets to ensure data privacy and local models' availability of intra-domain user. Furthermore, we propose an asynchronous aggregation solution that incorporates consensus verification and elastic participation using blockchain. Finally, security analysis demonstrates the security and privacy effectiveness of BSAFL, and the evaluation on real datasets further validates the high model accuracy and performance of BSAFL.
G. Senthilkumar, K. N. Madhusudhan, Y. Jeyasheela, P. Ajitha
Large amounts of processing resources are required for the sensed raw big data processing during the data generation process.Furthermore, as sensed data are typically privacy sensitive, blockchain technology can be used to ensure the privacy concerns.This study examines a multiuser mobile offloading network that consists of a cloud server located remotely and an edge node.We formulate the offloading problem as the joint optimization of task offloading decision making of all users, the computation resource allocation among the edge executing applications, and the radio resource assignment among all the remote-processing applications.The goal is to minimize the maximum weighted cost of all users.When compared to other benchmark approaches, the simulation results show that the proposed algorithm achieves optimal results in terms of both energy consumption and delay as a result of collaboration.Finally the resource allocation and optimal offloading strategy with 93% efficiency is obtained.
The advent of the digital era and computer-based remote communications has significantly enhanced the applicability of various sciences over the past two decades, notably data science (DS) and cryptography (CG). Data science involves clustering and categorizing unstructured data, while cryptography ensures security and privacy aspects. Despite certain CG laws and requirements mandating fully randomized or pseudonoise outputs from CG primitives and schemes, it appears that CG policies might impede data scientists from working on ciphers or analyzing information systems supporting security and privacy services. However, this study posits that CG does not entirely preclude data scientists from operating in the presence of ciphers, as there are several examples of successful collaborations, including homomorphic encryption schemes, searchable encryption algorithms, secret-sharing protocols, and protocols offering conditional privacy. These instances, along with others, indicate numerous potential solutions for fostering collaboration between DS and CG. Therefore, this study classifies the challenges faced by DS and CG into three distinct groups: challenging problems (which can be conditionally solved and are currently available to use; e.g., using secret sharing protocols, zero-knowledge proofs, partial homomorphic encryption algorithms, etc.), open problems (where proofs to solve exist but remain unsolved and is now considered as open problems; e.g., proposing efficient functional encryption algorithm, fully homomorphic encryption scheme, etc.), and hard problems (infeasible to solve with current knowledge and tools). Ultimately, the paper will address specific solutions and outline future directions to tackle the challenges arising at the intersection of DS and CG, such as providing specific access for DS experts in secret-sharing algorithms, assigning data index dimensions to DS experts in ultra-dimension encryption algorithms, defining some functional keys in functional encryption schemes for DS experts, and giving limited shares of data to them for analytics.
Blockchain technology is a decentralized and secure paradigm for data processing, sharing, and storing. It relies on consensus protocol for all decisions, which focuses on computational and resource capability. For example, proof of work (PoW) and proof of stake (PoS) are the most famous consensus protocols that are currently used. However, these current consensus protocols are required to recruit a node with a high computational or a large amount of cryptocurrency to act as a miner node and to generate a new block. Unfortunately, these PoW and PoS protocols could be impractical for adoption in today’s technological fields, such as the Internet of Things and healthcare. In addition, these protocols are susceptible to flexibility, security, and fairness issues, as they are discussed in detail in this work. Therefore, this paper introduces a proof of fairness (PoF) as a dynamic and secure consensus protocol for enhancing the mining selection process. The selection of the miner node is influenced by numerous factors, including the time required to generate a block based on the transaction’s sensitivity. Firstly, a reverse auction mechanism is designed as an incentive mechanism to encourage all nodes to participate in the miner selection process. In a reverse auction, each node will draw its strategy based on its computational capability and claimed cost. Secondly, an expressive language is developed to categorize transaction types based on their sensitivity to processing time, ensuring compatibility with our miner selection process. Thirdly, a homomorphic concept is designed as a security and privacy scheme to protect the bidder’s data confidentiality. Finally, an extensive evaluation involving numerical analysis was carried out to assess the efficiency of the suggested PoF protocol, which confirms that the proposed PoF is dynamic and more efficient than current PoW and PoS consensus protocols.
Jingxue Chen, Eric Wang, Gautam Srivastava, Turki Ali Alghamdi · 7 authors
The space-air-ground-sea three-dimensional (3D) network is a comprehensive communication network system. This 3D network combines the extensive coverage of satellite communications, the adaptability of unmanned aerial vehicle (UAV) communications, the reliability of terrestrial communications, and the necessity of maritime communications. These networks generate enormous amounts of data, and training machine learning (ML) models on this data will have a significant impact on the industry. At the same time, the availability of such data poses numerous security threats, which can be overcome by Federated Learning (FL). The decentralized training in FL can provide a universal model from local data generated by the 3D network However, most existing FL frameworks have a centralized server, which questions the credibility, single-point failure, and global confidence. To solve these problems, industrial blockchain technology has received much attention by replacing centralized servers in traditional FL, which offers a promising approach to address key issues such as data privacy and security. In a blockchain-based system, digital signature is the core component for ensuring data integrity and system security, however, private key disclosure can pose significant risks. The security can be enhanced by using threshold signature, which provides a more reliable foundation for FL by storing keys in multiple nodes and requiring multiple nodes to collaborate to generate signatures. In this paper, we propose a Threshold signing scheme for ISO/IEC Digital Signature Standards (TDSS) in industrial blockchain. The TDSS scheme helps FL to achieve truly distributed decentralization for unified space-air-ground-sea model training. The TDSS scheme exploits the SM-2 digital signature algorithm in the ISO/IEC standard when t out of n nodes in industrial blockchain interact with each other to calculate the signature. The experimental results and analyses show that the TDSS scheme has provable security and efficient against security attacks, which can be applied to large-scale threshold signing scenarios.
Supported by cloud computing,FederatedLearning (FL) has experienced rapid advancement, as a promising technique to motivate clients to collaboratively train models without sharing local data. To improve the security and fairness of FL implementation, numerousBlockchain-empoweredFederatedLearning (BFL) frameworks have emerged accordingly. Among them, consensus algorithms play a pivotal role in determining the scalability, security, and consistency of BFL systems. Existing consensus solutions to block producer selection and reward allocation either focus on well-resourced scenarios or accommodate BFL based on clients' contributions to model training. However, these approaches limit consensus efficiency and undermine reward fairness, due to involving intricate consensus processes, disregarding clients' contributions during blockchain consensus, and failing to address lazy client problems (malicious clients plagiarizing local model updates from others to reap rewards). Given the aforementioned challenges, we make the first attempt to design a joint solution for efficient consensus and fair reward allocation in heterogeneous BFL systems with lazy clients. Specifically, we introduce a generalizable BFL workflow that can address lazy client problems well. Based on it, the global contribution of BFL clients is decoupled into five dominant metrics, and the block producer selection problem is formulated as a reward-constraint contribution maximization problem. By addressing this problem, the optimal block producer that maximizes global contribution can be identified to orchestrate consensus processes, and rewards are distributed to clients in proportion to their respective global contributions. To achieve it, we develop aContext-awareProof-of-Contribution consensus algorithm named CPoC to reach consensus and incentive simultaneously, followed by theoretical analysis of lazy client problems and privacy issues. Empirical results on widely-used datasets demonstrate the effectiveness of our design in improving consensus efficiency and maximizing global contribution.
To solve the problem of climate warming, countries around the world have paid special attention to the construction of carbon governance. Carbon emission accounting is an important policy tool to control the vented CO2. But at present, there are third-party agencies in carbon emission accounting that cannot ensure the fairness and impartiality of accounting, and there may be risks such as illegal use and leakage of sensitive information in the process of carbon emission data transmission. Therefore, We design the blockchain-based carbon emission security accounting scheme (BCESAS) and propose cross-chain verification contract to ensure the efficiency of cross-chain information accounting. In addition, bilinear pairing is used to ensure data integrity, and we encrypt private data using an improved and more secure homomorphic encryption algorithm to ensure that privacy is not leaked during the transfer of carbon emission data, which is more efficent than other homomorphic encryption algorithms. We also use reputation mechanism to regulate the behavior of carbon emission auditors. The theoretical and experimental analysis demonstrates that BCESAS can verify the integrity, correctness and privacy of cross-chain data calculation result effectively, realizing secure and reliable expansion of blockchain.
Nowadays, Internet of Things platforms are being deployed in a wide range of application domains. Some of these include use cases with security requirements, where the data generated by an IoT node is the basis for making safety-critical or liability-critical decisions at system level. The challenge is to develop a solution for data exchange while proving and verifying the authenticity of the data from end-to-end. In line with this objective, this paper proposes a novel solution with the proper protocols to provide Trust in Data, making use of two Roots of Trust that are the IOTA Distributed Ledger Technology and the Trusted Platform Module. The paper presents the design of the proposed solution and discusses the key design aspects and relevant trade-offs. The paper concludes with a Proof-of-Concept implementation and an experimental evaluation to confirm its feasibility and to assess the achievable performance.
Federated learning (FL) is a distributed machine learning approach that protects user data privacy by training models locally on clients and aggregating them on a parameter server. While effective at preserving privacy, FL systems face limitations such as single points of failure, lack of incentives, and inadequate security. To address these challenges, blockchain technology is integrated into FL systems to provide stronger security, fairness, and scalability. However, blockchain-empowered FL (BC-FL) systems introduce additional demands on network, computing, and storage resources. This survey provides a comprehensive review of recent research on BC-FL systems, analyzing the benefits and challenges associated with blockchain integration. We explore why blockchain is applicable to FL, how it can be implemented, and the challenges and existing solutions for its integration. Additionally, we offer insights on future research directions for the BC-FL system.
Статья посвящена актуальной проблеме обеспечения конфиденциальности в системах распределенного реестра. Рассматривается прикладная задача обеспечения конфиденциальности данных при операциях с цифровыми финансовыми активами. Представлено сравнение различных методов обеспечения конфиденциальности, включая перемешивающие сети, кольцевые подписи и оффчейн-протоколы. Отмечено, что эти методы не достигают достаточного уровня децентрализации, что является важным аспектом для систем распределенного реестра. Для одновременного обеспечения свойств децентрализации и конфиденциальности информации используются методы доказательства с нулевым разглашением, включая методы компактных неинтерактивных доказательств знания (SNARK). В статье приводится математическая модель систем доказательства SNARK, а также описаны подходы к их программной реализации. Приведены результаты экспериментов, направленные на сравнение производительности методов SNARK для решения прикладной задачи проведения операций с цифровыми финансовыми активами. Результаты эксперимента позволяют выделить дальнейшие возможности снижения времени генерации доказательства и сокращения его объема посредством использования пакетной верификации. Полученные результаты имеют практическую значимость для разработки систем распределенного реестра, требующих высокого уровня конфиденциальности и децентрализации.
Federated learning enables the collaborative training of machine learning models across multiple organizations, eliminating the need for sharing sensitive data. Nevertheless, in practice, the data distributions among these organizations are often non-independent and identically distributed (non-IID), which poses significant challenges for traditional federated learning. To tackle this challenge, we present a hierarchical federated learning framework based on blockchain technology, which is designed to enhance the training of non-IID data., protect data privacy and security, and improve federated learning performance. The framework builds a global shared pool by constructing a blockchain system to reduce the non-IID degree of local data and improve model accuracy. In addition, we use smart contracts to distribute and collect models and design a main blockchain to store local models for federated aggregation, achieving decentralized federated learning. We train the MLP model on the MNIST dataset and the CNN model on the Fashion-MNIST and CIFAR-10 datasets to verify its feasibility and effectiveness. The experimental results show that the proposed strategy significantly improves the accuracy of decentralized federated learning on three tasks with non-IID data.
Ensuring the security and usability of electronic health records (EHRs) is important in health information exchange (HIE) systems that handle healthcare records. This study addressed the need to balance privacy preserving and data usability in blockchain-based HIE systems. We propose a searchable blockchain-based HIE system that enhances privacy preserving while improving data usability. The proposed methodology includes users collecting healthcare information (HI) from various Internet of Medical Things (IoMT) devices and compiling this information into EHR blocks for sharing on a blockchain network. This approach allows participants to search and utilize specific health data within the blockchain effectively. The results demonstrate that the proposed system mitigates the issues of traditional HIE systems by providing secure and user-friendly access to EHRs. The proposed searchable blockchain-based HIE system resolves the trade-off dilemma in HIE by achieving a balance between security and the data usability of EHRs.