Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.34279

Decentralized Medical Data Sharing with Off-chain Storage and View-based Access Control

Hajin Jeon·Hyung-Jin Yoon·Jemin Lee·Min-Soo Kim
View original source ↗Read source document ↗Export metadata ↓

Abstract

Recently, many blockchain-based medical data sharing systems using off-chain storage have been proposed. However, these systems have some drawbacks such as being incompletely decentralized, low adaptability to cloud storages, high cost, and low security. It is non-trivial to address the drawbacks due to the transparency, immutability, and decentralization of a blockchain platform. Our goal is to design a decentralized medical data sharing system with off-chain storage that addresses all the above drawbacks while satisfying data protection and privacy laws. We propose the VASCO (View-based AccesS COntrol) system that does not rely on any central server including a key generation one, not rely on any special cloud storage including IPFS, not use a secure channel, encrypts both data and metadata, and supports end-to-end encryption. We achieve it by designing eight chaincodes rigorously based on view-based access control. For a medical data ecosystem that consists of many stakeholders who employ different data standards, storage formats, and transmission protocols, we present how typical flows of medical data in the ecosystem can be achieved by using the proposed chaincodes with interoperability. We showed that VASCO is superior to the existing systems in terms of both functionality and regulatory compliance. We also tested the scalability of VASCO using a blockchain of 21 peer nodes with different specifications and verified interoperability through 30 combinations of standards, formats, and protocols. VASCO is a promising medical data sharing system that can provide secure and efficient sharing of medical data while preserving patient privacy and satisfying regulatory compliance with interoperability. The result of this study provides a potential to improve patient outcomes and advance medical research for the medical data ecosystem.

Explore related subjects

cs.DBcs.CR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hajin Jeon, Hyung-Jin Yoon, Jemin Lee, Min-Soo Kim. 2026-10-25. Decentralized Medical Data Sharing with Off-chain Storage and View-based Access Control. https://arxiv.org/abs/2610.34279

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

VIREL: Route-Local Lattice Residual Compression for Exact and Error-Bounded Floating-Point Time Series

Time-series databases store floating-point columns in independent pages that are written at ingest, rewritten at compaction, and decoded on every scan. Some columns must return the stored IEEE 754 word; others accept a pointwise bound $\varepsilon$. Codecs for both contracts turn each value into an integer on a lattice, but a real page mixes decimal resolutions. Keeping one scale per block charges every coarse step for the finest value: one scale-6 reading in a 1,024-value page cuts Falcon's compression ratio by 36%. We present VIREL, route-local lattice residual compression. A value enters a lattice only after the encoder has replayed the decoder's arithmetic on it. VIREL-Exact replays the decoder's division at each value's least decimal scale, which we prove always succeeds below $2^{51}$, gives every resolution its own lane and history, and places averages on a rational lattice; the same finer value costs it 0.6%. VIREL-EB replays a fused multiply-add on an error lattice, so every admitted value decodes within $\varepsilon$. One integer coder serves both contracts. On 14 canonical streams, VIREL-Exact emits 27.6% fewer bytes than Falcon. Fast beats ALP on ratio and both speeds at once: 7.01$\times$ against 4.19$\times$, 476 against 120 MB/s, and 5.0 against 4.5 GB/s on one core. Upper is the smallest output on all 48 larger streams. Ingest with Fast and compaction with Upper store those streams in Apache TsFile at 48.7% of ALP's bytes. VIREL-EB beats Machete on ratio and both speeds in all 90 dataset-bound cells.

cs.DB↗
arXiv2026

A curated global dataset of open science initiatives and policies

Inventories of open science initiatives differ in scope, geographic coverage and classification, making it difficult to compare infrastructures, services, networks and policies. We developed COSMI Hub within the OPENIT project to bring these sources together in a curated dataset. The release archived on 8 October 2026 contains 1,186 records and 71 variables covering initiative identity, source provenance, geography, record level, operational status, thematic activities, governance, funding and external identifiers. We identified candidates through structured directories, policy documents, official websites and suggestions from the open science community, then checked identities, reconciled duplicates and assessed supporting evidence. The dataset distinguishes standalone initiatives, services, deployments, umbrella organisations and policy instruments. Records can be assigned several thematic dimensions, with uncertainty retained where evidence is incomplete. We describe the collection and coding methods, the data structure and file-level checks, together with considerations for reuse. The Zenodo release is fixed, whereas the companion dashboard is updated separately. Because we assembled the collection purposively, it cannot be used to estimate the worldwide number of open science initiatives.

cs.DB↗
arXiv2026

ACTIVE: A Dynamic Pareto-Frontier-Based Unified Index for Dual-Vector Query

Existing approximate nearest neighbor search (ANNS) methods generally assume that each entity has a single vector. In many real-world applications, however, an entity is associated with more than one vector, and queries may jointly consider two attributes. With different queries assigning different weights to each attribute, Pareto-frontier-based indices provide an effective solution for dual-vector retrieval by connecting to approximate nearest neighbors under all possible query preferences. However, existing Pareto-frontier-based approaches suffer from substantial inefficiencies in both index construction and dynamic updates, limiting their practical applicability. To address these issues, we propose ACTIVE, a dynamic Pareto-frontier-based DVQ index that supports efficient construction and updates while maintaining high retrieval performance under varying query preferences. It employs angle-constrained active-range computation and connectivity-loss-driven adaptive repair strategies to accelerate node insertion and deletion, respectively. Extensive experiments show that, at comparable (or slightly below) search accuracy, ACTIVE improves insertion throughput by $1.20$--$1.43\times$ over DEG, and deletion throughput by $1.64$--$2.06\times$ over neighbor-reconnection-based repair and by $22.64$--$39.51\times$ over reinsertion-based repair.

cs.DB↗