A Leakage-Resistant Digital Inheritance Distribution Scheme Based on Sparse-Matrix Secret Sharing

With digital assets increasingly comprising a significant portion of personal wealth, the secure management and transfer of digital legacies have emerged as a pressing concern. Secret sharing offers a solution to this problem. However, distributing shares containing the unique private key for digital assets poses significant risks of theft or tampering, potentially leading to the illegal appropriation of user assets. This paper presents a leakage-resistant digital inheritance distribution scheme based on sparse-matrix secret sharing. It employs an efficient thresholding scheme that uses sparse matrices, achieving near-linear complexity for share reconstruction via a random striped matrix. Reconstruction time is significantly reduced compared to traditional polynomial interpolation methods. To address the realistic scenario where an asset owner holds multiple independent digital accounts, we propose a multi-account blinding and aggregation mechanism. This mechanism allows the dealer to establish isolated group keys for each account in a single round of communication, while preventing adversaries from linking different accounts to the same owner. A key-derivation and encrypted-transmission mechanism is then designed based on the aggregated group keys. Group keys are established by consensus among heirs, from which each heir derives a unique session key. Authenticated encryption ensures the confidentiality, integrity, and identity-bound transmission of shares. Through security proofs and experimental performance evaluation, it is demonstrated that the proposed scheme satisfies adaptive security requirements with the hash function H modeled as a random oracle, while all other cryptographic primitives (PRF, AES-GCM, HMAC) are assumed to be secure under standard computational assumptions.

Institutions

Publication Details

Journal
Algorithms
Published
2026-05-19
DOI
https://doi.org/10.3390/a19050410
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Leakage-Resistant Digital Inheritance Distribution Scheme Based on Sparse-Matrix Secret Sharing

Algorithms
Cryptography and Data Security
article

A Leakage-Resistant Digital Inheritance Distribution Scheme Based on Sparse-Matrix Secret Sharing

article en

Abstract

With digital assets increasingly comprising a significant portion of personal wealth, the secure management and transfer of digital legacies have emerged as a pressing concern. Secret sharing offers a solution to this problem. However, distributing shares containing the unique private key for digital assets poses significant risks of theft or tampering, potentially leading to the illegal appropriation of user assets. This paper presents a leakage-resistant digital inheritance distribution scheme based on sparse-matrix secret sharing. It employs an efficient thresholding scheme that uses sparse matrices, achieving near-linear complexity for share reconstruction via a random striped matrix. Reconstruction time is significantly reduced compared to traditional polynomial interpolation methods. To address the realistic scenario where an asset owner holds multiple independent digital accounts, we propose a multi-account blinding and aggregation mechanism. This mechanism allows the dealer to establish isolated group keys for each account in a single round of communication, while preventing adversaries from linking different accounts to the same owner. A key-derivation and encrypted-transmission mechanism is then designed based on the aggregated group keys. Group keys are established by consensus among heirs, from which each heir derives a unique session key. Authenticated encryption ensures the confidentiality, integrity, and identity-bound transmission of shares. Through security proofs and experimental performance evaluation, it is demonstrated that the proposed scheme satisfies adaptive security requirements with the hash function H modeled as a random oracle, while all other cryptographic primitives (PRF, AES-GCM, HMAC) are assumed to be secure under standard computational assumptions.

AlgorithmsVol. 19(5)
Henan University of Technology (CN)
National Natural Science Foundation of China
Peace, Justice and strong institutions
Openalex Percentile: Top 3%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.