{"language":[{"iso":"eng"}],"citation":{"chicago":"Keidar, Idit, Eleftherios Kokoris Kogias, Oded Naor, and Alexander Spiegelman. “All You Need Is DAG.” In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, 165–75. Association for Computing Machinery, 2021. https://doi.org/10.1145/3465084.3467905.","ieee":"I. Keidar, E. Kokoris Kogias, O. Naor, and A. Spiegelman, “All You Need is DAG,” in Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Virtual, Italy, 2021, pp. 165–175.","ista":"Keidar I, Kokoris Kogias E, Naor O, Spiegelman A. 2021. All You Need is DAG. Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 165–175.","apa":"Keidar, I., Kokoris Kogias, E., Naor, O., & Spiegelman, A. (2021). All You Need is DAG. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (pp. 165–175). Virtual, Italy: Association for Computing Machinery. https://doi.org/10.1145/3465084.3467905","mla":"Keidar, Idit, et al. “All You Need Is DAG.” Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 165–75, doi:10.1145/3465084.3467905.","short":"I. Keidar, E. Kokoris Kogias, O. Naor, A. Spiegelman, in:, Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 165–175.","ama":"Keidar I, Kokoris Kogias E, Naor O, Spiegelman A. All You Need is DAG. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2021:165-175. doi:10.1145/3465084.3467905"},"publication_status":"published","publisher":"Association for Computing Machinery","page":"165-175","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","main_file_link":[{"url":"https://arxiv.org/abs/2102.08325","open_access":"1"}],"isi":1,"month":"07","_id":"10554","abstract":[{"text":"We present DAG-Rider, the first asynchronous Byzantine Atomic Broadcast protocol that achieves optimal resilience, optimal amortized communication complexity, and optimal time complexity. DAG-Rider is post-quantum safe and ensures that all values proposed by correct processes eventually get delivered. We construct DAG-Rider in two layers: In the first layer, processes reliably broadcast their proposals and build a structured Directed Acyclic Graph (DAG) of the communication among them. In the second layer, processes locally observe their DAGs and totally order all proposals with no extra communication.","lang":"eng"}],"year":"2021","title":"All You Need is DAG","department":[{"_id":"ElKo"}],"publication":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing","status":"public","doi":"10.1145/3465084.3467905","oa_version":"Preprint","conference":{"end_date":"2021-07-30","location":"Virtual, Italy","name":"PODC: Principles of Distributed Computing","start_date":"2021-07-26"},"day":"21","scopus_import":"1","article_processing_charge":"No","external_id":{"arxiv":["2102.08325"],"isi":["000744439800016"]},"date_published":"2021-07-21T00:00:00Z","type":"conference","quality_controlled":"1","acknowledgement":"Oded Naor is grateful to the Technion Hiroshi Fujiwara Cyber-Security Research Center for providing a research grant. Part of Oded’s work was done while at Novi Research. This work was funded by the Novi team at Facebook. We also wish to thank the Novi Research team for valuable feedback, and in particular George Danezis, Alberto Sonnino, and Dahlia Malkhi.\r\n","oa":1,"publication_identifier":{"isbn":["978-1-4503-8548-0"]},"date_updated":"2023-08-17T06:24:44Z","author":[{"first_name":"Idit","full_name":"Keidar, Idit","last_name":"Keidar"},{"full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","last_name":"Kokoris Kogias"},{"last_name":"Naor","full_name":"Naor, Oded","first_name":"Oded"},{"last_name":"Spiegelman","full_name":"Spiegelman, Alexander","first_name":"Alexander"}],"date_created":"2021-12-16T13:21:13Z"}