{"title":"The Demand for Programmable Payments: Extended Abstract (Extended Abstract)","authors":"C. Kahn, Maarten R. C. van Oordt","doi":"10.4230/OASIcs.Tokenomics.2022.8","DOIUrl":"https://doi.org/10.4230/OASIcs.Tokenomics.2022.8","url":null,"abstract":"","PeriodicalId":174732,"journal":{"name":"International Conference on Blockchain Economics, Security and Protocols","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133987297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Secure Computation with Non-Equivalent Penalties in Constant Rounds","authors":"Takeshi Nakai, Kazumasa Shinagawa","doi":"10.4230/OASIcs.Tokenomics.2021.5","DOIUrl":"https://doi.org/10.4230/OASIcs.Tokenomics.2021.5","url":null,"abstract":"It is known that Bitcoin enables to achieve fairness in secure computation by imposing a monetary penalty on adversarial parties. This functionality is called secure computation with penalties . Bentov and Kumaresan (Crypto 2014) showed that it could be realized with O ( n ) rounds and O ( n ) broadcasts for any function, where n is the number of parties. Kumaresan and Bentov (CCS 2014) posed an open question: “Is it possible to design secure computation with penalties that needs only O (1) rounds and O ( n ) broadcasts?” In this work, we introduce secure computation with non-equivalent penalties , and design a protocol achieving this functionality with O (1) rounds and O ( n ) broadcasts only. The new functionality is the same as secure computation with penalties except that every honest party receives more than a predetermined amount of compensation while the previous one requires that every honest party receives the same amount of compensation. In particular, both are the same if all parties behave honestly. Thus, our result gives a partial answer to the open problem with a slight and natural modification of functionality.","PeriodicalId":174732,"journal":{"name":"International Conference on Blockchain Economics, Security and Protocols","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132081872","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"VeriOSS: Using the Blockchain to Foster Bug Bounty Programs","authors":"Andrea Canidio, Gabriele Costa, Letterio Galletta","doi":"10.4230/OASIcs.Tokenomics.2020.6","DOIUrl":"https://doi.org/10.4230/OASIcs.Tokenomics.2020.6","url":null,"abstract":"Nowadays software is everywhere and this is particularly true for free and open source software (FOSS). Discovering bugs in FOSS projects is of paramount importance and many bug bounty programs attempt to attract skilled analysts by promising rewards. Nevertheless, developing an effective bug bounty program is challenging. As a consequence, many programs fail to support an efficient and fair bug bounty market. In this paper, we present VeriOSS, a novel bug bounty platform. The idea behind VeriOSS is to exploit the blockchain technology to develop a fair and efficient bug bounty market. To this aim, VeriOSS combines formal guarantees and economic incentives to ensure that the bug disclosure is both reliable and convenient for the market actors. 2012 ACM Subject Classification Security and privacy → Software security engineering; Software and its engineering → Formal software verification; Security and privacy → Economics of security and privacy","PeriodicalId":174732,"journal":{"name":"International Conference on Blockchain Economics, Security and Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129827905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Detecting and Quantifying Crypto Wash Trading (Extended Abstract)","authors":"L. Cong, Xi Li, Ke Tang, Yang Yang","doi":"10.4230/OASIcs.Tokenomics.2021.10","DOIUrl":"https://doi.org/10.4230/OASIcs.Tokenomics.2021.10","url":null,"abstract":"","PeriodicalId":174732,"journal":{"name":"International Conference on Blockchain Economics, Security and Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131104832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"F1 Fee Distribution","authors":"D. Ojha, Christopher Goes","doi":"10.4230/OASIcs.Tokenomics.2019.10","DOIUrl":"https://doi.org/10.4230/OASIcs.Tokenomics.2019.10","url":null,"abstract":"","PeriodicalId":174732,"journal":{"name":"International Conference on Blockchain Economics, Security and Protocols","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133016970","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Commit-Reveal Schemes Against Front-Running Attacks (Extended Abstract)","authors":"Andrea Canidio, V. Danos","doi":"10.4230/OASIcs.Tokenomics.2022.7","DOIUrl":"https://doi.org/10.4230/OASIcs.Tokenomics.2022.7","url":null,"abstract":"We provide a game-theoretic analysis of the problem of front-running attacks. We use it to study a simple commit-reveal protocol and discuss its properties. This protocol has costs because it requires two messages and imposes a delay. However, we show that it prevents the most severe front-running attacks (“bad MEV”) while preserving legitimate competition between users, guaranteeing that the earliest transaction in a block belongs to the honest user who values it the most (“good MEV”). 2012 ACM Subject Classification Computer systems organization → Dependable and fault-tolerant systems and networks","PeriodicalId":174732,"journal":{"name":"International Conference on Blockchain Economics, Security and Protocols","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114153994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}