<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3-mathml3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.3" xml:lang="EN">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Blockchain</journal-id>
<journal-title-group>
<journal-title>Frontiers in Blockchain</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Blockchain</abbrev-journal-title>
</journal-title-group>
<issn pub-type="epub">2624-7852</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1631217</article-id>
<article-id pub-id-type="doi">10.3389/fbloc.2025.1631217</article-id>
<article-version article-version-type="Version of Record" vocab="NISO-RP-8-2008"/>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Hypothesis and Theory</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Cryptographic open science: enabling secure and incentivized biomedical data sharing with web 3.0 technologies to overcome the open science dilemma</article-title>
<alt-title alt-title-type="left-running-head">Wang et al.</alt-title>
<alt-title alt-title-type="right-running-head">
<ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/fbloc.2025.1631217">10.3389/fbloc.2025.1631217</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Wang</surname>
<given-names>Yu</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<xref ref-type="aff" rid="aff4">
<sup>4</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<xref ref-type="author-notes" rid="fn001">
<sup>&#x2020;</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/3068261"/>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Funding acquisition" vocab-term-identifier="https://credit.niso.org/contributor-roles/funding-acquisition/">Funding acquisition</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing - original draft</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x26; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/">Writing - review and editing</role>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Fan</surname>
<given-names>Junfeng</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<xref ref-type="aff" rid="aff5">
<sup>5</sup>
</xref>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Methodology" vocab-term-identifier="https://credit.niso.org/contributor-roles/methodology/">Methodology</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Resources" vocab-term-identifier="https://credit.niso.org/contributor-roles/resources/">Resources</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing - original draft</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x26; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/">Writing - review and editing</role>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Bao</surname>
<given-names>Zhiwei</given-names>
</name>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<xref ref-type="aff" rid="aff6">
<sup>6</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1115503"/>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Resources" vocab-term-identifier="https://credit.niso.org/contributor-roles/resources/">Resources</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing - original draft</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x26; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/">Writing - review and editing</role>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Zhang</surname>
<given-names>Sheng</given-names>
</name>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing - original draft</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Liu</surname>
<given-names>Liang</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Resources" vocab-term-identifier="https://credit.niso.org/contributor-roles/resources/">Resources</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing - original draft</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x26; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/">Writing - review and editing</role>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Yang</surname>
<given-names>Mengsu</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="aff" rid="aff4">
<sup>4</sup>
</xref>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Funding acquisition" vocab-term-identifier="https://credit.niso.org/contributor-roles/funding-acquisition/">Funding acquisition</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Resources" vocab-term-identifier="https://credit.niso.org/contributor-roles/resources/">Resources</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Supervision" vocab-term-identifier="https://credit.niso.org/contributor-roles/supervision/">Supervision</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing - original draft</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x26; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/">Writing - review and editing</role>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Church</surname>
<given-names>George M.</given-names>
</name>
<xref ref-type="aff" rid="aff7">
<sup>7</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/116767"/>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Resources" vocab-term-identifier="https://credit.niso.org/contributor-roles/resources/">Resources</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Supervision" vocab-term-identifier="https://credit.niso.org/contributor-roles/supervision/">Supervision</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing - original draft</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x26; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/">Writing - review and editing</role>
</contrib>
</contrib-group>
<aff id="aff1">
<label>1</label>
<institution>Institute of Digital Medicine, City University of Hong Kong</institution>, <city>Hong Kong SAR</city>, <country country="CN">China</country>
</aff>
<aff id="aff2">
<label>2</label>
<institution>DeSci Sino, Hong Kong</institution>, <city>Hong Kong SAR</city>, <country country="CN">China</country>
</aff>
<aff id="aff3">
<label>3</label>
<institution>Zhiyu DAO, KanDaoShanWei Technology Inc.</institution>, <city>Shanghai</city>, <country country="CN">China</country>
</aff>
<aff id="aff4">
<label>4</label>
<institution>Department of Biomedical Sciences, City University of Hong Kong</institution>, <city>Hong Kong SAR</city>, <country country="CN">China</country>
</aff>
<aff id="aff5">
<label>5</label>
<institution>Open Security Research</institution>, <city>Shenzhen</city>, <state>Guangdong</state>, <country country="CN">China</country>
</aff>
<aff id="aff6">
<label>6</label>
<institution>College of Biomedical Engineering and Instrument Science, Ministry of Education Key Laboratory of Biomedical Engineering, Zhejiang University</institution>, <city>Hangzhou</city>, <country country="CN">China</country>
</aff>
<aff id="aff7">
<label>7</label>
<institution>Department of Genetics, Harvard Medical School</institution>, <city>Boston</city>, <state>MA</state>, <country country="US">United States</country>
</aff>
<author-notes>
<corresp id="c001">
<label>&#x2a;</label>Correspondence: Yu Wang, <email xlink:href="mailto:yosean.wang@cityu.edu.hk">yosean.wang@cityu.edu.hk</email>; George M. Church, <email xlink:href="mailto:gchurch@genetics.med.harvard.edu">gchurch@genetics.med.harvard.edu</email>
</corresp>
<fn fn-type="other" id="fn001">
<label>&#x2020;</label>
<p>Lead Contact</p>
</fn>
</author-notes>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2026-02-02">
<day>02</day>
<month>02</month>
<year>2026</year>
</pub-date>
<pub-date publication-format="electronic" date-type="collection">
<year>2025</year>
</pub-date>
<volume>8</volume>
<elocation-id>1631217</elocation-id>
<history>
<date date-type="received">
<day>19</day>
<month>05</month>
<year>2025</year>
</date>
<date date-type="rev-recd">
<day>25</day>
<month>12</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>29</day>
<month>12</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2026 Wang, Fan, Bao, Zhang, Liu, Yang and Church.</copyright-statement>
<copyright-year>2026</copyright-year>
<copyright-holder>Wang, Fan, Bao, Zhang, Liu, Yang and Church</copyright-holder>
<license>
<ali:license_ref start_date="2026-02-02">https://creativecommons.org/licenses/by/4.0/</ali:license_ref>
<license-p>This is an open-access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution License (CC BY)</ext-link>. The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</license-p>
</license>
</permissions>
<abstract>
<p>Biomedical data underpins scientific discovery, and open science offers the potential to accelerate innovation through the unrestricted sharing of knowledge, methodologies, and datasets. However, the open science dilemma persists, as researchers hesitate to share data due to privacy concerns, intellectual property risks, and lack of recognition. Stringent data privacy regulations further compound these challenges, limiting data sharing. To address these barriers, we propose the Cryptographic Open Science (COS) framework, integrating advanced technologies for secure, privacy-preserving, and incentivized data sharing. Blockchain technology provides immutable records of data ownership and usage, enhancing transparency and trust, while smart contracts automate access controls and enforce compliance. However, blockchain alone does not prevent loss of control over plaintext data once released. COS incorporates Fully Homomorphic Encryption (FHE) to allow computations on encrypted data, ensuring end-to-end confidentiality and maintaining full ownership control. Recognizing that privacy alone does not incentivize sharing, COS introduces a crypto token-based system to create a market-driven flywheel. This system rewards contributors and aligns stakeholder interests, promoting active data sharing. By integrating blockchain, FHE, and token-based incentives, COS bridges the gap between the ideals of open science and the practical concerns of data providers, accelerating progress in fields like precision medicine and genomics.</p>
</abstract>
<kwd-group>
<kwd>biomedical data</kwd>
<kwd>blockchain</kwd>
<kwd>cryptocurrency</kwd>
<kwd>fully homomorphic encryption</kwd>
<kwd>open science</kwd>
<kwd>web 3.0 technologies</kwd>
</kwd-group>
<funding-group>
<award-group id="gs1">
<funding-source id="sp1">
<institution-wrap>
<institution>City University of Hong Kong</institution>
<institution-id institution-id-type="doi" vocab="open-funder-registry" vocab-identifier="10.13039/open_funder_registry">10.13039/100007567</institution-id>
</institution-wrap>
</funding-source>
</award-group>
<funding-statement>The author(s) declared that financial support was received for this work and/or its publication. This work was supported by Institute of Digital Medicine at City University of Hong Kong.</funding-statement>
</funding-group>
<counts>
<fig-count count="4"/>
<table-count count="2"/>
<equation-count count="0"/>
<ref-count count="58"/>
<page-count count="13"/>
</counts>
<custom-meta-group>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Blockchain for Science</meta-value>
</custom-meta>
</custom-meta-group>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<label>1</label>
<title>Introduction</title>
<p>In today&#x2019;s digital age, especially with the rapid growth of artificial intelligence, data has become a vital resource driving advancements across numerous scientific fields. For instance, the second phase of the Human Genome Project (HGP2) has set an ambitious goal to collect multi-omics data from 1% of the global population&#x2014;equating to 80 million people out of 8 billion (<xref ref-type="bibr" rid="B30">Liu, 2024</xref>). Open science initiatives, which advocate for the open sharing of scientific knowledge, data, and methodologies, have the potential to revolutionize research by facilitating data exchange (<xref ref-type="bibr" rid="B10">Commission, 2024</xref>; <xref ref-type="bibr" rid="B35">NASA, 2025</xref>; <xref ref-type="bibr" rid="B52">UNESCO, 2025</xref>). Significant scientific breakthroughs, such as the rapid development of COVID-19 vaccines, have been greatly accelerated by open data sharing and collaborative efforts within the global scientific community (<xref ref-type="bibr" rid="B57">Zastrow, 2020</xref>).</p>
<p>Despite the promising benefits of open science, a fully free and transparent system is not always practical (<xref ref-type="bibr" rid="B47">Scheliga and Friesike, 2014</xref>). This issue, often referred to as the &#x201c;Open Science Dilemma,&#x201d; is analogous to the classic &#x201c;Prisoner&#x2019;s Dilemma&#x201d; in game theory, where individuals must choose between acting for the collective good or prioritizing personal interests. In the realm of open science, researchers face similar trade-offs. Although open data sharing can greatly benefit the scientific community by fostering faster discovery and wider collaboration, individual researchers often hesitate to participate due to concerns over losing intellectual property rights, recognition, or competitive advantage (<xref ref-type="bibr" rid="B47">Scheliga and Friesike, 2014</xref>). Additionally, the absence of sufficient incentives discourages participation, especially when maintaining high data quality requires substantial extra effort. This problem is particularly pronounced in the private sector, where significant volumes of valuable data are held but cannot be shared openly due to IP constraints (<xref ref-type="bibr" rid="B33">Micheli, 2022</xref>).</p>
<p>In addition, data safety and privacy concerns, particularly for sensitive human-related data, further compound these challenges. Strict data protection laws in regions such as the U.S., Europe, and China&#x2014;like HIPAA, GDPR and PIPL&#x2014;create significant legal and ethical barriers to open sharing (<xref ref-type="bibr" rid="B36">Ness and Committee, 2007</xref>; <xref ref-type="bibr" rid="B53">Voigt, 2017</xref>; <xref ref-type="bibr" rid="B38">Personal Information Protection Law, 2021</xref>). According to IBM&#x2019;s 2024 Cost of a Data Breach Report, the global average total cost of a data breach is $4.88 million (<xref ref-type="bibr" rid="B19">IBM, 2024</xref>). In 2023, the genetic testing company 23andMe experienced a major hacker attack, compromising the personal information of nearly 7 million customers, including sensitive genetic data. This incident not only led to widespread public concern but also sparked class-action lawsuits against the company (<xref ref-type="bibr" rid="B50">Tidy, 2023</xref>). Another notable breach is the 2018 data breach at MyHeritage, affecting 92 million users (<xref ref-type="bibr" rid="B34">MyHeritage, 2018</xref>). These incidents underscore the vulnerability of biological data security. Studies have shown that even anonymized genetic data can be re-identified through cross-referencing with other publicly available data sources (<xref ref-type="bibr" rid="B8">Bonomi et al., 2020</xref>; <xref ref-type="bibr" rid="B17">He and Zhou, 2020</xref>).</p>
<p>To address these challenges, we propose a &#x2018;Cryptographic Open Science&#x2019; framework that leverages advanced Web 3.0-related cryptography technologies such as blockchain, data encryption (particularly Fully Homomorphic Encryption, FHE) and crypto tokens to create robust data protection mechanisms that safeguard security, intellectual property, and privacy while incentivizing participation (<xref ref-type="fig" rid="F1">Figure 1</xref>). Although it may seem counterintuitive, sharing data with cryptographic protections allows for secure, controlled data exchange without compromising privacy, data ownership, or competitive advantage. This balanced approach between openness and security provides a viable path forward for advancing open science, ensuring that data can be shared in a way that maintains trust and encourages collaboration.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Secure and incentivized sharing of biological data using Web 3.0-related technologies.</p>
</caption>
<graphic xlink:href="fbloc-08-1631217-g001.tif">
<alt-text content-type="machine-generated">Flowchart depicting the integration of biological data silos into a collaborative ecosystem via Web 3.0 technologies. It begins with data silos, which are transformed using blockchain, data encryption, and crypto tokens for secure sharing. Features include clear data ownership, privacy protection, usage control, and fair credit sharing, leading to a collaborative multi-party ecosystem.</alt-text>
</graphic>
</fig>
</sec>
<sec id="s2">
<label>2</label>
<title>Related research</title>
<p>Blockchain is a decentralized, distributed ledger technology that allows data to be recorded, shared, and maintained across a network of computers without the need for a central authority (<xref ref-type="bibr" rid="B11">Crosby et al., 2016</xref>; <xref ref-type="bibr" rid="B46">Sarmah, 2018</xref>). Each block in the blockchain contains a list of transactions or data entries, a timestamp, and a cryptographic link to the previous block, forming a secure and immutable chain. The use of blockchain techniques ensures that once data is recorded, it cannot be altered without the consensus of the network participants (<xref ref-type="fig" rid="F2">Figure 2</xref>). MedRec is an early exemplar that uses a blockchain layer to manage medical data permissions and access events, while FHIRChain targets clinical interoperability by binding access management to HL7 FHIR-based workflows (<xref ref-type="bibr" rid="B3">Azaria et al., 2016</xref>; <xref ref-type="bibr" rid="B58">Zhang et al., 2018</xref>).</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Blockchain technologies used for data ownership recording, smart contract formation between Data Provider and Data User to record data usage and share credits.</p>
</caption>
<graphic xlink:href="fbloc-08-1631217-g002.tif">
<alt-text content-type="machine-generated">Diagram depicting a data sharing framework with a focus on biological data. A data provider contributes biological data, which is integrated into blockchain technology. A smart contract facilitates credit sharing with a data user. Incentivization spans across the data flow. Data ownership and usage are recorded within the blockchain.</alt-text>
</graphic>
</fig>
<p>However, blockchain alone is insufficient to protect data due to the inherent nature of digital assets, where duplication costs are virtually zero. Once data are released publicly, it becomes impossible to maintain control over them, even if data ownership is recorded on blockchains. Privacy concerns and restrictive government policies further compound the challenges of sharing data in plain formats. Before modern cryptographic approaches were widely usable, many biomedical consortia adopted federated query architectures that keep data behind institutional firewalls and only return restricted outputs (typically aggregate counts or vetted summaries). Early systems such as SHRINE operationalized cross-site cohort discovery by sending standardized queries to local clinical repositories and returning aggregate results under institutional review board (IRB) constraints (<xref ref-type="bibr" rid="B54">Weber et al., 2009</xref>). These systems provide an important baseline: they preserve institutional control and reduce raw-data transfer, but privacy protection largely relies on governance rules, output restrictions, and trust in the hosting institution rather than cryptographic confidentiality guarantees.</p>
<p>Federated Learning is a machine learning paradigm where a global model is trained collaboratively across multiple decentralized devices or servers holding local data samples, without exchanging the data itself (<xref ref-type="bibr" rid="B23">Kairouz and McMahan, 2021</xref>; <xref ref-type="bibr" rid="B31">Mammen, 2021</xref>). Each participant trains the model on their local data and shares only the model updates (e.g., gradients) with a central server that aggregates them to improve the global model. Federated learning has achieved significant traction in biomedical applications (<xref ref-type="bibr" rid="B12">Crowson et al., 2022</xref>; <xref ref-type="bibr" rid="B42">Rieke et al., 2020</xref>). Notable large-scale initiatives include the MELLODDY project, where 10 pharmaceutical companies (including Amgen, Bayer, Janssen, Novartis, etc.) collaboratively trained drug discovery models without sharing proprietary data (<xref ref-type="bibr" rid="B18">Heyndrickx et al., 2023</xref>). The experiments involved a data set of 2.6&#x2b; billion confidential experimental activity data points cross-pharma companies, documenting 21&#x2b; million physical small molecules and 40&#x2b; thousand assays in on-target and secondary pharmacodynamics and pharmacokinetics. The results demonstrated markedly higher improvements in multi-partner federated models compared to single-partner models. The Federated Tumor Segmentation (FeTS) initiative spanning 30 international healthcare institutions focusing on training deep learning models for brain tumor segmentation (<xref ref-type="bibr" rid="B37">Pati et al., 2022</xref>). While FL enables collaborative model training without data pooling, recent work has exposed critical vulnerabilities&#x2014;gradient leakage attacks can reconstruct training images (<xref ref-type="bibr" rid="B61">Zhu et al., 2019</xref>). Another significant challenge is Statistical Heterogeneity. In healthcare, data distributions vary significantly across institutions due to differences in scanner protocols, patient demographics, and labeling practices. This heterogeneity can lead to slow convergence or poor performance of the global model. Additionally, System Heterogeneity&#x2014;the varying computational power and network bandwidth of client nodes&#x2014;poses logistical challenges, as the speed of the training round is often bottlenecked by the slowest participant (<xref ref-type="bibr" rid="B4">Barona L&#xf3;pez and Borja Saltos, 2025</xref>; <xref ref-type="bibr" rid="B29">Li et al., 2025</xref>; <xref ref-type="bibr" rid="B48">Shah et al., 2025</xref>).</p>
<p>Secure Multi-Party Computation (SMPC) is a set of cryptographic protocols that enable multiple parties to jointly compute a function over their inputs while keeping those inputs private (<xref ref-type="bibr" rid="B60">Zhao et al., 2019</xref>; <xref ref-type="bibr" rid="B51">Tran et al., 2021</xref>). Each party learns only the output of the computation and gains no additional information about the other parties&#x2019; inputs. Cho, et al. introduce a framework that enables large-scale genome-wide association studies (GWAS) to be conducted directly on privately held genomic and phenotypic data using secret sharing and secure multiparty computation. By addressing key computational bottlenecks&#x2014;particularly quality control and population stratification correction&#x2014;and achieving linear scalability with respect to cohort size, this work demonstrates that rigorous privacy guarantees can be reconciled with the practical demands of modern GWAS (<xref ref-type="bibr" rid="B9">Cho et al., 2018</xref>). Differential privacy (DP) offers a mathematically grounded approach to limiting information leakage from released statistics or trained models by injecting calibrated noise. In biomedical settings, DP is most naturally aligned with releasing aggregates, summary statistics, or privacy-preserving model updates. Yet practical deployments must confront domain-specific constraints: biomedical variables are often highly correlated (e.g., linkage disequilibrium in genetics, repeated measures in EHR trajectories), and na&#xef;vely applying DP mechanisms can either weaken privacy guarantees under dependency assumptions or degrade utility significantly. Recent work has explicitly studied DP under dependent records (including genomic-style dependencies), emphasizing that privacy/utility tradeoffs depend strongly on the statistical structure of the data and on how privacy budgets are tracked across repeated queries. This motivates hybrid approaches where DP is applied selectively (e.g., only to certain outputs or query types) and coupled with cryptographic controls that reduce exposure in the first place (<xref ref-type="bibr" rid="B2">Almadhoun et al., 2020</xref>). Zero Knowledge Proofs (ZKP)s are cryptographic protocols that allow one party (the prover) to prove to another party (the verifier) that a certain statement is true without revealing any additional information beyond the validity of the statement itself (<xref ref-type="bibr" rid="B49">Sun et al., 2021</xref>; <xref ref-type="bibr" rid="B6">Berentsen et al., 2023</xref>). ZKPs enable verification of knowledge or attributes without disclosing the underlying data. Trusted Execution Environments (TEE)s are hardware solutions that provide secure areas within a processor that isolate code execution and data processing from the rest of the system (<xref ref-type="bibr" rid="B45">Sabt et al., 2015</xref>; <xref ref-type="bibr" rid="B21">Jauernig et al., 2020</xref>). They protect sensitive computations from being accessed or tampered with by unauthorized parties, even if the operating system or other software is compromised. While TEEs are generally faster, they require trust in the hardware manufacturer and have been shown to be vulnerable to side-channel attacks (e.g., Spectre, Meltdown), which limits their utility for extremely sensitive genomic data compared to pure cryptographic solutions.</p>
<p>FHE is a form of encryption that allows computations to be performed directly on encrypted data (ciphertexts) without needing to decrypt it first (<xref ref-type="fig" rid="F3">Figure 3</xref>). The result of these computations remains encrypted, and when decrypted by the data owner, matches the result of operations performed on the plaintext (<xref ref-type="bibr" rid="B32">Marcolla et al., 2022</xref>; <xref ref-type="bibr" rid="B28">Kun, 2024</xref>). This enables secure data processing in untrusted environments such as cloud platforms. Recent advancements in Fully Homomorphic Encryption (FHE) have significantly enhanced the potential for secure and privacy-preserving analysis of genomic and clinical data at scale (<xref ref-type="bibr" rid="B7">Blatt et al., 2020</xref>; <xref ref-type="bibr" rid="B27">Kim et al., 2020</xref>; <xref ref-type="bibr" rid="B56">Ya et al., 2022</xref>; <xref ref-type="bibr" rid="B15">Grishin et al., 2019</xref>; <xref ref-type="bibr" rid="B16">Grishin et al., 2021</xref>). For example, Cheon et al. who developed an FHE-based method for genome-wide association studies (GWAS), and their approach allows chi-square statistics to be computed on encrypted genomic data, achieving accuracy comparable to traditional methods while preserving data privacy (<xref ref-type="bibr" rid="B27">Kim et al., 2020</xref>).</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>
<bold>(a)</bold> The principle of Fully Homomorphic Encryption (FHE) for data encryption and computation. <bold>(b)</bold> Illustration of complete data owner control over data usage using FHE, ensuring end-to-end data confidentiality. The data provider encrypts their data using FHE, and the encrypted data undergoes a quality check. Data users submit requests to perform computations on the encrypted data using algorithms supplied by an algorithm provider. Importantly, the results of these computations can only be decrypted with the private key held by the data provider.</p>
</caption>
<graphic xlink:href="fbloc-08-1631217-g003.tif">
<alt-text content-type="machine-generated">Diagram illustrating the principle of fully homomorphic encryption. In part (a), plaintext data (5 and 3) is encrypted into ciphertext (xiw!9 and 3x8#), computed to xu32, and decrypted to get the result 8. Part (b) shows a data flow process with roles: a data provider supplies biological data, which a quality checker encrypts using fully homomorphic encryption. An algorithm provider processes the encrypted data. A data user submits a request and receives decrypted results via a private key ensuring authorization.</alt-text>
</graphic>
</fig>
<p>Each of these technologies offers a unique approach to addressing data privacy challenges, and their combined use can ensure the highest level of data protection tailored to specific application scenarios. For example, private keys used to decrypt FHE results can be securely stored within a Trusted Execution Environment (TEE), preventing unauthorized access (<xref ref-type="bibr" rid="B5">Behnke, 2023</xref>).</p>
</sec>
<sec id="s3">
<label>3</label>
<title>Cryptographic Open Science framework</title>
<sec id="s3-1">
<label>3.1</label>
<title>Blockchain for data ownership and transparent data usage</title>
<p>In the context of open science, blockchain can be utilized to create immutable records of data, including data provenance, ownership, and usage (<xref ref-type="fig" rid="F2">Figure 2</xref>) (<xref ref-type="bibr" rid="B39">Pi et al., 2022</xref>; <xref ref-type="bibr" rid="B26">Khan et al., 2023</xref>). These immutable records provide proof of data origin and ownership. By ensuring that original data contributors can be properly traced, blockchain enhances accountability and recognition within the research community. Additionally, the transparent nature of blockchain allows for easy auditing of data collection, access, and usage, enabling data users to verify whether the data resources and collection procedures meet their standards&#x2014;a factor particularly important when handling sensitive human-related data (<xref ref-type="bibr" rid="B22">Kaaniche and Laurent, 2017</xref>). A key concept embedded in the Web 3.0 community is &#x201c;Don&#x2019;t trust, verify,&#x201d; derived from the immutability and transparency of blockchain. Recording data usage on the blockchain enables data providers and owners to track and examine each instance of their data being used. This transforms the traditional collaboration paradigm from building trusted networks to establishing verifiable networks, which is critical for accelerating open science among a large group of scientists.</p>
<p>Researchers can also leverage blockchain-enabled smart contracts, which are self-executing agreements that automatically enforce predefined terms and conditions, to facilitate secure and efficient data sharing (<xref ref-type="bibr" rid="B25">Khan et al., 2021</xref>). As a demonstration, we designed a soul-bound token (SBT)-anchored biological data access-control system that establishes verifiable, non-transferable ownership of datasets. Each Data Owner receives a SBT that binds data control to an immutable digital identity. The SBT encodes (i) a persistent subject identifier (ownerDid), (ii) the owner&#x2019;s registered public-key fingerprints for policy signatures, and (iii) optional compliance attestations such as IRB or ethics approvals. Authorization is governed by two core smart contracts:</p>
<p>AccessACL, which defines and stores access policies&#x2014;including identity bindings, dataset scope, operation masks, purpose hashes, time windows, geographic constraints, and optional differential-privacy budgets&#x2014;and UsageLog, an append-only ledger that records immutable state transitions (Requested, Granted, Used, Revoked, JobResult).</p>
<p>When a user submits an access request, the Gateway verifies the corresponding on-chain policy and issues a short-lived signed ticket containing the dataset ID, permitted operations, expiration timestamp, and a cryptographic digest of the encrypted object. This ticket functions as a capability token for encrypted-storage systems, which validate its signature before serving ciphertext blocks. Every read or compute operation triggers an on-chain log event to ensure full accountability. For computational tasks, the same workflow issues a JobPermit binding a dataset, algorithm identifier, and purpose hash. Off-chain orchestrators subscribe to these events, execute approved encrypted workflows, and publish result commitments (hashes of ciphertext outputs and associated metadata) back to the ledger. Post-processing smart-contract hooks handle payment distribution, enforce rate limits, and finalize the audit trail.</p>
</sec>
<sec id="s3-2">
<label>3.2</label>
<title>Data encryption for enhanced data privacy and complete owner control</title>
<p>Among the cryptographic technologies, Fully Homomorphic Encryption (FHE) is often regarded as the &#x201c;holy grail&#x201d; of encryption, offering a critical advantage: end-to-end data confidentiality, which entirely eliminates exposure of plaintext data (<xref ref-type="fig" rid="F3">Figure 3</xref>). Unlike other methods, FHE does not rely on external parties, hardware manufacturers, or other participants. It allows computations to be securely outsourced to untrusted third-party servers or cloud providers without risking data exposure. By keeping data encrypted during processing, FHE also simplifies compliance with data protection regulations like GDPR, HIPAA and PIPL, offering significant advantages over traditional data sharing methods (<xref ref-type="table" rid="T1">Table 1</xref>).</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Comparison of traditional and encrypted data sharing approaches. This table compares traditional and encrypted data sharing approaches across five key aspects. Encrypted data sharing shows clear advantages in privacy protection, data utility, collaborative potential, and regulatory compliance, while traditional methods have an edge in lower computational overhead.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Aspect</th>
<th align="center">Traditional data sharing</th>
<th align="center">Encrypted data sharing</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">Privacy protection</td>
<td align="center">Low</td>
<td align="center">High</td>
</tr>
<tr>
<td align="left">Data utility</td>
<td align="center">Limited</td>
<td align="center">Full</td>
</tr>
<tr>
<td align="left">Collaborative potential</td>
<td align="center">Restricted</td>
<td align="center">Extensive</td>
</tr>
<tr>
<td align="left">Regulatory compliance</td>
<td align="center">Challenging</td>
<td align="center">Simplified</td>
</tr>
<tr>
<td align="left">Computational overhead</td>
<td align="center">Low</td>
<td align="center">High</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>To further enhance data security, we propose developing blockchain- and FHE-integrated DePIN (Decentralized Physical Infrastructure) devices such as DNA sequencers that perform FHE encryption and blockchain ownership recording at the point of data generation. This ensures that genetic sequencing data is protected from the moment it is created, greatly reducing the risk of data leakage. This approach not only safeguards user privacy but also builds public confidence in genetic sequencing technologies, encouraging broader participation in genomic research. Collaborations with leading sequencing device manufacturers such as Illumina, Oxford Nanopore, and BGI could facilitate the integration of such technologies into existing devices. To ensure the usability of encrypted data, standardized analysis workflows and APIs tailored to common bioinformatics tasks are essential. We propose developing a suite of encrypted data analysis tools, including those for GWAS, epigenomics, transcriptomics, proteomics, and multi-omics integration. These tools will abstract the complexity of encrypted computations, providing researchers with familiar interfaces and output formats. This approach enables biologists who may lack expertise in encryption technologies to conduct sophisticated data analyses effortlessly. We also envision creating an encrypted bioinformatics platform similar to Galaxy (<xref ref-type="bibr" rid="B20">Jalili et al., 2020</xref>), equipped with a graphical user interface, workflow management, visualization tools, integrated development environment, data management system, computational resource management, and collaboration tools. This platform will significantly lower the technical barrier to using encrypted data, fostering wider participation in secure data sharing and analysis. Standardized workflows will further reduce these barriers, promoting broader scientific collaboration.</p>
</sec>
<sec id="s3-3">
<label>3.3</label>
<title>Crypto token-based incentive system for high-quality data sharing</title>
<p>Addressing data privacy concerns alone does not automatically result in active participation in data sharing. To further incentivize the sharing of high-quality datasets, we propose a crypto token-based incentive system, demonstrated here under the name OMICS (an umbrella term encompassing biological and medical data) as a conceptual framework (<xref ref-type="fig" rid="F4">Figure 4</xref>).</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>
<bold>(a)</bold> A crypto token-based system for dataset tokenization and monetization. The dataset is represented on-chain as a Non-Fungible Token (NFT) and then fractionalized into fungible tokens. A portion of these tokens is allocated to data providers, while the remaining tokens are publicly sold on the market. The value of the tokens is determined by market dynamics and profits generated from platform rewards, data user payments, and royalties. <bold>(b)</bold> A crypto token-based collaborative dataset curation system. A dataset concept is proposed, and a corresponding token is minted to represent its value and potential. Funding for the dataset is raised through the trading of these tokens, which provides the resources necessary for data collection. Data providers are rewarded with tokens in recognition of their contributions. Upon release of the dataset, additional revenues are generated from data users accessing or utilizing the data, further increasing the token&#x2019;s value. This value growth creates a rewarding mechanism for all token holders. The dynamic token market fosters a self-reinforcing flywheel effect, continuously incentivizing the development, fundraising, and data collection process, while aligning the interests of all stakeholders.</p>
</caption>
<graphic xlink:href="fbloc-08-1631217-g004.tif">
<alt-text content-type="machine-generated">Diagram illustrating decentralized data exchange systems. In section (a), data providers encrypt data for blockchain, leading to tokenization as NFTs, facilitating market transactions, platform rewards, pay-per-usage, and product royalties. Section (b) outlines processes from proposal, fundraising, dataset curation, and release to profit sharing involving proposers, markets, data providers, and users, forming an incentive flywheel.</alt-text>
</graphic>
</fig>
<p>In the proposed OMICS system, data providers submit information about their encrypted datasets onto a blockchain platform and mint a Non-Fungible Token (NFT) representing each unique dataset. This NFT serves as a digital certificate of ownership and provenance, ensuring the dataset&#x2019;s integrity and authenticity within the decentralized network. The NFT can then be fractionalized into fungible tokens, enabling divisible ownership or profit rights associated with the dataset. A portion of these fungible tokens is allocated back to the data provider, granting them continued stake and potential revenue from their data asset. The remaining tokens are listed on decentralized markets or exchanges for trading, providing liquidity and allowing investors or other researchers to acquire stakes in the dataset.</p>
<p>Beyond capital raised through token trading, there are three primary mechanisms to generate additional funding and enhance the value of the tokens:<list list-type="order">
<list-item>
<p>
<italic>Upfront Submission Rewards from the Platform</italic>: the upfront submission reward is provided to data providers for submitting datasets and passing quality checks. These rewards are issued in OMICS tokens by the platform and tiered based on data quality and completeness. The data quality can be reviewed through a crowd-source peer review system by peer scientists who have expertise in the corresponding domain and the peer scientists who complete the review can also obtain OMICS token awards.</p>
</list-item>
<list-item>
<p>
<italic>Pay-Per-Use Payments</italic>: the pay-per-use payment system allows data consumers to access and perform computations on the encrypted datasets by paying usage fees facilitated through smart contracts. These payments are automatically and transparently distributed to token holders, providing an ongoing revenue stream linked directly to the dataset&#x2019;s utilization.</p>
</list-item>
<list-item>
<p>
<italic>Long-Term Credit-Sharing Royalties</italic>: the credit-sharing royalty mechanism tracks the profits gained by data users from utilizing shared data, such as revenue from publications, patents, or product commercialization. Through smart contracts, a predetermined percentage of these profits is distributed to the original data providers and token holders using OMICS tokens in proportion to their data&#x2019;s contribution. Data users are required to declare revenues generated from shared datasets through the platform. This information is cross-verified using blockchain-based data usage records and publicly available records, such as patent databases or publication citations. Non-compliance or detected underreporting can result in penalties, suspension, or exclusion from the platform. This ensures that data providers continue to benefit from the long-term value generated by their data.</p>
</list-item>
</list>
</p>
<p>The abovementioned system is often challenged by limited dataset size, variable dataset quality, lack of funding for data curation, ambiguous data pricing strategy and unclear identification of data buyers. We here propose a collaborative dataset curation mechanism that allows individuals, organizations, or investors to crowdfund or invest in the creation, curation, quality-control and commercialization of datasets in a community-driven, decentralized, and transparent manner.</p>
<p>The workflow is structured into five key phases: <italic>proposal, funding, dataset curation, dataset release, and profit-sharing</italic>. This organized approach promotes transparency, accountability, and fair rewards for all stakeholders. Notably, the incentive system is not a one-directional, fixed process; it is dynamic. As token prices increase, they create a positive feedback loop that drives greater participation and engagement from stakeholders across all stages, reinforcing the ecosystem&#x2019;s growth and sustainability.<list list-type="order">
<list-item>
<p>
<italic>Proposal Phase</italic>: A proposer submits a comprehensive dataset proposal, detailing the scope (description, use cases, and scientific objectives, such as rare disease genomics), funding goals (budget requirements), milestones (phased deliverables and timelines), and contributor incentives. Contributors may include data providers, funding supporters, quality checkers, annotators, brokers, community operators, and the platform itself. These elements form the foundation for a community-driven dataset creation process.</p>
</list-item>
<list-item>
<p>
<italic>Funding Phase</italic>: The project is launched on the platform, enabling investors to pledge OMICS tokens during the offering period. In return, investors receive dataset-specific tokens, which grant equity or utility rights such as access, profit-sharing, and voting power in the dataset&#x2019;s governance. These tokens can be traded on the market, with a portion of the proceeds allocated to the project&#x2019;s funding pool.</p>
</list-item>
<list-item>
<p>
<italic>Dataset Curation Phase</italic>: Funds raised are used to recruit data providers, collect data, ensure quality control and proper dataset annotation. Data providers receive tokens as compensation, though the tokens are locked until the data passes quality checks. Funds are released in tranches upon milestone completion, with each milestone verified and recorded on the blockchain. The dataset may establish a Decentralized Autonomous Organization (DAO) to govern the curation process and manage funding allocation, with token holders actively participating in decision-making, such as setting data quality standards.</p>
</list-item>
<list-item>
<p>
<italic>Dataset Release Phase</italic>: The curated dataset is encrypted and securely stored on the platform. Additional stakeholders, such as data brokers, may be introduced to promote and negotiate usage deals with data consumers, expanding the dataset&#x2019;s reach and facilitating its commercialization.</p>
</list-item>
<list-item>
<p>
<italic>Profit-Sharing Phase</italic>: Revenues generated from dataset usage (e.g., pay-per-use fees, licensing royalties, or downstream commercialization) are distributed among token holders. A transparent revenue-sharing mechanism allocates earnings proportionally to token ownership. Additionally, a token burning mechanism reduces token supply, potentially increasing token value over time. All transactions and revenue flows are immutably recorded on the blockchain, ensuring transparency, fairness, and trust for all contributors and investors.</p>
</list-item>
</list>
</p>
<p>The incentive system can also be designed to reduce malicious behaviors. A reputation system can be implemented, where users earn reputation points based on their contributions, behavior, and the quality of their data. Higher reputation levels would unlock additional benefits, such as increased OMICS rewards or reduced transaction fees, incentivizing users to maintain high standards of participation and collaboration. Additionally, a staking mechanism can be introduced, allowing users to stake OMICS tokens on the platform in exchange for rewards that are proportional to the amount staked. This mechanism encourages users to actively participate and align their interests with the platform&#x2019;s success. Any malicious behavior or breach of platform rules would result in the forfeiture of staked OMICS and a corresponding reputation score drop, creating a deterrent against unethical actions and fostering a culture of accountability. Staking OMICS tokens could also grant users voting rights in platform governance, particularly if the platform operates as a Decentralized Autonomous Organization (DAO). This empowers users to participate in decision-making processes, ensuring that the platform evolves in a decentralized and community-driven manner. Moreover, the staking mechanism not only incentivizes long-term engagement but also contributes to token stability by reducing the circulating supply and encouraging committed, responsible participation.</p>
<p>The crypto token-based incentive mechanism provides a decentralized and transparent approach to funding and managing high-value datasets, offering significant benefits for all stakeholders. For data providers, it ensures fair compensation for their contributions through milestone-based funding, token rewards, and profit-sharing from dataset usage. For investors, it creates opportunities for financial returns and strategic access to curated datasets. Data users benefit from access to high-quality, encrypted datasets with clear pricing and flexible payment options. The platform fosters collaboration through decentralized governance, allowing stakeholders to influence decisions and monitor progress transparently via blockchain.</p>
<p>It is important to emphasize that the goal of this incentive system is not to create paywalls that restrict access to datasets. Instead, it aims to acknowledge the time, effort, and resources invested by data providers and other contributors, ensuring they receive appropriate recognition and fair compensation for their contributions. Data providers retain the option to donate their datasets freely or waive fees for non-profit researchers. However, this choice should be entirely voluntary, reflecting their autonomy, rather than being imposed by the limitations of traditional systems that fail to protect their rights and interests. This approach strikes a balance between promoting open science and safeguarding the rights of data contributors.</p>
</sec>
<sec id="s3-4">
<label>3.4</label>
<title>Features of COS framework</title>
<p>Implementing a Cryptographic Open Science framework offers transformative potential for biomedical research (<xref ref-type="table" rid="T2">Table 2</xref>). This framework could significantly accelerate the advancement of precision medicine. Secure data sharing will enable researchers to access large-scale, diverse datasets, driving progress in scientific research, drug development, and personalized treatment plans. For example, researchers studying rare diseases often face difficulties in reaching statistically significant conclusions due to limited sample sizes. Encrypted data sharing can overcome geographical and institutional barriers, allowing researchers to pool sufficient case data, thus speeding up the discovery of disease mechanisms and the development of targeted therapies. Additionally, this framework will promote global scientific collaboration, break down data silos, and accelerate the pace of scientific discovery.</p>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Cryptographic open science platform features.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Feature</th>
<th align="center">Description</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">Zero trust</td>
<td align="left">Data providers&#x2019; information is fully protected through fully homomorphic encryption (FHE), allowing them to share data securely without needing to trust other entities</td>
</tr>
<tr>
<td align="left">Per-use authorization</td>
<td align="left">Data providers maintain complete control over data usage by authorizing each access with private keys, addressing concerns over loss of control after data is shared</td>
</tr>
<tr>
<td align="left">Provable privacy</td>
<td align="left">The platform guarantees data privacy through verifiable cryptographic methods, meeting regulatory standards and addressing privacy concerns of oversight bodies</td>
</tr>
<tr>
<td align="left">Transparency and verifiability</td>
<td align="left">Data ownership, transactions, and usage are recorded immutably on a public blockchain, providing transparency and allowing for verifiable audit trails</td>
</tr>
<tr>
<td align="left">Fair incentives</td>
<td align="left">Market driven incentives to provide funding and compensation to data providers, to enhance data quality and to promote data usage</td>
</tr>
<tr>
<td align="left">Automated credit sharing</td>
<td align="left">Smart contracts automate transactions, ensuring that credits and benefits are shared equitably with data providers, enhancing incentives for data sharing</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Challenges and future directions</title>
<p>The implementation of COS framework also faces several technical and ethical challenges.</p>
<p>From a technical perspective, while FHE technology has made significant strides recently, it is still evolving and requires further optimization to handle large-scale biological data analysis effectively. The primary challenge for FHE is its computational overhead, with operations being several orders of magnitude slower than plaintext computations (<xref ref-type="bibr" rid="B59">Zhang et al., 2022</xref>). Addressing this challenge requires an integrative approach that includes advanced scheme and algorithm development, optimized bootstrapping techniques, and hardware acceleration. Selecting the appropriate FHE scheme based on application needs can significantly improve performance (<xref ref-type="bibr" rid="B32">Marcolla et al., 2022</xref>). For instance, the Brakerski-Fan-Vercauteren (BFV, 2012) scheme is optimized for integer arithmetic operations. The Torus FHE (TFHE, 2016) scheme focuses on high-speed bootstrapping and is ideal for binary computations, while the Cheon-Kim-Kim-Song (CKKS, 2017) scheme is designed for approximate computations on floating-point numbers, making it particularly useful for machine learning applications. Both academic and industry players are actively developing FHE libraries for practical applications, including IBM&#x2019;s HELib, Microsoft&#x2019;s SEAL, PALISADE, and TFHE (<xref ref-type="bibr" rid="B14">Gouert et al., 2023</xref>). Hardware acceleration is another critical factor in enhancing FHE efficiency (<xref ref-type="bibr" rid="B59">Zhang et al., 2022</xref>). The development of Field-Programmable Gate Arrays (FPGAs) and Application-Specific Integrated Circuits (ASICs) can greatly speed up FHE operations. ASICs, for example, are estimated to accelerate computations by more than 10,000 times compared to single-core CPU (<xref ref-type="bibr" rid="B1">Ahmad A et al., 2023</xref>). Additionally, application-specific optimizations, such as pre-computed lookup tables, can reduce computational requirements, and layered security models can be used to categorize data according to privacy levels, optimizing processing based on the sensitivity of the data. Additionally, transitioning existing bioinformatics algorithms to encrypted computing platforms remains a massive engineering challenge, necessitating the redesign of many classic algorithms. This task demands substantial investments in manpower, time, and close collaboration between biologists, computer scientists, and cryptographers. To make Fully Homomorphic Encryption (FHE) more accessible to non-experts, the community can focus on three key areas of development. First, we can create FHE compilers that allow users to write code in high-level languages like Python, which the compiler then automatically maps to encrypted computations. This approach enables developers to leverage FHE without needing specialized cryptographic knowledge. Second, FHE Software Development Kits (SDKs) can be developed to provide user-friendly, low-level APIs that simplify FHE implementation. While this requires developers to have a basic understanding of homomorphic encryption, they are shielded from its most complex aspects. Finally, we can build bioinformatic algorithm libraries specifically designed for FHE, effectively transferring fundamental algorithmic functions into an encrypted environment. Hosting hackathons and programming competitions could further facilitate collaborations between FHE experts and bioinformaticians to develop such libraries.</p>
<p>While the Cryptographic Open Science (COS) framework offers a technical resolution to the Open Science Dilemma, it introduces a complex set of cyber-ethical challenges that must be navigated to avoid exacerbating existing inequities. A primary ethical concern cited in critical literature is the &#x201c;hyper-financialization&#x201d; of health data. By tokenizing genomic information, the COS framework risks transforming patients from altruistic research participants into speculative assets. Additionally, establishing and maintaining a global encrypted biological data sharing platform requires significant investment and sustained international cooperation. Balancing the interests of diverse stakeholders and establishing a sustainable operational model are key challenges. Traditional data sharing initiatives like United Kingdom Biobank and China Kadoorie Biobank rely heavily on public funding and donations. However, the introduction of decentralized Web 3.0 technologies, such as blockchain and token-based incentives, could revolutionize the funding model by encouraging participation and unlocking market-driven investment from the public. This approach has the potential to raise funds at levels far exceeding traditional methods. Critics argue that market-driven incentives might skew research priorities toward commercially viable conditions (e.g., those affecting wealthy populations) at the expense of rare diseases or public health crises affecting marginalized groups. Furthermore, the volatility of crypto-assets could introduce instability into scientific funding, where the value of a research project fluctuates with token market speculation rather than scientific merit. Thirdly, a fundamental tension exists between the immutability of blockchain and the &#x201c;Right to Erasure&#x201d; (Right to be Forgotten) mandated by GDPR (Article 17) (<xref ref-type="bibr" rid="B41">Regulation, 2016</xref>). Strict interpretations of GDPR suggest that even hashed or encrypted personal data on a blockchain might still qualify as &#x201c;personal data&#x201d; if it can technically be linked back to an individual. A possible solution is to utilize &#x201c;crypto-shredding&#x201d; (destroying decryption keys) as a compliance mechanism. However, if a blockchain contains immutable references to personal data that a patient has revoked consent for, the entire protocol could still face significant regulatory risk, potentially forcing a &#x201c;hard fork&#x201d; or abandonment of the network. Lastly, the complexity of Web 3.0 interfaces poses a significant barrier to equitable access. Expecting patients to manage private keys, wallets, and gas fees for &#x201c;self-sovereign identity&#x201d; creates a high technical threshold that may exclude elderly, low-income, or less tech-savvy populations. This could lead to biased datasets that over-represent tech-literate demographics, subsequently training AI models that generalize poorly to the broader population. While FHE offers robust privacy protection, large-scale public education and outreach will be necessary to build understanding and trust in these technologies. Additionally, an international effort is required to harmonize legal and ethical standards across countries and regions, creating a flexible global regulatory framework that respects local requirements while upholding the core principles of data sharing. An international governing body would be needed to ensure that global projects adhere to these standards.</p>
</sec>
<sec sec-type="conclusion" id="s5">
<label>5</label>
<title>Conclusion</title>
<p>The Cryptographic Open Science framework provides a promising approach to tackling the privacy and security challenges associated with biomedical big data sharing. By integrating advanced cryptographic technologies, decentralized mechanisms, and international collaboration, this framework can facilitate true &#x201c;open science&#x201d; while safeguarding individual privacy and data sovereignty. This approach will not only accelerate the development of precision medicine and public health initiatives but also establish a solid data foundation for the application of artificial intelligence in the biomedical field and individual-centric fields like metaverse and digital twins (<xref ref-type="bibr" rid="B13">El Saddik et al., 2025</xref>; <xref ref-type="bibr" rid="B44">Saad et al., 2023</xref>).</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s6">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/<xref ref-type="sec" rid="s12">Supplementary Material</xref>, further inquiries can be directed to the corresponding authors.</p>
</sec>
<sec sec-type="author-contributions" id="s7">
<title>Author contributions</title>
<p>YW: Conceptualization, Funding acquisition, Writing &#x2013; original draft, Writing &#x2013; review and editing. JF: Investigation, Methodology, Resources, Writing &#x2013; original draft, Writing &#x2013; review and editing. ZB: Investigation, Resources, Writing &#x2013; original draft, Writing &#x2013; review and editing. SZ: Writing &#x2013; original draft, Investigation. LL: Investigation, Resources, Writing &#x2013; original draft, Writing &#x2013; review and editing. MY: Funding acquisition, Resources, Supervision, Writing &#x2013; original draft, Writing &#x2013; review and editing. GC: Conceptualization, Investigation, Resources, Supervision, Writing &#x2013; original draft, Writing &#x2013; review and editing.</p>
</sec>
<sec sec-type="COI-statement" id="s9">
<title>Conflict of interest</title>
<p>Authors YW, ZB, and SZ were employed by Zhiyu DAO, KanDaoShanWei Technology Inc.</p>
<p>Author JF was employed by Open Security Research.</p>
<p>The remaining author(s) declared that this work was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="ai-statement" id="s10">
<title>Generative AI statement</title>
<p>The author(s) declared that generative AI was used in the creation of this manuscript. GPT 4.0 was used to improve the readability and language of the manuscript.</p>
<p>Any alternative text (alt text) provided alongside figures in this article has been generated by Frontiers with the support of artificial intelligence and reasonable efforts have been made to ensure accuracy, including review by the authors wherever possible. If you identify any issues, please contact us.</p>
</sec>
<sec sec-type="disclaimer" id="s11">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<sec sec-type="supplementary-material" id="s12">
<title>Supplementary material</title>
<p>The Supplementary Material for this article can be found online at: <ext-link ext-link-type="uri" xlink:href="https://www.frontiersin.org/articles/10.3389/fbloc.2025.1631217/full#supplementary-material">https://www.frontiersin.org/articles/10.3389/fbloc.2025.1631217/full&#x23;supplementary-material</ext-link>
</p>
<supplementary-material xlink:href="Presentation1.pdf" id="SM1" mimetype="application/pdf" xmlns:xlink="http://www.w3.org/1999/xlink"/>
</sec>
<fn-group>
<fn fn-type="custom" custom-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1082982/overview">Ingrid Vasiliu Feltes</ext-link>, University of Miami, United States</p>
</fn>
<fn fn-type="custom" custom-type="reviewed-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/2759988/overview">Mustaqeem Khan</ext-link>, Mohamed bin Zayed University of Artificial Intelligence (MBZUAI), United Arab Emirates</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/3139058/overview">Divyashree D.</ext-link>, CMR University, India</p>
</fn>
</fn-group>
<ref-list>
<title>References</title>
<ref id="B1">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ahmad Al Badawi</surname>
<given-names>D. B. C.</given-names>
</name>
<name>
<surname>Polyakov</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Rohloff</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Hardware acceleration of fully homomorphic encryption: making privacy-preserving machine learning practical</article-title>
</mixed-citation>
</ref>
<ref id="B2">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Almadhoun</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Ayday</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Ulusoy</surname>
<given-names>&#xd6;.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Differential privacy under dependent tuples&#x2014;the case of genomic privacy</article-title>. <source>Bioinformatics</source> <volume>36</volume>, <fpage>1696</fpage>&#x2013;<lpage>1703</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btz837</pub-id>
<pub-id pub-id-type="pmid">31702787</pub-id>
</mixed-citation>
</ref>
<ref id="B3">
<mixed-citation publication-type="book">
<person-group person-group-type="author">
<name>
<surname>Azaria</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ekblaw</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Vieira</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Lippman</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2016</year>). <source>2nd international conference on open and big data (OBD)</source>. <publisher-name>IEEE</publisher-name>, <fpage>25</fpage>&#x2013;<lpage>30</lpage>.</mixed-citation>
</ref>
<ref id="B4">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Barona L&#xf3;pez</surname>
<given-names>L. I.</given-names>
</name>
<name>
<surname>Borja Saltos</surname>
<given-names>T.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>Heterogeneity challenges of federated learning for future wireless communication networks</article-title>. <source>J. Sens. Actuator Netw.</source> <volume>14</volume>, <fpage>37</fpage>. <pub-id pub-id-type="doi">10.3390/jsan14020037</pub-id>
</mixed-citation>
</ref>
<ref id="B5">
<mixed-citation publication-type="web">
<person-group person-group-type="author">
<name>
<surname>Behnke</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>What is a trusted execution environment (TEE)?</article-title> <comment>Available online at: <ext-link ext-link-type="uri" xlink:href="https://www.halborn.com/blog/post/what-is-a-trusted-execution-environment-tee%3e%20">https://www.halborn.com/blog/post/what-is-a-trusted-execution-environment-tee</ext-link>.</comment>
</mixed-citation>
</ref>
<ref id="B6">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Berentsen</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Lenzi</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Nyffenegger</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>An introduction to zero-knowledge proofs in blockchains and economics</article-title>. <source>Fed. Reserve Bank St. Louis Rev.</source> <volume>105</volume>, <fpage>280</fpage>&#x2013;<lpage>294</lpage>. <pub-id pub-id-type="doi">10.20955/r.105.280-94</pub-id>
</mixed-citation>
</ref>
<ref id="B7">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Blatt</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Gusev</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Polyakov</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Rohloff</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Vaikuntanathan</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Optimized homomorphic encryption solution for secure genome-wide association studies</article-title>. <source>BMC Med. Genomics</source> <volume>13</volume>, <fpage>1</fpage>&#x2013;<lpage>13</lpage>. <pub-id pub-id-type="doi">10.1186/s12920-020-0719-9</pub-id>
<pub-id pub-id-type="pmid">32693805</pub-id>
</mixed-citation>
</ref>
<ref id="B8">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bonomi</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Ohno-Machado</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Privacy challenges and research opportunities for genomic data sharing</article-title>. <source>Nat. Genetics</source> <volume>52</volume>, <fpage>646</fpage>&#x2013;<lpage>654</lpage>. <pub-id pub-id-type="doi">10.1038/s41588-020-0651-0</pub-id>
<pub-id pub-id-type="pmid">32601475</pub-id>
</mixed-citation>
</ref>
<ref id="B9">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cho</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>D. J.</given-names>
</name>
<name>
<surname>Berger</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Secure genome-wide association analysis using multiparty computation</article-title>. <source>Nat. Biotechnology</source> <volume>36</volume>, <fpage>547</fpage>&#x2013;<lpage>551</lpage>. <pub-id pub-id-type="doi">10.1038/nbt.4108</pub-id>
<pub-id pub-id-type="pmid">29734293</pub-id>
</mixed-citation>
</ref>
<ref id="B10">
<mixed-citation publication-type="web">
<person-group person-group-type="author">
<name>
<surname>Commission</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>The EU&#x27;s open science policy</article-title>. <comment>Available online at: <ext-link ext-link-type="uri" xlink:href="https://research-and-innovation.ec.europa.eu/strategy/strategy-2020-2024/our-digital-future/open-science_en%3e%20">https://research-and-innovation.ec.europa.eu/strategy/strategy-2020-2024/our-digital-future/open-science_en</ext-link>.</comment>
</mixed-citation>
</ref>
<ref id="B11">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Crosby</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Pattanayak</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Verma</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Kalyanaraman</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Blockchain technology: beyond bitcoin</article-title>. <source>Appl. Innovation</source> <volume>2</volume>, <fpage>71</fpage>. <comment>Available online at: <ext-link ext-link-type="uri" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://scet.berkeley.edu/wp-content/uploads/AIR-2016-Blockchain.pdf">https://scet.berkeley.edu/wp-content/uploads/AIR-2016-Blockchain.pdf</ext-link>.</comment>
</mixed-citation>
</ref>
<ref id="B12">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Crowson</surname>
<given-names>M. G.</given-names>
</name>
<name>
<surname>Moukheiber</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Ar&#xe9;valo</surname>
<given-names>A. R.</given-names>
</name>
<name>
<surname>Lam</surname>
<given-names>B. D.</given-names>
</name>
<name>
<surname>Mantena</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Rana</surname>
<given-names>A.</given-names>
</name>
<etal/>
</person-group> (<year>2022</year>). <article-title>A systematic review of federated learning applications for biomedical data</article-title>. <source>PLOS Digit. Health</source> <volume>1</volume>, <fpage>e0000033</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pdig.0000033</pub-id>
<pub-id pub-id-type="pmid">36812504</pub-id>
</mixed-citation>
</ref>
<ref id="B13">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>El Saddik</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ahmad</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Khan</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Abouzahir</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Gueaieb</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>Unleashing creativity in the metaverse: generative AI and multimodal content</article-title>. <source>ACM Trans. Multimedia Comput. Commun. Appl.</source> <volume>21</volume>, <fpage>1</fpage>&#x2013;<lpage>43</lpage>. <pub-id pub-id-type="doi">10.1145/3713075</pub-id>
</mixed-citation>
</ref>
<ref id="B14">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gouert</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Mouris</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Tsoutsos</surname>
<given-names>N.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Sok: new insights into fully homomorphic encryption libraries via standardized benchmarks</article-title>. <source>Proc. Privacy Enhancing Technologies</source> <volume>2023</volume>, <fpage>154</fpage>&#x2013;<lpage>172</lpage>. <pub-id pub-id-type="doi">10.56553/popets-2023-0075</pub-id>
</mixed-citation>
</ref>
<ref id="B15">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Grishin</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Obbad</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Church</surname>
<given-names>G. M.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Data privacy in the age of personal genomics</article-title>. <source>Nat. Biotechnology</source> <volume>37</volume>, <fpage>1115</fpage>&#x2013;<lpage>1117</lpage>. <pub-id pub-id-type="doi">10.1038/s41587-019-0271-3</pub-id>
<pub-id pub-id-type="pmid">31537915</pub-id>
</mixed-citation>
</ref>
<ref id="B16">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Grishin</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Raisaro</surname>
<given-names>J. L.</given-names>
</name>
<name>
<surname>Troncoso-Pastoriza</surname>
<given-names>J. R.</given-names>
</name>
<name>
<surname>Obbad</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Quinn</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Misbach</surname>
<given-names>M.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>Citizen-centered, auditable and privacy-preserving population genomics</article-title>. <source>Nat. Comput. Sci.</source> <volume>1</volume>, <fpage>192</fpage>&#x2013;<lpage>198</lpage>. <pub-id pub-id-type="doi">10.1038/s43588-021-00044-9</pub-id>
<pub-id pub-id-type="pmid">38183193</pub-id>
</mixed-citation>
</ref>
<ref id="B17">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>He</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Inference attacks on genomic data based on probabilistic graphical models</article-title>. <source>Big Data Min. Anal.</source> <volume>3</volume>, <fpage>225</fpage>&#x2013;<lpage>233</lpage>. <pub-id pub-id-type="doi">10.26599/bdma.2020.9020008</pub-id>
</mixed-citation>
</ref>
<ref id="B18">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Heyndrickx</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Mervin</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Morawietz</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Sturm</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Friedrich</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Zalewski</surname>
<given-names>A.</given-names>
</name>
<etal/>
</person-group> (<year>2023</year>). <article-title>Melloddy: cross-pharma federated learning at unprecedented scale unlocks benefits in qsar without compromising proprietary information</article-title>. <source>J. Chemical Information Modeling</source> <volume>64</volume>, <fpage>2331</fpage>&#x2013;<lpage>2344</lpage>. <pub-id pub-id-type="doi">10.1021/acs.jcim.3c00799</pub-id>
<pub-id pub-id-type="pmid">37642660</pub-id>
</mixed-citation>
</ref>
<ref id="B19">
<mixed-citation publication-type="web">
<collab>IBM</collab> (<year>2024</year>). <article-title>Cost of a data breach report</article-title>. <comment>Available online at: <ext-link ext-link-type="uri" xlink:href="https://www.ibm.com/reports/data-breach%3e%20">https://www.ibm.com/reports/data-breach</ext-link>.</comment>
</mixed-citation>
</ref>
<ref id="B20">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jalili</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Afgan</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Gu</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Clements</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Blankenberg</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Goecks</surname>
<given-names>J.</given-names>
</name>
<etal/>
</person-group> (<year>2020</year>). <article-title>The galaxy platform for accessible, reproducible and collaborative biomedical analyses: 2020 update</article-title>. <source>Nucleic Acids Research</source> <volume>48</volume>, <fpage>W395</fpage>&#x2013;<lpage>W402</lpage>. <pub-id pub-id-type="doi">10.1093/nar/gkaa434</pub-id>
<pub-id pub-id-type="pmid">32479607</pub-id>
</mixed-citation>
</ref>
<ref id="B21">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jauernig</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Sadeghi</surname>
<given-names>A.-R.</given-names>
</name>
<name>
<surname>Stapf</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Trusted execution environments: properties, applications, and challenges</article-title>. <source>IEEE Secur. and Priv.</source> <volume>18</volume>, <fpage>56</fpage>&#x2013;<lpage>60</lpage>. <pub-id pub-id-type="doi">10.1109/msec.2019.2947124</pub-id>
</mixed-citation>
</ref>
<ref id="B22">
<mixed-citation publication-type="book">
<person-group person-group-type="author">
<name>
<surname>Kaaniche</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Laurent</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2017</year>). <source>2017 IEEE 16th international symposium on network computing and applications (NCA)</source>. <publisher-name>IEEE</publisher-name>, <fpage>1</fpage>&#x2013;<lpage>5</lpage>.</mixed-citation>
</ref>
<ref id="B23">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kairouz</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>McMahan</surname>
<given-names>H. B.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Advances and open problems in federated learning</article-title>. <source>Found. Trends&#xae; Machine Learning</source> <volume>14</volume>, <fpage>1</fpage>&#x2013;<lpage>210</lpage>. <pub-id pub-id-type="doi">10.1561/2200000083</pub-id>
</mixed-citation>
</ref>
<ref id="B24">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Khalid</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Qayyum</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Bilal</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Al-Fuqaha</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Qadir</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Privacy-preserving artificial intelligence in healthcare: techniques and applications</article-title>. <source>Comput. Biol. Med.</source> <volume>158</volume>, <fpage>106848</fpage>. <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.106848</pub-id>
<pub-id pub-id-type="pmid">37044052</pub-id>
</mixed-citation>
</ref>
<ref id="B25">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Khan</surname>
<given-names>S. N.</given-names>
</name>
<name>
<surname>Loukil</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Ghedira-Guegan</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Benkhelifa</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Bani-Hani</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Blockchain smart contracts: applications, challenges, and future trends</article-title>. <source>Peer. Peer. Netw. Appl.</source> <volume>14</volume> <fpage>2901</fpage>&#x2013;<lpage>2925</lpage>. <pub-id pub-id-type="doi">10.1007/s12083-021-01127-0</pub-id>
<pub-id pub-id-type="pmid">33897937</pub-id>
</mixed-citation>
</ref>
<ref id="B26">
<mixed-citation publication-type="book">
<person-group person-group-type="author">
<name>
<surname>Khan</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>El Saddik</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Gueaieb</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>2023</year>). &#x201c;<source>In 2023 IEEE international conference on metaverse computing, networking and applications (MetaCom)</source>,&#x201d;. <publisher-name>IEEE</publisher-name>, <fpage>622</fpage>&#x2013;<lpage>626</lpage>.</mixed-citation>
</ref>
<ref id="B27">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kim</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Son</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Kim</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Kim</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Hong</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Cheon</surname>
<given-names>J. H.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Privacy-preserving approximate GWAS computation based on homomorphic encryption</article-title>. <source>BMC Med. Genomics</source> <volume>13</volume>, <fpage>1</fpage>&#x2013;<lpage>12</lpage>. <pub-id pub-id-type="doi">10.1186/s12920-020-0722-1</pub-id>
<pub-id pub-id-type="pmid">32693801</pub-id>
</mixed-citation>
</ref>
<ref id="B28">
<mixed-citation publication-type="web">
<person-group person-group-type="author">
<name>
<surname>Kun</surname>
<given-names>J. A.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>High-level technical overview of fully homomorphic encryption</article-title>. <comment>Available online at: <ext-link ext-link-type="uri" xlink:href="https://www.jeremykun.com/2024/05/04/fhe-overview/%3e%20">https://www.jeremykun.com/2024/05/04/fhe-overview/</ext-link>.</comment>
</mixed-citation>
</ref>
<ref id="B29">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>From challenges and pitfalls to recommendations and opportunities: implementing federated learning in healthcare</article-title>. <source>Med. Image Anal.</source> <volume>101</volume>, <fpage>103497</fpage>. <pub-id pub-id-type="doi">10.1016/j.media.2025.103497</pub-id>
<pub-id pub-id-type="pmid">39961211</pub-id>
</mixed-citation>
</ref>
<ref id="B30">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>The 1% gift to humanity: the human genome project II</article-title>. <source>Cell Res.</source> <volume>1-4</volume>. <pub-id pub-id-type="doi">10.1038/s41422-024-01026-y</pub-id>
<pub-id pub-id-type="pmid">39261573</pub-id>
</mixed-citation>
</ref>
<ref id="B31">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mammen</surname>
<given-names>P. M.</given-names>
</name>
</person-group> (<year>2021</year>).<article-title>Federated learning: opportunities and challenges</article-title>. <comment>arXiv preprint arXiv:2101.05428</comment>
</mixed-citation>
</ref>
<ref id="B32">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Marcolla</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Sucasas</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Manzano</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Bassoli</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Fitzek</surname>
<given-names>F. H. P.</given-names>
</name>
<name>
<surname>Aaraj</surname>
<given-names>N.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Survey on fully homomorphic encryption, theory, and applications</article-title>. <source>Proc. IEEE</source> <volume>110</volume>, <fpage>1572</fpage>&#x2013;<lpage>1609</lpage>. <pub-id pub-id-type="doi">10.1109/jproc.2022.3205665</pub-id>
</mixed-citation>
</ref>
<ref id="B33">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Micheli</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Public bodies&#x2019; access to private sector data: the perspectives of twelve European local administrations</article-title>. <source>First Monday</source>. <pub-id pub-id-type="doi">10.5210/fm.v27i2.11720</pub-id>
</mixed-citation>
</ref>
<ref id="B34">
<mixed-citation publication-type="web">
<collab>MyHeritage</collab> (<year>2018</year>). <article-title>Cybersecurity incident: june 10 update</article-title>. <comment>Available online at: <ext-link ext-link-type="uri" xlink:href="https://blog.myheritage.com/2018/06/cybersecurity-incident-june-10-update/%3e%20">https://blog.myheritage.com/2018/06/cybersecurity-incident-june-10-update/</ext-link>.</comment>
</mixed-citation>
</ref>
<ref id="B35">
<mixed-citation publication-type="web">
<collab>NASA</collab> (<year>2025</year>). <article-title>NASA open-source science initiative</article-title>. <comment>Available online at: <ext-link ext-link-type="uri" xlink:href="https://nasa-impact.github.io/ossi-website/%3e%20">https://nasa-impact.github.io/ossi-website/</ext-link>.</comment>
</mixed-citation>
</ref>
<ref id="B36">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ness</surname>
<given-names>R. B.</given-names>
</name>
<name>
<surname>Committee</surname>
<given-names>J. P.</given-names>
</name>
</person-group> (<year>2007</year>). <article-title>Influence of the HIPAA privacy rule on health research</article-title>. <source>Jama</source> <volume>298</volume>, <fpage>2164</fpage>&#x2013;<lpage>2170</lpage>. <pub-id pub-id-type="doi">10.1001/jama.298.18.2164</pub-id>
<pub-id pub-id-type="pmid">18000200</pub-id>
</mixed-citation>
</ref>
<ref id="B37">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pati</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Baid</surname>
<given-names>U.</given-names>
</name>
<name>
<surname>Edwards</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Sheller</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>S. H.</given-names>
</name>
<name>
<surname>Reina</surname>
<given-names>G. A.</given-names>
</name>
<etal/>
</person-group> (<year>2022</year>). <article-title>Federated learning enables big data for rare cancer boundary detection</article-title>. <source>Nat. Communications</source> <volume>13</volume>, <fpage>7346</fpage>. <pub-id pub-id-type="doi">10.1038/s41467-022-33407-5</pub-id>
<pub-id pub-id-type="pmid">36470898</pub-id>
</mixed-citation>
</ref>
<ref id="B38">
<mixed-citation publication-type="web">
<collab>Personal Information Protection Law</collab> (<year>2021</year>). <article-title>Personal information protection law of the people&#x2019;s Republic of China</article-title>. <comment>Available online at: <ext-link ext-link-type="uri" xlink:href="https://personalinformationprotectionlaw.com/#:%7E:text=The%20PIPL%20came%20into%20effect,legal%20basis%20and%20disclosure%20requirements">https://personalinformationprotectionlaw.com/&#x23;:&#x223c;:text&#x3d;The%20PIPL%20came%20into%20effect,legal%20basis%20and%20disclosure%20requirements</ext-link>.</comment>
</mixed-citation>
</ref>
<ref id="B39">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pinto</surname>
<given-names>R. P.</given-names>
</name>
<name>
<surname>Silva</surname>
<given-names>B. M.</given-names>
</name>
<name>
<surname>Inacio</surname>
<given-names>P. R.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A system for the promotion of traceability and ownership of health data using blockchain</article-title>. <source>IEEE Access</source> <volume>10</volume>, <fpage>92760</fpage>&#x2013;<lpage>92773</lpage>. <pub-id pub-id-type="doi">10.1109/access.2022.3203193</pub-id>
</mixed-citation>
</ref>
<ref id="B41">
<mixed-citation publication-type="journal">
<collab>Regulation</collab> <article-title>Regulation (EU) 2016/679, Article 17 (right to erasure)</article-title>. (<year>2016</year>).</mixed-citation>
</ref>
<ref id="B42">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rieke</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Hancox</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Milletar&#xec;</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Roth</surname>
<given-names>H. R.</given-names>
</name>
<name>
<surname>Albarqouni</surname>
<given-names>S.</given-names>
</name>
<etal/>
</person-group> (<year>2020</year>). <article-title>The future of digital health with federated learning</article-title>. <source>NPJ Digital Medicine</source> <volume>3</volume>, <fpage>119</fpage>. <pub-id pub-id-type="doi">10.1038/s41746-020-00323-1</pub-id>
<pub-id pub-id-type="pmid">33015372</pub-id>
</mixed-citation>
</ref>
<ref id="B44">
<mixed-citation publication-type="book">
<person-group person-group-type="author">
<name>
<surname>Saad</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Khan</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Saeed</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>El Saddik</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Gueaieb</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>2023</year>). &#x201c;<source>IEEE international smart cities conference (ISC2)</source>,&#x201d;. <publisher-name>IEEE</publisher-name>, <fpage>1</fpage>&#x2013;<lpage>5</lpage>.</mixed-citation>
</ref>
<ref id="B45">
<mixed-citation publication-type="book">
<person-group person-group-type="author">
<name>
<surname>Sabt</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Achemlal</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Bouabdallah</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2015</year>). <source>IEEE trustcom/bigDataSE/ispa</source>. <publisher-name>IEEE</publisher-name>, <fpage>57</fpage>&#x2013;<lpage>64</lpage>.</mixed-citation>
</ref>
<ref id="B46">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sarmah</surname>
<given-names>S. S.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Understanding blockchain technology</article-title>. <source>Comput. Sci. Eng.</source> <volume>8</volume>, <fpage>23</fpage>&#x2013;<lpage>29</lpage>. <pub-id pub-id-type="doi">10.5923/j.computer.20180802.02</pub-id>
</mixed-citation>
</ref>
<ref id="B47">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Scheliga</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Friesike</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Putting open science into practice: a social dilemma?</article-title> <source>First Monday</source>. <pub-id pub-id-type="doi">10.5210/fm.v19i9.5381</pub-id>
</mixed-citation>
</ref>
<ref id="B48">
<mixed-citation publication-type="book">
<person-group person-group-type="author">
<name>
<surname>Shah</surname>
<given-names>S. T.</given-names>
</name>
<name>
<surname>Ali</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Waqar</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Kim</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2025</year>). <source>Healthcare</source>, <volume>2760</volume>. <publisher-name>MDPI</publisher-name>.</mixed-citation>
</ref>
<ref id="B49">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sun</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>F. R.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Xie</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Peng</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A survey on zero-knowledge proof in blockchain</article-title>. <source>IEEE Network</source> <volume>35</volume>, <fpage>198</fpage>&#x2013;<lpage>205</lpage>. <pub-id pub-id-type="doi">10.1109/mnet.011.2000473</pub-id>
</mixed-citation>
</ref>
<ref id="B50">
<mixed-citation publication-type="web">
<person-group person-group-type="author">
<name>
<surname>Tidy</surname>
<given-names>S. M. J.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>23andMe: profiles of 6.9 million people hacked</article-title>. <comment>Available online at: <ext-link ext-link-type="uri" xlink:href="https://www.bbc.com/news/technology-67624182%3e%20">https://www.bbc.com/news/technology-67624182</ext-link>.</comment>
</mixed-citation>
</ref>
<ref id="B51">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tran</surname>
<given-names>A.-T.</given-names>
</name>
<name>
<surname>Luong</surname>
<given-names>T.-D.</given-names>
</name>
<name>
<surname>Karnjana</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Huynh</surname>
<given-names>V.-N.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>An efficient approach for privacy preserving decentralized deep learning models based on secure multi-party computation</article-title>. <source>Neurocomputing</source> <volume>422</volume>, <fpage>245</fpage>&#x2013;<lpage>262</lpage>. <pub-id pub-id-type="doi">10.1016/j.neucom.2020.10.014</pub-id>
</mixed-citation>
</ref>
<ref id="B52">
<mixed-citation publication-type="web">
<collab>UNESCO</collab> (<year>2025</year>). <article-title>Open science: making science more accessible, inclusive and equitable for the benefit of all</article-title>. <comment>Available online at: <ext-link ext-link-type="uri" xlink:href="https://www.unesco.org/en/open-science%3e%20">https://www.unesco.org/en/open-science</ext-link>.</comment>
</mixed-citation>
</ref>
<ref id="B53">
<mixed-citation publication-type="book">
<person-group person-group-type="author">
<name>
<surname>Voigt</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Von dem Bussche, A. The EU general data protection regulation (gdpr)</article-title>,&#x201d; in <source>A practical guide, 1st Ed., Cham</source>. <edition>10</edition>. <publisher-name>Springer International Publishing</publisher-name>, <fpage>10</fpage>&#x2013;<lpage>5555</lpage>.</mixed-citation>
</ref>
<ref id="B54">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Weber</surname>
<given-names>G. M.</given-names>
</name>
<name>
<surname>Murphy</surname>
<given-names>S. N.</given-names>
</name>
<name>
<surname>McMurry</surname>
<given-names>A. J.</given-names>
</name>
<name>
<surname>Macfadden</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Nigrin</surname>
<given-names>D. J.</given-names>
</name>
<name>
<surname>Churchill</surname>
<given-names>S.</given-names>
</name>
<etal/>
</person-group> (<year>2009</year>). <article-title>The shared health research information network (SHRINE): a prototype federated query tool for clinical data repositories</article-title>. <source>J. Am. Med. Inf. Assoc.</source> <volume>16</volume>, <fpage>624</fpage>&#x2013;<lpage>630</lpage>. <pub-id pub-id-type="doi">10.1197/jamia.M3191</pub-id>
<pub-id pub-id-type="pmid">19567788</pub-id>
</mixed-citation>
</ref>
<ref id="B56">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yang</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>J.</given-names>
</name>
<etal/>
</person-group> (<year>2022</year>). <article-title>TrustGWAS: a full-process workflow for encrypted GWAS using multi-key homomorphic encryption and pseudorandom number perturbation</article-title>. <source>Cell Syst.</source> <volume>13</volume>, <fpage>752</fpage>&#x2013;<lpage>767</lpage>. <pub-id pub-id-type="doi">10.1016/j.cels.2022.08.001</pub-id>
<pub-id pub-id-type="pmid">36041458</pub-id>
</mixed-citation>
</ref>
<ref id="B57">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zastrow</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Open science takes on the coronavirus pandemic</article-title>. <source>Nature</source> <volume>581</volume>, <fpage>109</fpage>&#x2013;<lpage>111</lpage>. <pub-id pub-id-type="doi">10.1038/d41586-020-01246-3</pub-id>
<pub-id pub-id-type="pmid">32332909</pub-id>
</mixed-citation>
</ref>
<ref id="B58">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>White</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Schmidt</surname>
<given-names>D. C.</given-names>
</name>
<name>
<surname>Lenz</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Rosenbloom</surname>
<given-names>S. T.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>FHIRChain: applying blockchain to securely and scalably share clinical data</article-title>. <source>Comput. Structural Biotechnology Journal</source> <volume>16</volume>, <fpage>267</fpage>&#x2013;<lpage>278</lpage>. <pub-id pub-id-type="doi">10.1016/j.csbj.2018.07.004</pub-id>
<pub-id pub-id-type="pmid">30108685</pub-id>
</mixed-citation>
</ref>
<ref id="B59">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Sok: fully homomorphic encryption accelerators</article-title>. <source>ACM Comput. Surv.</source> <volume>56</volume>, <fpage>1</fpage>&#x2013;<lpage>32</lpage>. <pub-id pub-id-type="doi">10.1145/3676955</pub-id>
</mixed-citation>
</ref>
<ref id="B60">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>C. Z.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>H.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). <article-title>Secure multi-party computation: theory, practice and applications</article-title>. <source>Inf. Sci.</source> <volume>476</volume>, <fpage>357</fpage>&#x2013;<lpage>372</lpage>. <pub-id pub-id-type="doi">10.1016/j.ins.2018.10.024</pub-id>
</mixed-citation>
</ref>
<ref id="B61">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhu</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Deep leakage from gradients</article-title>. <source>Adv. Neural Information Processing Systems</source> <volume>32</volume>. <comment>Available online at: <ext-link ext-link-type="uri" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://proceedings.neurips.cc/paper_files/paper/2019/file/60a6c4002cc7b29142def8871531281a-Paper.pdf">https://proceedings.neurips.cc/paper_files/paper/2019/file/60a6c4002cc7b29142def8871531281a-Paper.pdf</ext-link>
</comment>.</mixed-citation>
</ref>
</ref-list>
<sec id="s13">
<title>Glossary</title>
<def-list>
<def-item>
<term id="G1-fbloc.2025.1631217">
<bold>Blockchain</bold>
</term>
<def>
<p>A decentralized, distributed ledger technology that creates immutable records of data ownership, provenance, and usage</p>
</def>
</def-item>
<def-item>
<term id="G2-fbloc.2025.1631217">
<bold>Crypto-shredding</bold>
</term>
<def>
<p>The act of destroying decryption keys to comply with data erasure mandates</p>
</def>
</def-item>
<def-item>
<term id="G3-fbloc.2025.1631217">
<bold>Cryptographic open science (COS)</bold>
</term>
<def>
<p>A framework integrating blockchain, fully homomorphic encryption (FHE), and crypto tokens to enable secure, privacy-preserving, and incentivized biomedical data sharing</p>
</def>
</def-item>
<def-item>
<term id="G4-fbloc.2025.1631217">
<bold>Dataset tokens (dTokens)</bold>
</term>
<def>
<p>Individual fungible tokens created by fractionalizing a dataset NFT, allowing direct value capture and profit-sharing for data providers</p>
</def>
</def-item>
<def-item>
<term id="G5-fbloc.2025.1631217">
<bold>Decentralized autonomous organization (DAO)</bold>
</term>
<def>
<p>A community-driven organization where token holders manage curation, funding, and decision-making through decentralized governance</p>
</def>
</def-item>
<def-item>
<term id="G6-fbloc.2025.1631217">
<bold>DePIN</bold>
</term>
<def>
<p>Decentralized physical infrastructure devices (e.g., DNA sequencers) that perform encryption and blockchain recording at the point of data generation</p>
</def>
</def-item>
<def-item>
<term id="G7-fbloc.2025.1631217">
<bold>Differential privacy (DP)</bold>
</term>
<def>
<p>A method of limiting information leakage by injecting calibrated noise into released statistics or model updates</p>
</def>
</def-item>
<def-item>
<term id="G8-fbloc.2025.1631217">
<bold>Federated learning (FL)</bold>
</term>
<def>
<p>A paradigm where a global model is trained across decentralized devices without exchanging the local data itself</p>
</def>
</def-item>
<def-item>
<term id="G9-fbloc.2025.1631217">
<bold>Fully homomorphic encryption (FHE)</bold>
</term>
<def>
<p>An encryption form that allows computations to be performed directly on ciphertexts without decryption, ensuring end-to-end data confidentiality</p>
</def>
</def-item>
<def-item>
<term id="G10-fbloc.2025.1631217">
<bold>Non-fungible token (NFT)</bold>
</term>
<def>
<p>A digital certificate of ownership and provenance used to represent unique datasets within a decentralized network</p>
</def>
</def-item>
<def-item>
<term id="G11-fbloc.2025.1631217">
<bold>OMICS token</bold>
</term>
<def>
<p>A platform-level utility token used for infrastructure payments, staking, governance, and ecosystem incentives</p>
</def>
</def-item>
<def-item>
<term id="G12-fbloc.2025.1631217">
<bold>Open science dilemma</bold>
</term>
<def>
<p>A situation where researchers hesitate to share data due to privacy concerns, intellectual property risks, and lack of recognition, prioritizing personal interest over the collective good</p>
</def>
</def-item>
<def-item>
<term id="G13-fbloc.2025.1631217">
<bold>Secure multi-party computation (SMPC)</bold>
</term>
<def>
<p>Cryptographic protocols that allow multiple parties to jointly compute a function while keeping their individual inputs private</p>
</def>
</def-item>
<def-item>
<term id="G14-fbloc.2025.1631217">
<bold>Smart contracts</bold>
</term>
<def>
<p>Self-executing agreements that automatically enforce predefined terms, such as data access controls and credit sharing</p>
</def>
</def-item>
<def-item>
<term id="G15-fbloc.2025.1631217">
<bold>Soul-bound token (SBT)</bold>
</term>
<def>
<p>A non-transferable digital token that binds data control to an immutable digital identity to establish verifiable ownership</p>
</def>
</def-item>
<def-item>
<term id="G16-fbloc.2025.1631217">
<bold>Trusted execution environments (TEE)</bold>
</term>
<def>
<p>Hardware-based secure areas within a processor that isolate sensitive computations and data from the rest of the system</p>
</def>
</def-item>
<def-item>
<term id="G17-fbloc.2025.1631217">
<bold>Zero knowledge proofs (ZKP)</bold>
</term>
<def>
<p>Protocols that allow one party to prove a statement is true without revealing any information beyond the validity of the statement itself</p>
</def>
</def-item>
</def-list>
</sec>
</back>
</article>