An O(lg n) expected rounds randomized Byzantine generals protocol
An O(lg n) expected rounds randomized Byzantine generals protocol
复制标题
O(lg n) 预期回合随机拜占庭将军协议
DOI：
10.1145/22145.22180
复制
发表时间：
1985
期刊：
影响因子：
--
通讯作者：
Gabriel Bracha
中科院分区：
文献类型：
--
作者：
Gabriel Bracha
拜占庭通用协议使进程能够在出现故障进程的情况下可靠地广播消息。这些协议在由<；italic&>n<；/italic&>进程组成的系统中运行，其中<；italic&>t；t<；/italic&>；进程有故障。协议在消息交换的同步轮次中进行。我们证明了，在不使用密码学的情况下，对于<；italic>；t<；/italic>；=<；italic>；n<；/italic>；/(3+<；italic>；δ<；/italic>；)，存在具有<；italic>；&Ogr；<；/italic>；(<；italic>；lg n<；/italic>；)预期轮数的随机化协议。如果我们允许加密方法，那么对于<；italic>；n<；/italic>；=/italic>；/(2+lt；italic&>；δ<；/italic>；)，将有一个随机化协议。这是对Det…所需的<；italic&>t<；/italic&>+1轮下限的改进…<；italic>；t<；/italic>；/<；italic>；lg n<；/italic>；之前的结果预期随机方案的nu轮。
Byzantine Generals protocols enable processes to reliably broadcast messages in the presence of faulty processes. These protocols are run in a system of consists of <italic>n</italic> processes, <italic>t</italic> of which are faulty. The protocols are conducted in synchronous rounds of message exchange. We show that, without using cryptography, for <italic>t</italic> = <italic>n</italic>/(3 + <italic>δ</italic>), there is a randomized protocol with <italic>&Ogr;</italic>(<italic>lg n</italic>) expected number of rounds. If we allow cryptographic methods, then, for <italic>t</italic> = <italic>n</italic> / (2 + <italic>δ</italic>), there is a randomized protocol with &Ogr;(<italic>lg n</italic>) expected number of rounds. This is an improvement on the lower bound of <italic>t</italic> + 1 rounds required for det … … previous result of <italic>t</italic>/<italic>lg n</italic> expected nu rounds for randomized protocols.
影响因子：
22.7
作者：
SHAMIR, A
通讯作者：
SHAMIR, A