@article {15114,
	title = {On expected constant-round protocols for Byzantine agreement},
	journal = {Journal of Computer and System Sciences},
	volume = {75},
	year = {2009},
	month = {2009/02//},
	pages = {91 - 112},
	abstract = {In a seminal paper, Feldman and Micali show an n-party Byzantine agreement protocol in the plain model that tolerates t \&lt; n / 3 malicious parties and runs in expected constant rounds. Here, resolving a question that had been open since their work, we show an expected constant-round protocol for authenticated Byzantine agreement assuming honest majority (i.e., t \&lt; n / 2 ), and relying only on the existence of signature schemes and a public-key infrastructure. Combined with existing results, this gives the first expected constant-round protocol for secure computation with honest majority in a point-to-point network under the same assumptions. Our key technical tool {\textemdash} a new primitive we introduce called moderated VSS {\textemdash} also yields a simpler proof of the Feldman{\textendash}Micali result.In addition, we show a simple technique for sequential composition of Byzantine agreement protocols that do not achieve simultaneous termination, something that is inherent for protocols using o ( t ) rounds.
},
	keywords = {broadcast, cryptography, Distributed computing, secure computation},
	isbn = {0022-0000},
	doi = {10.1016/j.jcss.2008.08.001},
	url = {http://www.sciencedirect.com/science/article/pii/S0022000008000718},
	author = {Katz, Jonathan and Koo,Chiu-Yuen}
}
