DROPS

Document

DOI: 10.4230/LIPIcs.ITCS.2017.6

Very Simple and Efficient Byzantine Agreement

Authors: Silvio Micali

Published in: LIPIcs, Volume 67, 8th Innovations in Theoretical Computer Science Conference (ITCS 2017)

Abstract

We present a very simple, cryptographic, binary Byzantine-agreement protocol that, with n >= 3t+1 >= 3 players, at most t of which are malicious, halts in expected 9 rounds.

Cite as

Silvio Micali. Very Simple and Efficient Byzantine Agreement. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 67, p. 6:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@InProceedings{micali:LIPIcs.ITCS.2017.6,
  author =	{Micali, Silvio},
  title =	{{Very Simple and Efficient Byzantine Agreement}},
  booktitle =	{8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
  pages =	{6:1--6:1},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-029-3},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{67},
  editor =	{Papadimitriou, Christos H.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.6},
  URN =		{urn:nbn:de:0030-drops-82011},
  doi =		{10.4230/LIPIcs.ITCS.2017.6},
  annote =	{Keywords: Byzantine Agreement}
}

Search Results

Documents authored by Micali, Silvio

Very Simple and Efficient Byzantine Agreement

Abstract

Cite as

Thanks for your feedback!

Could not send message