首页/论文/2003.09120

arXiv 2003.091202020-03-20cs.CR

Multi-party Quantum Byzantine Agreement Without Entanglement

Xin Sun, Piotr Kulicki, Mirek Sopek

备注：: 6 pages, 1 figure
DOI：: 10.3390/e22101152

英文摘要：

In this paper we propose a protocol of quantum communication to achieve Byzantine agreement among multiple parties. The striking feature of our proposal in comparison to the existing protocols is that we do not use entanglement to achieve the agreement. There are two stages in our protocol. In the first stage, a list of numbers that satisfies some special properties is distributed to every participant by a group of semi-honest list distributors via quantum secure communication. Then, in the second stage those participants exchange some information to reach agreement.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

面向弹性 RPKI 的拜占庭安全依赖方

Byzantine-Secure Relying Party for Resilient RPKI

本文提出拜占庭安全的依赖方实现 BRP，通过冗余验证与投票共识提升 RPKI 的弹性和安全性，无需修改现有路由器与仓库即可透明部署。

2024-05-01cs.CR

打破$O(\sqrt n)$比特壁垒：每方仅需Polylog比特的Byzantine Agreement

Breaking the $O(\sqrt n)$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party

研究Byzantine Agreement中通信不对称性是否必然，提出SRDS原语构建首个$\tilde O(1)$平衡通信协议，打破$O(\sqrt n)$壁垒并回答开放问题。

2023-10-20cs.CRcs.DC

用量子解决方案打破拜占庭共识的容错界限与安全漏洞

Beating the fault-tolerance bound and security loopholes for Byzantine agreement with a quantum solution

针对经典拜占庭共识的1/3容错界限与密码学安全漏洞，提出基于量子数字签名的无条件安全框架，实现近1/2容错率，实验验证三方与五方共识，展现量子优势。

2023-11-22cs.CRquant-ph

Quantum Byzantine Agreement via Hardy correlations and entanglement swapping

