为异构机器人集群设计可审计的权限变更协议,关键操作需外部授权。
Governed Caste Reassignment in Heterogeneous Swarms: An Asymmetric-Trust Protocol with Audited Operator Countersignature
- 采用非对称信任机制:降权自动执行,升权需操作员签名确认
- 100台机器人测试中,降权响应在毫秒级,有效抵御四类攻击
- 支持分布式审计,防篡改且能检测恶意节点行为
在异构机器人集群中,因电量、载荷和优先级变化导致的类别重分配(将机器人重新绑定到新功能角色)是高频运行时事件。现有方法将其视为内部调度,未向外部权威暴露。我们认为,在受监管的实体部署中,提升机器人权限的重分配属于必须可审计、需外部授权的治理事件。为此提出一种非对称信任协议:自动收紧(降权至更安全角色)无需审批,而有限放宽(升权)需操作员在各维度预算内签字确认。每次变更携带签名因果链,提交至哈希链式梅尔克审计日志,离线审计员仅凭操作员签名的身份清单即可验证。实测使用真实Ed25519签名,支持最多100个机器人:自动收紧耗时单数至十数毫秒,该协议从构造上拒绝了四类攻击(类别洗白、重复放宽升级、操作员冒用、因果链伪造),部分受控基线揭示了各防护门拦截的具体攻击类型,随机模糊测试未发现越界准入。分布式审计层通过N个成员副本实现日志复制,采用多数派提交与密码学分叉排除机制;我们证明了共识一致性与分叉排除性,并在仿真及基于TCP套接字的真实多进程部署(最多100个进程,含拜占庭等价节点)中验证,所有诚实副本均达成一致,检测到等价行为,且未产生分叉。该方案将单智能体身份变更治理扩展至集群级类别治理。
原文摘要 · Abstract (English)
In heterogeneous robot swarms, caste reassignment (rebinding a robot to a new capability-bound role) is a high-frequency runtime event driven by battery, payload, and priority changes. Existing approaches treat it as an internal allocation algorithm and do not expose the reassignment to external authority. We argue that for regulated embodied deployments a caste change that elevates a robot's privilege envelope is a governance event that must be auditable and externally authorised. We propose an asymmetric-trust protocol: auto-tightening reassignments (to safer, lower-privilege castes) are admitted automatically, while bounded relaxation (to higher-privilege castes) requires an operator countersignature against a per-axis budget. Each transition carries a signed cause-chain, committed to a hash-chained Merkle audit log that an offline auditor verifies from an operator-signed identity manifest alone. We evaluate a reference implementation with real Ed25519 signatures over fleets up to 100 robots: auto-tightening completes in single-digit to low-double-digit milliseconds, and the governed protocol refuses four explicit attacks (caste laundering, repeated-relaxation escalation, operator impersonation, cause-chain forgery) by construction, with a partially-governed baseline isolating which gate stops which attack and a randomized fuzz adversary finding no admission. A distributed audit layer replicates the log across N per-member replicas with quorum-committed total order and cryptographic fork exclusion; we prove agreement and fork exclusion and validate them both in simulation and as a real multi-process deployment over TCP sockets (up to 100 real processes) with a Byzantine equivocator, on which every honest replica agrees, detects the equivocation, and commits no fork. The construction generalises a single-agent persona-mutation governance gate to swarm-level caste governance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。