{"title":"Towards Malicious address identification in Bitcoin","authors":"Deepesh Chaudhari, R. Agarwal, S. Shukla","doi":"10.1109/Blockchain53845.2021.00066","DOIUrl":"https://doi.org/10.1109/Blockchain53845.2021.00066","url":null,"abstract":"The temporal aspect of blockchain transactions enables us to study the address's behavior and detect if it is involved in any illicit activity. However, due to the concept of change addresses (used to thwart replay attacks), temporal aspects are not directly applicable in the Bitcoin blockchain. Several pre-processing steps should be performed before such temporal aspects are utilized. We are motivated to study the Bitcoin transaction network and use the temporal features such as burst, attractiveness, and inter-event time along with several graph-based properties such as the degree of node and clustering coefficient to validate the applicability of already existing approaches known for other cryptocurrency blockchains on the Bitcoin blockchain. We generate the temporal and non-temporal feature set and train the Machine Learning (ML) algorithm over different temporal granularities to validate the state-of-the-art methods. We study the behavior of the addresses over different time granularities of the dataset. We identify that after applying change-address clustering, in Bitcoin, existing temporal features can be extracted and ML approaches can be applied. A comparative analysis of results show that the behavior of addresses in Ethereum and Bitcoin is similar with respect to in-degree, out-degree and inter-event time. Further, we identify 3 suspects that showed malicious behavior across different temporal granularities. These suspects are not marked as malicious in Bitcoin.","PeriodicalId":372721,"journal":{"name":"2021 IEEE International Conference on Blockchain (Blockchain)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114607241","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":"On The Legislation Prospective For Consumer Protection Of Stablecoin","authors":"Zhiqin Shi, Weiping He, Josephine Liu","doi":"10.1109/Blockchain53845.2021.00035","DOIUrl":"https://doi.org/10.1109/Blockchain53845.2021.00035","url":null,"abstract":"Stablecoin, as a specific type of cryptocurrency, is undoubtedly one of the underlying infrastructures that underpin the rapidly growing decentralised finance (Defi) ecosystem. It is regarded and used as the on-chain “legal currency”. Questions arise as to is it such a low-volatility cryptocurrency really stable and is it able to always stay stable. The answers are probably no. Whether the underlying code is law is for debate, but it is not yet applicable to Defi and stablecoins. The law would undoubtedly play a positive role in improving the stability of stablecoin. Through this paper, we focus on the consumer protection aspect of stablecoin legislation and regulation. We set out to analyse the nature of stablecoins in a legal sense. We first survey the legislative practice of cryptocurrencies in multiple jurisdictions and extract proposals specifically for stablecoins for comparative analysis propose how to best regulate stablecoins. The definition of “stable” is explored from three critical aspects: price stability, collateral stability and permissionless. Finally, we conclude by proposing a general legislative framework for stablecoins. We aim to contribute to the current state of stablecoin and provide insight for international principles for such regulation in the future.","PeriodicalId":372721,"journal":{"name":"2021 IEEE International Conference on Blockchain (Blockchain)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130501483","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":"An Examination Protocol for Handling Programmable Answers Using a Public Blockchain","authors":"Shuichi Takayama, Yuto Takei, Kazuyuki Shudo","doi":"10.1109/Blockchain53845.2021.00057","DOIUrl":"https://doi.org/10.1109/Blockchain53845.2021.00057","url":null,"abstract":"Examinations that involve programming, such as programming contests and certification exams, are common. However, current examination protocols require full trust in the operating organizations, which allows malicious organizations to cheat. As a countermeasure, efforts are being made to develop examination protocols that do not need a trusted authority. One way to build such a decentralized protocol is to apply blockchain. Several blockchain-based examination protocols have been proposed, but they can only handle a finite set of correct answers. We propose an examination protocol that can handle a set of correct answers defined by a program and mathematically guarantee the validity of the protocol. We also implement a programming contest platform based on the proposed method on Ethereum and show the feasibility of the method. Furthermore, we measure the economic cost of the method using the implementation and confirm that the method is feasible for approximately 30–40 USD.","PeriodicalId":372721,"journal":{"name":"2021 IEEE International Conference on Blockchain (Blockchain)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126823836","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}
Shili Hu, Jiangfeng Li, Chenxi Zhang, Qinpei Zhao, Wei Ye
{"title":"The Blockchain-Based Edge Computing Framework for Privacy-Preserving Federated Learning","authors":"Shili Hu, Jiangfeng Li, Chenxi Zhang, Qinpei Zhao, Wei Ye","doi":"10.1109/Blockchain53845.2021.00085","DOIUrl":"https://doi.org/10.1109/Blockchain53845.2021.00085","url":null,"abstract":"Nowadays, privacy-preserving artificial intelligence is gaining traction, with the goal of learning multiple models based on private data without leaking any personal information. Since the existing multi-party computation methods and other encryption-based methods have their flaws, we developed our own blockchain-based edge computing framework to achieve the decentralization and enhance the efficiency. Our framework enables a trustful, simplified and asynchronous federated learning in IoT and provides a convenient and secret classification service. Extensive evaluations on efficiency are provided, confirming the performance of our solutions.","PeriodicalId":372721,"journal":{"name":"2021 IEEE International Conference on Blockchain (Blockchain)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121584409","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}
Jin Xing Lim, B. Monnot, Shaowei Lin, G. Piliouras
{"title":"A Blockchain-Based Approach for Collaborative Formalization of Mathematics and Programs","authors":"Jin Xing Lim, B. Monnot, Shaowei Lin, G. Piliouras","doi":"10.1109/Blockchain53845.2021.00051","DOIUrl":"https://doi.org/10.1109/Blockchain53845.2021.00051","url":null,"abstract":"Formalization of mathematics is the process of digitizing mathematical knowledge, which allows for formal proof verification as well as efficient semantic searches. Given the large and ever-increasing gap between the set of formalized and unformalized mathematical knowledge, there is a clear need to encourage more computer scientists and mathematicians to solve and formalize mathematical problems together. With blockchain technology, we are able to decentralize this process, provide time-stamped verification of authorship and encourage collaboration through implementation of incentive mechanisms via smart contracts. Currently, the formalization of mathematics is done through the use of proof assistants, which can be used to verify proofs as well as algorithms. Furthermore, with the advancement of artificial intelligence (AI), particularly machine learning, we can apply automated reasoning tools in these proof assistants and (at least partially) automate the process of synthesizing proofs. In our paper, we demonstrate a blockchain-based system for collaborative formalization of mathematics and programs incorporating both human labour as well as AI tools. We explain how Token-Curated Registries (TCR) and smart contracts are used to ensure appropriate documents are recorded and encourage collaboration through implementation of incentive mechanisms respectively. Using an illustrative example, we show how formalized proofs of different sorting algorithms can be produced collaboratively in our proposed blockchain system.","PeriodicalId":372721,"journal":{"name":"2021 IEEE International Conference on Blockchain (Blockchain)","volume":"2021 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128062730","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}
Michael Sober, Giulia Scaffino, Christof Spanring, Stefan Schulte
{"title":"A Voting-Based Blockchain Interoperability Oracle","authors":"Michael Sober, Giulia Scaffino, Christof Spanring, Stefan Schulte","doi":"10.1109/Blockchain53845.2021.00030","DOIUrl":"https://doi.org/10.1109/Blockchain53845.2021.00030","url":null,"abstract":"Today's blockchain landscape is severely fragmented as more and more heterogeneous blockchain platforms have been developed in recent years. These blockchain platforms are not able to interact with each other or with the outside world since only little emphasis is placed on the interoperability between them. Already proposed solutions for blockchain interoperability such as naive relay or oracle solutions are usually not broadly applicable since they are either too expensive to operate or very resource-intensive. For that reason, we propose a blockchain interoperability oracle that follows a voting-based approach based on threshold signatures. The oracle nodes generate a distributed private key to execute an off-chain aggregation mechanism to collectively respond to requests. Compared to state-of-the-art relay schemes, our approach does not incur any ongoing costs and since the on-chain component only needs to verify a single signature, we can achieve remarkable cost savings compared to conventional oracle solutions.","PeriodicalId":372721,"journal":{"name":"2021 IEEE International Conference on Blockchain (Blockchain)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132097417","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":"Effect of Miner Incentive on the Confirmation Time of Bitcoin Transactions","authors":"Befekadu G. Gebraselase, B. Helvik, Yuming Jiang","doi":"10.1109/Blockchain53845.2021.00079","DOIUrl":"https://doi.org/10.1109/Blockchain53845.2021.00079","url":null,"abstract":"Blockchain is a technology that provides a distributed ledger that stores previous records while maintaining consistency and security. Bitcoin is the first and largest decentralized electronic cryptographic system that uses blockchain technology. It faces a challenge in making all the nodes synchronize and have the same overall view with the cost of scalability and performance. In addition, with miners' financial interest playing a significant role in choosing transactions from the backlog, small fee or small fee per byte value transactions will exhibit more delays. To study the issues related to the system's performance, we developed an $M(t)/M^{N}/1$ model. The backlog's arrival follows an inhomogeneous Poison process to the system that has infinite buffer capacity, and the service time is distributed exponentially, which removes $N$ transactions at time. Besides validating the model with measurement data, we have used the model to study the reward distribution when miners take transaction selection strategies like fee per byte, fee-based, and FIFO. The analysis shows that smaller fee transactions exhibit higher waiting times, even with increasing the block size. Moreover, the miner transaction selection strategy impacts the final gain.","PeriodicalId":372721,"journal":{"name":"2021 IEEE International Conference on Blockchain (Blockchain)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125878142","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}
Antonio Russo, Antonio Fernández, María Isabel González Vasco, S. Romano
{"title":"Chirotonia: A Scalable and Secure e-Voting Framework based on Blockchains and Linkable Ring Signatures","authors":"Antonio Russo, Antonio Fernández, María Isabel González Vasco, S. Romano","doi":"10.1109/Blockchain53845.2021.00065","DOIUrl":"https://doi.org/10.1109/Blockchain53845.2021.00065","url":null,"abstract":"In this paper we propose a comprehensive and scalable framework to build secure-by-design e-voting systems. Decentralization, transparency, determinism, and untamperability of votes are granted by dedicated smart contracts on a blockchain, while voter authenticity and anonymity are achieved through (provable secure) linkable ring signatures. These, in combination with suitable smart contract constraints, also grant protection from double voting. Our design is presented in detail, focusing on its security guarantees and the design choices that allow it to scale to a large number of voters. Finally, we present a proof-of-concept implementation of the proposed framework, made available as open source.","PeriodicalId":372721,"journal":{"name":"2021 IEEE International Conference on Blockchain (Blockchain)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126334976","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":"Rational Agreement in the Presence of Crash Faults","authors":"Alejandro Ranchal-Pedrosa, V. Gramoli","doi":"10.1109/Blockchain53845.2021.00072","DOIUrl":"https://doi.org/10.1109/Blockchain53845.2021.00072","url":null,"abstract":"Blockchain systems need to solve consensus despite the presence of rational users and failures. The notion of ($k, t$)-robustness is key to derive impossibility results with $k$ rational players and $t$ faulty players. However, these $t$ faulty players are always considered Byzantine in that they can act arbitrarily. What is less clear is whether these impossibilities hold if these faults are crashes. In this paper, we bridge the gap between games that are robust against Byzantine players and games that are robust against crash players. Our first result is an impossibility result: We show that no ($k, t$)-robust consensus protocols can solve consensus in the crash fault model if $k+2tgeq n$ unless there is a particular punishment strategy, called the ($k, t$)-baiting strategy. This reveals the need to introduce baiting as the act of rewarding a colluding node when betraying its coalition, to make blockchains more secure. Our second result is an equivalence relation between crash fault tolerant games and Byzantine fault tolerant games, which raises an interesting research question on the power of baiting to solve consensus. To this end, we show, on the one hand, that a ($k, t$)-robust consensus protocol becomes ($k+t, t$)-robust in the crash model. We show, on the other hand, that the existence of a ($k, t$)-robust consensus protocol in the crash model that does not make use of a baiting strategy implies the existence of a ($k-t, t$)-robust consensus protocol in the Byzantine model, with the help of cryptography.","PeriodicalId":372721,"journal":{"name":"2021 IEEE International Conference on Blockchain (Blockchain)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115231192","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}
S. Casale-Brunet, Paolo Ribeca, P. Doyle, M. Mattavelli
{"title":"Networks of Ethereum Non-Fungible Tokens: A graph-based analysis of the ERC-721 ecosystem","authors":"S. Casale-Brunet, Paolo Ribeca, P. Doyle, M. Mattavelli","doi":"10.1109/Blockchain53845.2021.00033","DOIUrl":"https://doi.org/10.1109/Blockchain53845.2021.00033","url":null,"abstract":"Non-fungible tokens (NFTs) as a decentralized proof of ownership represent one of the main reasons why Ethereum is a disruptive technology. This paper presents the first systematic study of the interactions occurring in a number of NFT ecosystems. We illustrate how to retrieve transaction data available on the blockchain and structure it as a graph-based model. Thanks to this methodology, we are able to study for the first time the topological structure of NFT networks and show that their properties (degree distribution and others) are similar to those of interaction graphs in social networks. Time-dependent analysis metrics, useful to characterize market influencers and interactions between different wallets, are also introduced. Based on those, we identify across a number of NFT networks the widespread presence of both investors accumulating NFTs and individuals who make large profits.","PeriodicalId":372721,"journal":{"name":"2021 IEEE International Conference on Blockchain (Blockchain)","volume":"223 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115207781","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}