We present a device-independent quantum scheme for the {\em Byzantine Generals} problem. The protocol is for three parties. Party $C$ is to send two identical one bit messages to parties $A$ and $B$. The receivers $A$ and $B$ may exchange two one bit messages informing the other party on the message received from $C$. A bit flipping error in one of the transmissions, does not allow the receiving parties to establish what was the message of $C$. Our quantum scheme has the feature that if the messages of the Byzantine protocol are readable (that is give an unambiguous bit value for any of the re…

2014-08-07cs.CRcs.DCcs.IT

Giskard: 大规模去中心化学习中的拜占庭鲁棒与机密聚合

Giskard : Byzantine Robust and Confidential Aggregation for Large-Scale Decentralized Learning

INSA Lyon, LIRIS, CNRS（里尔斯大学 Lyon，LIRIS，CNRS）；INRIA, INSA Lyon（法国国家科学研究中心 INRIA，里尔斯大学 Lyon）

针对去中心化学习中同时保证机密性和抵御拜占庭行为的挑战，提出Giskard协议，通过树状委员会结构和BGW风格MPC实现近似中位数聚合，在百万级参与者下降低通信复杂度并保持模型效用。

2026-06-18cs.CRcs.LG

重排序攻击下拜占庭协议的可扩展组合

Scalable Composition of Byzantine Agreements under Reorder Attacks

Tsinghua University（清华大学）；Beijing Academy of Blockchain and Edge Computing（北京区块链与边缘计算研究院）

本文提出首个结合参与方腐败与信道攻击的敌手模型，确立拜占庭协议在并行与并发组合下的紧致安全阈值，并设计通用及基于纠删码的编译器，在满足条件时实现安全且通信高效的可扩展组合。

2026-09-10cs.CRcs.DS

更多相关论文收起更多论文

拜占庭鲁棒联邦学习：聚焦于开发基于Sybil的攻击以针对后门增强的安全聚合协议的综述

Byzantine-Robust Federated Learning: An Overview With Focus on Developing Sybil-based Attacks to Backdoor Augmented Secure Aggregation Protocols

本文综述拜占庭鲁棒联邦学习的现有方法并分类，深入分析RoFL协议的优缺点，提出两种利用其漏洞的新型Sybil攻击，给出攻击实现细节与未来测试及框架改进方向。

2024-10-30cs.CRcs.LG

Cloak: Transitioning States on Legacy Blockchains Using Secure and Publicly Verifiable Off-Chain Multi-Party Computation

In recent years, the confidentiality of smart contracts has become a fundamental requirement for practical applications. While many efforts have been made to develop architectural capabilities for enforcing confidential smart contracts, a few works arise to extend confidential smart contracts to Multi-Party Computation (MPC), i.e., multiple parties jointly evaluate a transaction off-chain and commit the outputs on-chain without revealing their secret inputs/outputs to each other. However, existing solutions lack public verifiability and require O(n) transactions to enable negotiation or resist…

2023-02-10cs.CR

sAVSS: Scalable Asynchronous Verifiable Secret Sharing in BFT Protocols

This paper introduces a new way to incorporate verifiable secret sharing (VSS) schemes into Byzantine Fault Tolerance (BFT) protocols. This technique extends the threshold guarantee of classical Byzantine Fault Tolerant algorithms to include privacy as well. This provides applications with a powerful primitive: a threshold trusted third party, which simplifies many difficult problems such as a fair exchange. In order to incorporate VSS into BFT, we introduced sAVSS, a framework that transforms any VSS scheme into an asynchronous VSS scheme with constant overhead. By incorporating Kate et al.'s…

2018-12-21cs.CR

LoByITFL：低通信量的安全隐私联邦学习

LoByITFL: Low Communication Secure and Private Federated Learning

School of Computation, Information and Technology（计算、信息与技术学院）

针对联邦学习中数据隐私与拜占庭安全难兼顾且现有方案牺牲隐私的问题，提出通信高效的LoByITFL方案，借助小型数据集、改进FLTrust和初始化阶段一次性可信第三方，实现信息论隐私与安全，兼具理论保证与收敛性实验验证。

2025-06-12cs.CRcs.DCcs.IT

DECLOAK：通过最小可信TEE网络在传统区块链上实现安全且廉价的多方交易

DECLOAK: Enable Secure and Cheap Multi-Party Transactions on Legacy Blockchains by a Minimally Trusted TEE Network

本文提出支持多方交易的链下合约执行框架DECLOAK，利用最小可信TEE网络在更弱假设下首次实现MPT数据可用性，解决现有方案缺乏公平性与原子性等问题，并将SOTA方案的gas成本降低65.6%。

2023-05-22cs.CR

Juggernaut：高效的密码学无关拜占庭协议

Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement

研究密码学无关拜占庭协议，提出编译器将认证与信息论设置下的协议转换为在密码学被攻破时仍具回退安全性的协议，改进了比特复杂度并保持认证设置下的效率。

2024-10-15cs.CRcs.DC

Secure Anonymous Broadcast

In anonymous broadcast, one or more parties want to anonymously send messages to all parties. This problem is increasingly important as a black-box in many privacy-preserving applications such as anonymous communication, distributed auctions, and multi-party computation. In this paper, we design decentralized protocols for anonymous broadcast that require each party to send (and compute) a polylogarithmic number of bits (and operations) per anonymous bit delivered with $O(\log n)$ rounds of communication. Our protocol is provably secure against traffic analysis, does not require any trusted pa…

2014-05-21cs.CRcs.DC

无需长期量子存储器与全局纠缠的密码学：面向一次性程序、复制保护和有状态混淆的经典设置

Cryptography without Long-Term Quantum Memory and Global Entanglement: Classical Setups for One-Time Programs, Copy Protection, and Stateful Obfuscation

本文利用仅支持经典查询的预言机与半量子令牌，在无长期量子存储器和全局纠缠条件下构造半量子 OTP、RAM 混淆，并进一步实现长命一次性程序与复制保护。

2025-05-13cs.CRquant-ph

Secure Multi-Party Quantum Conference and Xor Computation

Quantum conference is a process of securely exchanging messages between three or more parties, using quantum resources. A Measurement Device Independent Quantum Dialogue (MDI-QD) protocol, which is secure against information leakage, has been proposed (Quantum Information Processing 16.12 (2017): 305) in 2017, is proven to be insecure against intercept-and-resend attack strategy. We first modify this protocol and generalize this MDI-QD to a three-party quantum conference and then to a multi-party quantum conference. We also propose a protocol for quantum multi-party XOR computation. None of th…

2021-01-14cs.CRquant-ph

Fides: Managing Data on Untrusted Infrastructure

Significant amounts of data are currently being stored and managed on third-party servers. It is impractical for many small scale enterprises to own their private datacenters, hence renting third-party servers is a viable solution for such businesses. But the increasing number of malicious attacks, both internal and external, as well as buggy software on third-party servers is causing clients to lose their trust in these external infrastructures. While small enterprises cannot avoid using external infrastructures, they need the right set of protocols to manage their data on untrusted infrastru…

2020-01-20cs.CRcs.DB

Vantage：适用于无签名BFT的可用性分级广播协议

Vantage: Availability-Graded Broadcast for Signature-Free BFT

IOTA Foundation（IOTA基金会）

该研究提出仅用认证通道和抗碰撞哈希的无签名BFT协议Vantage，通过可用性分级广播优化，在100节点十区域WAN模拟中实现23.9万TPS且中位延迟低于500ms，性能优于同类协议。

2026-08-18cs.CRcs.DC

并发异步拜占庭协议在期望常数轮中的再探讨

Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited

本文提出首个异步环境下最优容错的信息论多值OCC协议，并修复异步BA并行组合的缺陷，提供可组合性证明。

2023-12-22cs.CRcs.DC