{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:40:50Z","timestamp":1764175250877,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T00:00:00Z","timestamp":1653868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Australian Research Council Future Fellowship funding scheme","award":["180100496"],"award-info":[{"award-number":["180100496"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,5,30]]},"DOI":"10.1145\/3488932.3517386","type":"proceedings-article","created":{"date-parts":[[2022,5,24]],"date-time":"2022-05-24T04:23:26Z","timestamp":1653366206000},"page":"168-181","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["TRAP"],"prefix":"10.1145","author":[{"given":"Alejandro","family":"Ranchal-Pedrosa","sequence":"first","affiliation":[{"name":"University of Sydney, Sydney, NSW, Australia"}]},{"given":"Vincent","family":"Gramoli","sequence":"additional","affiliation":[{"name":"University of Sydney & EPFL, Sydney, NSW, Australia"}]}],"member":"320","published-online":{"date-parts":[[2022,5,30]]},"reference":[{"volume-title":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. 501--510","author":"Abraham Ittai","key":"e_1_3_2_2_1_1","unstructured":"Ittai Abraham , Danny Dolev , Ivan Geffner , and Joseph Y. Halpern . 2019 b. Implementing Mediators with Asynchronous Cheap Talk . In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. 501--510 . Ittai Abraham, Danny Dolev, Ivan Geffner, and Joseph Y. Halpern. 2019 b. Implementing Mediators with Asynchronous Cheap Talk. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. 501--510."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146393"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3303712"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467914"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611481"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095809.1095816"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/3398761.3398772"},{"key":"e_1_3_2_2_8_1","volume-title":"Acceptable points in general cooperative n-person games. Contributions to the Theory of Games (AM-40)","author":"Aumarm Robert J","year":"2016","unstructured":"Robert J Aumarm . 2016. Acceptable points in general cooperative n-person games. Contributions to the Theory of Games (AM-40) , Volume IV , Vol. 40 ( 2016 ), 287. Robert J Aumarm. 2016. Acceptable points in general cooperative n-person games. Contributions to the Theory of Games (AM-40), Volume IV, Vol. 40 (2016), 287."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0531(02)00011-X"},{"key":"e_1_3_2_2_11_1","volume-title":"Enter the Hydra: Towards Principled Bug Bounties and Exploit-Resistant Smart Contracts. In 27th USENIX Security Symposium (USENIX Security 18)","author":"Breidenbach Lorenz","year":"2018","unstructured":"Lorenz Breidenbach , Phil Daian , Florian Tram\u00e8r , and Ari Juels . 2018 . Enter the Hydra: Towards Principled Bug Bounties and Exploit-Resistant Smart Contracts. In 27th USENIX Security Symposium (USENIX Security 18) . 1335--1352. Lorenz Breidenbach, Phil Daian, Florian Tram\u00e8r, and Ari Juels. 2018. Enter the Hydra: Towards Principled Bug Bounties and Exploit-Resistant Smart Contracts. In 27th USENIX Security Symposium (USENIX Security 18). 1335--1352."},{"key":"e_1_3_2_2_12_1","volume-title":"Proceedings of the 34th International Symposium on Distributed Computing (DISC) (LIPIcs","volume":"3","author":"Civit Pierre","year":"2020","unstructured":"Pierre Civit , Seth Gilbert , and Vincent Gramoli . 2020 . Brief Announcement: Polygraph: Accountable Byzantine Agreement . In Proceedings of the 34th International Symposium on Distributed Computing (DISC) (LIPIcs , Vol. 179). 45:1--45: 3 . Pierre Civit, Seth Gilbert, and Vincent Gramoli. 2020. Brief Announcement: Polygraph: Accountable Byzantine Agreement. In Proceedings of the 34th International Symposium on Distributed Computing (DISC) (LIPIcs, Vol. 179). 45:1--45:3."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS51616.2021.00046"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00061"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2018.8548057"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993833"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134032"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_25"},{"key":"e_1_3_2_2_23_1","volume-title":"Annual ACM Symposium on Theory of Computing. 307--328","author":"Goldreich Oded","year":"2019","unstructured":"Oded Goldreich , Silvio Micali , and Avi Wigderson . 2019 . How to play any mental game . In Annual ACM Symposium on Theory of Computing. 307--328 . Oded Goldreich, Silvio Micali, and Avi Wigderson. 2019. How to play any mental game. In Annual ACM Symposium on Theory of Computing. 307--328."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Adam Groce Jonathan Katz Aishwarya Thiruvengadam and Vassilis Zikas. 2012a. Byzantine Agreement with a Rational Adversary. In Automata Languages and Programming. 561--572.  Adam Groce Jonathan Katz Aishwarya Thiruvengadam and Vassilis Zikas. 2012a. Byzantine Agreement with a Rational Adversary. In Automata Languages and Programming. 561--572.","DOI":"10.1007\/978-3-642-31585-5_50"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Adam Groce Jonathan Katz Aishwarya Thiruvengadam and Vassilis Zikas. 2012b. Byzantine Agreement with a Rational Adversary. In Automata Languages and Programming. 561--572.  Adam Groce Jonathan Katz Aishwarya Thiruvengadam and Vassilis Zikas. 2012b. Byzantine Agreement with a Rational Adversary. In Automata Languages and Programming. 561--572.","DOI":"10.1007\/978-3-642-31585-5_50"},{"key":"e_1_3_2_2_27_1","volume-title":"23rd International Conference on Principles of Distributed Systems (LIPIcs","volume":"17","author":"Harel Itay","year":"2020","unstructured":"Itay Harel , Amit Jacob-Fanani , Moshe Sulamy , and Yehuda Afek . 2020 . Consensus in Equilibrium: Can One Against All Decide Fairly? . In 23rd International Conference on Principles of Distributed Systems (LIPIcs , Vol. 153). 20:1--20: 17 . Itay Harel, Amit Jacob-Fanani, Moshe Sulamy, and Yehuda Afek. 2020. Consensus in Equilibrium: Can One Against All Decide Fairly?. In 23rd International Conference on Principles of Distributed Systems (LIPIcs, Vol. 153). 20:1--20:17."},{"volume-title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. 1485--1502","author":"Harz Dominik","key":"e_1_3_2_2_28_1","unstructured":"Dominik Harz , Lewis Gudgeon , Arthur Gervais , and William J. Knottenbelt . 2019. Balance: Dynamic Adjustment of Cryptocurrency Deposits . In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. 1485--1502 . Dominik Harz, Lewis Gudgeon, Arthur Gervais, and William J. Knottenbelt. 2019. Balance: Dynamic Adjustment of Cryptocurrency Deposits. In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. 1485--1502."},{"key":"e_1_3_2_2_29_1","unstructured":"Yuval Heller. 2005. Minority-proof cheap-talk protocol (extended version). Ph. D. Dissertation. Citeseer.  Yuval Heller. 2005. Minority-proof cheap-talk protocol (extended version). Ph. D. Dissertation. Citeseer."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Eleftherios Kokoris Kogias Dahlia Malkhi and Alexander Spiegelman. 2020. Asynchronous Distributed Key Generation for Computationally-Secure Randomness Consensus and Threshold Signatures.  Eleftherios Kokoris Kogias Dahlia Malkhi and Alexander Spiegelman. 2020. Asynchronous Distributed Key Generation for Computationally-Secure Randomness Consensus and Threshold Signatures.","DOI":"10.1145\/3372297.3423364"},{"volume-title":"Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts. In 2016 IEEE Symposium on Security and Privacy (SP). 839--858","author":"Kosba A.","key":"e_1_3_2_2_31_1","unstructured":"A. Kosba , A. Miller , E. Shi , Z. Wen , and C. Papamanthou . 2016 . Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts. In 2016 IEEE Symposium on Security and Privacy (SP). 839--858 . A. Kosba, A. Miller, E. Shi, Z. Wen, and C. Papamanthou. 2016. Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts. In 2016 IEEE Symposium on Security and Privacy (SP). 839--858."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_2_33_1","first-page":"180","article-title":"Rationality and Adversarial Behavior in Multi-party Computation","volume":"2006","author":"Lysyanskaya Anna","year":"2006","unstructured":"Anna Lysyanskaya and Nikos Triandopoulos . 2006 . Rationality and Adversarial Behavior in Multi-party Computation . In Advances in Cryptology - CRYPTO 2006. 180 -- 197 . Anna Lysyanskaya and Nikos Triandopoulos. 2006. Rationality and Adversarial Behavior in Multi-party Computation. In Advances in Cryptology - CRYPTO 2006. 180--197.","journal-title":"Advances in Cryptology - CRYPTO"},{"key":"e_1_3_2_2_34_1","volume-title":"ZLB: A Blockchain to Tolerate Colluding Majorities. Technical Report","author":"Ranchal-Pedrosa Alejandro","year":"2021","unstructured":"Alejandro Ranchal-Pedrosa and Vincent Gramoli . 2021 . ZLB: A Blockchain to Tolerate Colluding Majorities. Technical Report 2007.10541. arXiv. Alejandro Ranchal-Pedrosa and Vincent Gramoli. 2021. ZLB: A Blockchain to Tolerate Colluding Majorities. Technical Report 2007.10541. arXiv."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484566"},{"key":"e_1_3_2_2_36_1","volume-title":"Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation. 169--184","author":"Singh Atul","year":"2009","unstructured":"Atul Singh , Pedro Fonseca , Petr Kuznetsov , Rodrigo Rodrigues , and Petros Maniatis . 2009 . Zeno: Eventually Consistent Byzantine-Fault Tolerance . In Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation. 169--184 . Atul Singh, Pedro Fonseca, Petr Kuznetsov, Rodrigo Rodrigues, and Petros Maniatis. 2009. Zeno: Eventually Consistent Byzantine-Fault Tolerance. In Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation. 169--184."},{"key":"e_1_3_2_2_37_1","volume-title":"Scalable Bias-Resistant Distributed Randomness. In 2017 IEEE Symposium on Security and Privacy (SP). 444--460","author":"Syta Ewa","year":"2017","unstructured":"Ewa Syta , Philipp Jovanovic , Eleftherios Kokoris Kogias , Nicolas Gailly , Linus Gasser , Ismail Khoffi , Michael J. Fischer , and Bryan Ford . 2017 . Scalable Bias-Resistant Distributed Randomness. In 2017 IEEE Symposium on Security and Privacy (SP). 444--460 . Ewa Syta, Philipp Jovanovic, Eleftherios Kokoris Kogias, Nicolas Gailly, Linus Gasser, Ismail Khoffi, Michael J. Fischer, and Bryan Ford. 2017. Scalable Bias-Resistant Distributed Randomness. In 2017 IEEE Symposium on Security and Privacy (SP). 444--460."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Xavier Vilacc a Oksana Denysyuk and Lu\u00eds Rodrigues. 2012. Asynchrony and Collusion in the N-party BAR Transfer Problem. In Structural Information and Communication Complexity. 183--194.  Xavier Vilacc a Oksana Denysyuk and Lu\u00eds Rodrigues. 2012. Asynchrony and Collusion in the N-party BAR Transfer Problem. In Structural Information and Communication Complexity. 183--194.","DOI":"10.1007\/978-3-642-31104-8_16"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034640.2034647"}],"event":{"name":"ASIA CCS '22: ACM Asia Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Nagasaki Japan","acronym":"ASIA CCS '22"},"container-title":["Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488932.3517386","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3488932.3517386","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:29Z","timestamp":1750193309000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488932.3517386"}},"subtitle":["The Bait of Rational Players to Solve Byzantine Consensus"],"short-title":[],"issued":{"date-parts":[[2022,5,30]]},"references-count":35,"alternative-id":["10.1145\/3488932.3517386","10.1145\/3488932"],"URL":"https:\/\/doi.org\/10.1145\/3488932.3517386","relation":{},"subject":[],"published":{"date-parts":[[2022,5,30]]},"assertion":[{"value":"2022-05-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}