跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.16146 · v1

Two-Stage Secret Sharing

首次提交 2026-11-12 09:10
版本更新 2026-11-12 09:10
雷达观测 2026-11-13 14:16
arXiv ↗PDF ↗

摘要

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.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-12 09:10 · 最新观测版本

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.

查看此版本解读 →查看此版本原文 ↗