Matthias Fitzi, Nicolas Gisin, Ueli Maurer
We present a solution to an old and timely problem in distributed computing. Like Quantum Key Distribution (QKD), quantum channels make it possible to achieve taks classically impossible. However, unlike QKD, here the goal is not secrecy but agreement, and the adversary is not outside but inside the game, and the resources require qutrits.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
It is pointed out that two separated quantum channels and three classical authenticated channels are sufficient resources to achieve detectable broadcast.
Gao et al. [Phys. Rev. Lett. 101, 208901 (2008)] have described a possible intercept-resend attack for the quantum protocol for detectable Byzantine agreement in Phys. Rev. Lett. 100, 070504 (2008). Here we describe an extension of the protocol which defeats such attacks.
We demonstrate that the Byzantine Agreement Problem (BAP) in its weaker version with detectable broadcast, can be solved using continuous variables Gaussian states with Gaussian operations. The protocol uses genuine tripartite symmetric entanglement, but differs from protocols proposed for qutrits or qubits. Contrary to the quantum key distribution (QKD) which is possible with all Gaussian states, for the BAP entanglement is needed, but not all tripartite entangled symmetric states can be used to solve the problem.
We introduce a new quantum protocol for solving detectable Byzantine agreement (also called detectable broadcast) between three parties, and also for solving the detectable liar detection problem. The protocol is suggested by the properties of a four-qubit entangled state, and the classical part of the protocol is simpler than that of previous proposals. In addition, we present an experimental implementation of the protocol using four-photon entanglement.
Quantum mechanics provides several methods to generate and securely distribute private lists of numbers suitably correlated to solve the Three Byzantine Generals Problem. So far, these methods are based on three-qutrit singlet states, four-qubit entangled states, and three or two pairwise quantum key distribution channels. Here we show that the problem can be solved using a single qutrit. This scheme presents some advantages over previous schemes, and emphasizes the specific role of qutrits in basic quantum information processing.
We demonstrate that the Byzantine Agreement (detectable broadcast) is also solvable in the continuous-variable scenario with multipartite entangled Gaussian states and Gaussian operations (homodyne detection). Within this scheme we find that Byzantine Agreement requires a minimum amount of entanglement in the multipartite states used in order to achieve a solution. We discuss realistic implementations of the protocol, which consider the possibility of having inefficient homodyne detectors, not perfectly correlated outcomes, and noise in the preparation of the resource states. The proposed prot…
A Quantum Detectable Byzantine Agreement Protocol using only EPR pairs
本文提出一种仅使用EPR对（Ψ+对）的量子可检测拜占庭协议，避免了对GHZ态等复杂纠缠态的依赖，从而提升可扩展性，且无论参与者数量多少，协议总能在4轮内完成。
Implementing an information-theoretically secure Byzantine agreement with quantum signed message solution
本文提出基于量子签名消息方案的量子签名拜占庭协议，仅利用QKD共享密钥实现信息论安全，将容错阈值扩展至任意恶意节点数量，并显著降低通信复杂度。
Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet state
本文针对分布式计算中的拜占庭故障，提出一个参数依赖的量子辅助弱广播协议族，计算了失败概率上界并最小化量子资源需求，在NISQ设备上实验验证，突出了多量子比特纠缠态量子通信协议的工程部署意义。
Quantum Honest Byzantine Agreement as a Distributed Quantum Algorithm
本文提出量子诚实拜占庭协议将共识简化为一致性，并借鉴认知神经架构，引入反馈机制和量子神经元构建混合量子-经典机器学习网络。
We proposed a framework of quantum-enhanced logic-based blockchain, which improves the efficiency and power of quantum-secured blockchain. The efficiency is improved by using a new quantum honest-success Byzantine agreement protocol to replace the classical Byzantine agreement protocol, while the power is improved by incorporating quantum protection and quantum certificate into the syntax of transactions. Our quantum-secured logic-based blockchain can already be implemented by the current technology. The cryptocurrency created and transferred in our blockchain is called qulogicoin. Incorporati…
Quantum aided Byzantine agreement (QBA) is an important distributed quantum algorithm with unique features in comparison to classical deterministic and randomized algorithms, requiring only a constant expected number of rounds in addition to giving higher level of security. In this paper, we analyze details of the high level multi-party algorithm, and propose elements of the design for the quantum architecture and circuits required at each node to run the algorithm on a quantum repeater network. Our optimization techniques have reduced the quantum circuit depth by 44\% and the number of qubits…
Experimental Quantum Byzantine Agreement on a Three-User Quantum Network with Integrated Photonics
该研究在集成光子学三用户量子网络上，利用超亮量子光源和精简分析模块，首次实验实现了源无关量子数字签名，并突破1/3容错界限实现无条件安全的量子拜占庭协议。
Beating the fault-tolerance bound and security loopholes for Byzantine agreement with a quantum solution
针对经典拜占庭共识的1/3容错界限与密码学安全漏洞，提出基于量子数字签名的无条件安全框架，实现近1/2容错率，实验验证三方与五方共识，展现量子优势。
Scalable and Highly Fault-Tolerant Circular Quantum Byzantine Agreement
针对现有量子拜占庭协议通信复杂度高或依赖复杂纠缠的问题，提出一种基于循环消息收集和量子数字签名的半去中心化协议，实现二次通信复杂度并增强容错性，实验可行且兼容现有星型量子网络。
Quantum Byzantine Agreement Against Full-information Adversary
本文提出从经典私有信道拜占庭协议到量子全信息模型的归约方法，在保持弹性、轮复杂度和通信复杂度的同时，将异步拜占庭协议的轮复杂度从经典下界 Ω(n) 降至 O(1)，展示了量子协议应对全信息敌手的优势。
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…
\textit{In Silico} Benchmarking of Detectable Byzantine Agreement in Noisy Quantum Networks
本研究利用EPR对实现可实验落地的量子可检测拜占庭协议，通过量子网络模拟器在真实噪声条件下开展系统模拟，明确了协议性能的关键阈值与最优运行区间，为量子共识协议的实际实现提供参考。
Quantum $X$-Secure $B$-Byzantine $T$-Colluding Private Information Retrieval
本文首次在量子私有信息检索中形式化定义拜占庭服务器的能力，证明其因量子编码而强于经典情形，并提出基于跨子空间对齐的方案，在某些情况下实现超密编码增益。
Quantum-Error-Mitigated Detectable Byzantine Agreement with Dynamical Decoupling for Distributed Quantum Computing
本研究针对分布式量子计算的对抗性共识难题，为QBA协议融合T-REx与DD错误缓解技术，结合NISQ设备与类QKD验证机制，经IBM量子设备测试验证了有效性，为NISQ时代量子共识系统提供了可行的加固方案。
Quantum key distribution (QKD) networks is expected to provide information-theoretical secured (ITS) communication over long distances. QKD networks based trusted relay architecture are now the most widely used scheme in practice. However, it is an unrealistic assumption that all relays are fully trustable in complex networks. In the past, only a few studies have theoretically analyzed the case of passive eavesdropping attack by dishonest relays and corresponding defense method. However, we have found that active attacks by dishonest relays can be more threatening. With the consideration of pa…
Byzantine-Eavesdropper Alliance: How to Achieve Symmetric Privacy in Quantum $X$-Secure $B$-Byzantine $E$-Eavesdropped $U$-Unresponsive $T$-Colluding PIR?
本文研究含无响应、合谋、拜占庭服务器及上下行动态窃听链路的量子对称PIR，刻画三类威胁模型并证明动态窃听者与拜占庭联盟带来更强威胁及部分超密集编码增益。
A method for solving the Byzantine agreement problem [M. Fitzi, N. Gisin, and U. Maurer, Phys. Rev. Lett. 87, 217901 (2001)] and the liar detection problem [A. Cabello, Phys. Rev. Lett. 89, 100402 (2002)] is introduced. The main advantages of this protocol are that it is simpler and is based on a four-qubit singlet state already prepared in the laboratory.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。