[{"alternative_title":["LIPIcs"],"file_date_updated":"2018-12-17T12:08:00Z","quality_controlled":"1","oa":1,"cc_license":"'https://creativecommons.org/licenses/by/4.0/'","ddc":["000"],"title":"Ergodic mean-payoff games for the analysis of attacks in crypto-currencies.","type":"conference","_id":"66","department":[{"_id":"KrCh"}],"project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"volume":118,"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.CONCUR.2018.11","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies.</i> Vol. 118, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 11, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.11\">10.4230/LIPIcs.CONCUR.2018.11</a>.","ieee":"K. Chatterjee, A. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies.,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118, p. 11.","ista":"Chatterjee K, Goharshady A, Ibsen-Jensen R, Velner Y. 2018. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 118. 11.","short":"K. Chatterjee, A. Goharshady, R. Ibsen-Jensen, Y. Velner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 11.","apa":"Chatterjee, K., Goharshady, A., Ibsen-Jensen, R., &#38; Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. (Vol. 118, p. 11). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.11\">https://doi.org/10.4230/LIPIcs.CONCUR.2018.11</a>","chicago":"Chatterjee, Krishnendu, Amir Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies.,” 118:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.11\">https://doi.org/10.4230/LIPIcs.CONCUR.2018.11</a>.","ama":"Chatterjee K, Goharshady A, Ibsen-Jensen R, Velner Y. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. In: Vol 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:11. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.11\">10.4230/LIPIcs.CONCUR.2018.11</a>"},"oa_version":"Published Version","intvolume":"       118","date_created":"2018-12-11T11:44:27Z","day":"01","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Goharshady, Amir","first_name":"Amir","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","last_name":"Goharshady"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus"},{"first_name":"Yaron","full_name":"Velner, Yaron","last_name":"Velner"}],"publist_id":"7988","date_updated":"2019-08-02T12:39:23Z","month":"09","conference":{"start_date":"2018-09-04","location":"Beijing, China","name":"CONCUR: Conference on Concurrency Theory","end_date":"2018-09-07"},"publication_identifier":{"isbn":["978-3-95977-087-3"]},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2018-09-01T00:00:00Z","article_number":"11","accept":"1","main_file_link":[{"url":"https://arxiv.org/abs/1806.03108","open_access":"1"}],"external_id":{"arxiv":["1806.03108"]},"abstract":[{"lang":"eng","text":"Crypto-currencies are digital assets designed to work as a medium of exchange, e.g., Bitcoin, but they are susceptible to attacks (dishonest behavior of participants). A framework for the analysis of attacks in crypto-currencies requires (a) modeling of game-theoretic aspects to analyze incentives for deviation from honest behavior; (b) concurrent interactions between participants; and (c) analysis of long-term monetary gains. Traditional game-theoretic approaches for the analysis of security protocols consider either qualitative temporal properties such as safety and termination, or the very special class of one-shot (stateless) games. However, to analyze general attacks on protocols for crypto-currencies, both stateful analysis and quantitative objectives are necessary. In this work our main contributions are as follows: (a) we show how a class of concurrent mean-payo games, namely ergodic games, can model various attacks that arise naturally in crypto-currencies; (b) we present the first practical implementation of algorithms for ergodic games that scales to model realistic problems for crypto-currencies; and (c) we present experimental results showing that our framework can handle games with thousands of states and millions of transitions."}],"status":"public","year":"2018","publication_status":"published","file":[{"date_updated":"2018-12-17T12:08:00Z","content_type":"application/pdf","open_access":1,"access_level":"open_access","file_size":1078309,"file_name":"2018_CONCUR_Chatterjee.pdf","success":1,"file_id":"5696","relation":"main_file","date_created":"2018-12-17T12:08:00Z","creator":"dernst"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}]