{"publisher":"Association for Computing Machinery","date_published":"2022-11-01T00:00:00Z","publication_identifier":{"isbn":["9781450394505"]},"type":"conference","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2201.05677","open_access":"1"}],"year":"2022","_id":"12229","publication_status":"published","page":"2705–2718","author":[{"first_name":"Alexander","full_name":"Spiegelman, Alexander","last_name":"Spiegelman"},{"first_name":"Neil","last_name":"Giridharan","full_name":"Giridharan, Neil"},{"full_name":"Sonnino, Alberto","last_name":"Sonnino","first_name":"Alberto"},{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios"}],"status":"public","abstract":[{"text":"We present Bullshark, the first directed acyclic graph (DAG) based asynchronous Byzantine Atomic Broadcast protocol that is optimized for the common synchronous case. Like previous DAG-based BFT protocols [19, 25], Bullshark requires no extra communication to achieve consensus on top of building the DAG. That is, parties can totally order the vertices of the DAG by interpreting their local view of the DAG edges. Unlike other asynchronous DAG-based protocols, Bullshark provides a practical low latency fast-path that exploits synchronous periods and deprecates the need for notoriously complex view-change and view-synchronization mechanisms. Bullshark achieves this while maintaining all the desired properties of its predecessor DAG-Rider [25]. Namely, it has optimal amortized communication complexity, it provides fairness and asynchronous liveness, and safety is guaranteed even under a quantum adversary.\r\n\r\nIn order to show the practicality and simplicity of our approach, we also introduce a standalone partially synchronous version of Bullshark, which we evaluate against the state of the art. The implemented protocol is embarrassingly simple (200 LOC on top of an existing DAG-based mempool implementation). It is highly efficient, achieving for example, 125,000 transactions per second with a 2 seconds latency for a deployment of 50 parties. In the same setting, the state of the art pays a steep 50% latency increase as it optimizes for asynchrony.","lang":"eng"}],"article_processing_charge":"No","day":"01","quality_controlled":"1","citation":{"mla":"Spiegelman, Alexander, et al. “Bullshark: DAG BFT Protocols Made Practical.” <i>Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security</i>, Association for Computing Machinery, 2022, pp. 2705–2718, doi:<a href=\"https://doi.org/10.1145/3548606.3559361\">10.1145/3548606.3559361</a>.","ista":"Spiegelman A, Giridharan N, Sonnino A, Kokoris Kogias E. 2022. Bullshark: DAG BFT protocols made practical. Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. CCS: CConference on Computer and Communications Security, 2705–2718.","chicago":"Spiegelman, Alexander, Neil Giridharan, Alberto Sonnino, and Eleftherios Kokoris Kogias. “Bullshark: DAG BFT Protocols Made Practical.” In <i>Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security</i>, 2705–2718. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3548606.3559361\">https://doi.org/10.1145/3548606.3559361</a>.","ama":"Spiegelman A, Giridharan N, Sonnino A, Kokoris Kogias E. Bullshark: DAG BFT protocols made practical. In: <i>Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security</i>. Association for Computing Machinery; 2022:2705–2718. doi:<a href=\"https://doi.org/10.1145/3548606.3559361\">10.1145/3548606.3559361</a>","ieee":"A. Spiegelman, N. Giridharan, A. Sonnino, and E. Kokoris Kogias, “Bullshark: DAG BFT protocols made practical,” in <i>Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security</i>, Los Angeles, CA, United States, 2022, pp. 2705–2718.","apa":"Spiegelman, A., Giridharan, N., Sonnino, A., &#38; Kokoris Kogias, E. (2022). Bullshark: DAG BFT protocols made practical. In <i>Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security</i> (pp. 2705–2718). Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3548606.3559361\">https://doi.org/10.1145/3548606.3559361</a>","short":"A. Spiegelman, N. Giridharan, A. Sonnino, E. Kokoris Kogias, in:, Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2022, pp. 2705–2718."},"conference":{"start_date":"2022-11-07","end_date":"2022-11-11","name":"CCS: CConference on Computer and Communications Security","location":"Los Angeles, CA, United States"},"external_id":{"arxiv":["2201.05677"]},"publication":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","department":[{"_id":"ElKo"}],"title":"Bullshark: DAG BFT protocols made practical","date_updated":"2023-01-27T10:33:17Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11","doi":"10.1145/3548606.3559361","language":[{"iso":"eng"}],"date_created":"2023-01-16T09:49:48Z","oa_version":"Preprint","oa":1}