Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected $$O(n^2)$$ Communication, and Optimal Resilience
| العنوان: | Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected $$O(n^2)$$ Communication, and Optimal Resilience |
|---|---|
| المؤلفون: | Ittai Abraham, Danny Dolev, Srinivas Devadas, Ling Ren, Kartik Nayak |
| المصدر: | Financial Cryptography and Data Security ISBN: 9783030321000 Financial Cryptography |
| بيانات النشر: | Springer International Publishing, 2019. |
| سنة النشر: | 2019 |
| مصطلحات موضوعية: | TheoryofComputation_MISCELLANEOUS, 050101 languages & linguistics, Theoretical computer science, Computer science, Round complexity, 05 social sciences, TheoryofComputation_GENERAL, 02 engineering and technology, Adversary, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, 0501 psychology and cognitive sciences, Resilience (network), Communication complexity, Byzantine architecture |
| الوصف: | We present new protocols for Byzantine agreement in the synchronous and authenticated setting, tolerating the optimal number of f faults among \(n=2f+1\) parties. Our protocols achieve an expected O(1) round complexity and an expected \(O(n^2)\) communication complexity. The exact round complexity in expectation is 10 for a static adversary and 16 for a strongly rushing adaptive adversary. For comparison, previous protocols in the same setting require expected 29 rounds. |
| ردمك: | 978-3-030-32100-0 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::6bd300e3f47aed9b38036dd8b39d0323 https://doi.org/10.1007/978-3-030-32101-7_20 |
| حقوق: | CLOSED |
| رقم الأكسشن: | edsair.doi...........6bd300e3f47aed9b38036dd8b39d0323 |
| قاعدة البيانات: | OpenAIRE |
| ردمك: | 9783030321000 |
|---|