关于「泄露会累积:主动刷新分片」,《数字资产灾难恢复与门限分片》给出的定量结论是什么?
结论:第五章说明泄露会累积:五取三二十年不刷新的泄露概率 0.208484,每年刷新降到 0.001551。
数据口径:书中所有秘密都是玩具整数,参数均为示意,全部计算由书中程序生成;本书是数学模型与演练清单,不连接也不描述任何真实服务器,生产环境的备份与密钥操作须人工放行,不构成个人化法律或理财建议。 第一章在每份每年丢失 0.05、泄露 0.02 的示意参数下,算出三份副本的年丢失概率 0.000125、泄露概率 0.058808,三取二分别为 0.007250 与 0.001184,五取二是两项都胜过三份副本的最小方案。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.001551, 0.208484
| no refresh: P(adversary holds k shares) after t years | ||||
| scheme | t=5 | t=10 | t=20 | t=30 |
| 2-of-3 | 0.025920 | 0.088145 | 0.258005 | 0.431962 |
| 3-of-5 | 0.007640 | 0.045645 | 0.208484 | 0.415186 |
| 4-of-7 | 0.002348 | 0.024471 | 0.171854 | 0.401322 |
| over 20 years with a refresh every R years | ||||
| scheme | never | R=5 | R=2 | R=1 |
| 2-of-3 | 0.258005 | 0.099717 | 0.044870 | 0.023416 |
| 3-of-5 | 0.208484 | 0.030212 | 0.005832 | 0.001551 |
| 4-of-7 | 0.171854 | 0.009360 | 0.000781 | 0.000107 |
| 3-of-5, 20 years: never / yearly refresh = 134.4 times |
查看完整验算程序
# Chapter 5. p52: leaks pile up over the years unless shares are renewed.
# Model: a patient adversary. Each share leaks to the adversary with
# probability p = 0.02 per year (illustrative) and stays leaked. With a
# refresh every R years, shares leaked in one epoch are useless in the
# next, so the adversary must collect k shares within a single epoch.
# Horizon 20 years; exact binomial arithmetic, no simulation.
import math
P, T = 0.02, 20
def tail(n, r, x):
terms = [math.comb(n, j) * r ** j * (1 - r) ** (n - j)
for j in range(x, n + 1)]
return math.fsum(terms)
def exposed(k, n, years):
return tail(n, 1 - (1 - P) ** years, k)
print("no refresh: P(adversary holds k shares) after t years")
print("scheme t=5 t=10 t=20 t=30")
for k, n in ((2, 3), (3, 5), (4, 7)):
print("%d-of-%d " % (k, n) + "".join("%11.6f" % exposed(k, n, t)
for t in (5, 10, 20, 30)))
print("over %d years with a refresh every R years" % T)
print("scheme never R=5 R=2 R=1")
for k, n in ((2, 3), (3, 5), (4, 7)):
row = [exposed(k, n, T)]
for r in (5, 2, 1):
epoch = exposed(k, n, r)
row.append(1 - (1 - epoch) ** (T // r))
print("%d-of-%d " % (k, n) + "".join("%11.6f" % v for v in row))
print("3-of-5, 20 years: never / yearly refresh = %.1f times"
% (exposed(3, 5, T) / (1 - (1 - exposed(3, 5, 1)) ** T)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《数字资产灾难恢复与密钥分片、沙米尔秘密共享门限与异地增量快照单点失联自救母典》第 5 章「泄露会累积:主动刷新分片」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-272 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026272,
author = {Fan, Yafu},
title = {Disaster Recovery for Digital Assets: Shamir Secret-Sharing Thresholds, Off-Site Incremental Snapshots and Self-Rescue from Single Points of Loss},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}