On expected constant-round protocols for Byzantine agreement

作者：

Highlights：

•

摘要

In a seminal paper, Feldman and Micali show an n-party Byzantine agreement protocol in the plain model that tolerates t

论文关键词：Distributed computing,Broadcast,Cryptography,Secure computation

论文评审过程：Received 24 April 2007, Revised 28 July 2008, Available online 8 August 2008.

论文官网地址：https://doi.org/10.1016/j.jcss.2008.08.001