Two-Stage Secret Sharing

We give an information-theoretic formulation of two-stage secret sharing for situations in which secret information becomes available progressively. In the proposed model, shares for an initial part of the secret are distributed before the remaining part becomes available, and additional shares are distributed to new participants after the remaining part becomes available, without updating the shares already distributed and without using any additional information other than shares. To characterize this setting, we propose the notion of a two-stage access structure and provide its characterization. We further quantify the amount of information about the first-stage secret that the dealer must retain between the two distribution stages, derive a universal lower bound, and present a construction that achieves this bound for every two-stage access structure. We also position advance sharing as a special case of the proposed model and give its characterization and a related construction in classical information-theoretic secret sharing.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16146
Primary Topic
Cryptography and Data Security
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Two-Stage Secret Sharing

Mamoru Shibata, Mizuki Murata
arXiv (Cornell University)
Cryptography and Data Security
preprint

Two-Stage Secret Sharing

Mamoru Shibata, Mizuki Murata
preprint en

Abstract

We give an information-theoretic formulation of two-stage secret sharing for situations in which secret information becomes available progressively. In the proposed model, shares for an initial part of the secret are distributed before the remaining part becomes available, and additional shares are distributed to new participants after the remaining part becomes available, without updating the shares already distributed and without using any additional information other than shares. To characterize this setting, we propose the notion of a two-stage access structure and provide its characterization. We further quantify the amount of information about the first-stage secret that the dealer must retain between the two distribution stages, derive a universal lower bound, and present a construction that achieves this bound for every two-stage access structure. We also position advance sharing as a special case of the proposed model and give its characterization and a related construction in classical information-theoretic secret sharing.

arXiv (Cornell University)
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.

Laika access coming soon