License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITCS.2017.6
URN: urn:nbn:de:0030-drops-82011
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/8201/
Go to the corresponding LIPIcs Volume Portal

Micali, Silvio

Very Simple and Efficient Byzantine Agreement

pdf-format:
LIPIcs-ITCS-2017-6.pdf (0.2 MB)

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.

BibTeX - Entry

@InProceedings{micali:LIPIcs:2017:8201,
  author =	{Silvio Micali},
  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 =	{Christos H. Papadimitriou},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/8201},
  URN =		{urn:nbn:de:0030-drops-82011},
  doi =		{10.4230/LIPIcs.ITCS.2017.6},
  annote =	{Keywords: Byzantine Agreement}
}

Keywords: Byzantine Agreement
Collection: 8th Innovations in Theoretical Computer Science Conference (ITCS 2017)
Issue Date: 2017
Date of publication: 28.11.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI