✦ LIBER ✦

On expected constant-round protocols for Byzantine agreement

✍ Scribed by Jonathan Katz; Chiu-Yuen Koo

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(log n) expected rounds randomized b

✍ Bracha, Gabriel 📂 Article 📅 1987 🏛 Association for Computing Machinery 🌐 English ⚖ 899 KB

Fully Polynomial Byzantine Agreement for

✍ Garay, Juan A.; Moses, Yoram 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 542 KB

An Optimal Probabilistic Protocol for Sy

✍ Feldman, Pesech; Micali, Silvio 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 768 KB

Asynchronous Byzantine Agreement Protoco

✍ Dongyao Ji; Dengguo Feng 📂 Article 📅 2006 🏛 SP Science Press 🌐 English ⚖ 234 KB

A constant rounds group key agreement pr

✍ Hua Zhang; Qiao-yan Wen; Jie Zhang; Wen-min Li 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

On the round complexity of Byzantine agr

✍ Michael Okun 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 316 KB