On expected constant-round protocols for Byzantine agreement
type: Item
instance of: scholarly article
title: On expected constant-round protocols for Byzantine agreement
zbMATH Open document ID: 1162.68431
author: Chiu-Yuen Koo
author: Jonathan Katz
published in: Journal of Computer and System Sciences
publication date: 2009-03-11T00:00:00Z
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 5527962
zbMATH Keywords: distributed computing
zbMATH Keywords: broadcast
zbMATH Keywords: cryptography
zbMATH Keywords: secure computation
MaRDI profile type: Publication
full work available at URL: j.jcss.2008.08.001
OpenAlex ID: W2044436778
cites work: Q4279686
cites work: Resilient-optimal interactive consistency in constant time
cites work: Byzantine agreement in the full-information model in O(log n) rounds
cites work: An O (log n ) expected rounds randomized byzantine generals protocol
cites work: Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
cites work: Q4228521
cites work: Q4250770
cites work: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
cites work: Authenticated Algorithms for Byzantine Agreement
cites work: Flipping Persuasively in Constant Time
cites work: An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
cites work: A lower bound for the time to assure interactive consistency
cites work: Efficient player-optimal protocols for strong and differential consensus
cites work: Theory of Cryptography
cites work: From partial consistency to global broadcast
cites work: Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
cites work: The round complexity of verifiable secret sharing and secure multicast
cites work: Foundations of Cryptography
cites work: Secure multi-party computation without agreement
cites work: Simultaneous broadcast revisited
cites work: Round-Efficient Secure Computation in Point-to-Point Networks
cites work: Improving the Round Complexity of VSS in Point-to-Point Networks
cites work: Information-theoretically secure protocols and security under composition
cites work: The Byzantine Generals Problem
cites work: On the composition of authenticated byzantine agreement
cites work: Sequential composition of protocols without simultaneous termination
cites work: Q4409132
cites work: Reaching Agreement in the Presence of Faults
cites work: How to share a secret
DOI: 10.1016/J.JCSS.2008.08.001
description: scientific article; zbMATH DE number 5527962