发表机构
Centre for Development of Advanced Computing（高级计算发展中心）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文研究无状态恢复对拜占庭法定人数安全性的影响，提出证书重叠的紧正规形式，并证明在特定参数下冲突强制精确的拜占庭副本数，且持久投票记录可防止冲突。
AI 中文摘要
拜占庭法定人数安全性依赖于正确的副本拒绝签署冲突的值。在恢复过程中丢失协议状态但保留其身份和签名密钥的副本，可能会忘记之前的投票。我们研究由至少n个副本中的q个匹配的签名投票形成的证书，假设每个正确的副本在恢复之间避免冲突投票。如果形成两个冲突的证书，它们的重叠大小在2q-n和b+c之间，其中b计拜占庭副本数，c计在所考虑的执行期间恢复的正确身份数。我们的主要结果将松弛量b+c-(2q-n)分解为四个非负计数：第一个证书中的额外签名者，第二个证书中的额外签名者，两个证书中都不包含的身份，以及它们重叠之外的拜占庭或恢复中的身份。零松弛强制精确的签名者划分。对于n=3f+1个副本，阈值q=2f+1，最多f个拜占庭副本，且恰好一个正确的恢复事件，任何冲突对强制恰好f个拜占庭副本，所有这些副本与恢复的副本一起在重叠中；每个证书有一个由f个正确副本组成的不相交侧。一个最小协议达到此形式。我们区分证书形成与接受，给出使用配置的故障和恢复上限的充分检查，并解释为什么在签名释放之前写入的持久投票记录能防止冲突。
英文摘要
Byzantine quorum safety relies on correct replicas refusing to sign conflicting values. A replica that loses its protocol state during recovery but retains its identity and signing key may forget an earlier vote. We study certificates formed by matching signed votes from at least $q$ of $n$ replicas, assuming that each correct replica avoids conflicting votes between recoveries. If two conflicting certificates form, their overlap has size between $2q-n$ and $b+c$, where $b$ counts Byzantine replicas and $c$ counts correct identities that recovered during the execution considered. Our main result decomposes the slack $b+c-(2q-n)$ into four nonnegative counts: extra signers in the first certificate, extra signers in the second, identities in neither certificate, and Byzantine or recovering identities outside their overlap. Zero slack forces an exact signer partition. With $n=3f+1$ replicas, threshold $q=2f+1$, at most $f$ Byzantine replicas, and exactly one correct recovery event, any conflicting pair forces exactly $f$ Byzantine replicas, all in the overlap together with the recovered replica; each certificate has a disjoint side of $f$ correct replicas. A minimal protocol attains this form. We distinguish certificate formation from acceptance, give a sufficient check using configured fault and recovery caps, and explain why durable vote records written before signature release prevent the conflict.
CommentsTo be appeared at ICDCN 2027 as a Short Paper
