Follow blockchain research across journals, conferences, and preprint repositories.
1,224 results · page 16 of 51
Vinayak Musale, Pranav Mandke, Debajyoti Mukhopadhyay, Swapnoneel Roy · 5 authors
No abstract is available for this record.
Haibo Yi
Abstract Business intelligence (BI) is driven by data and provides valuable business insights and decision support through data analysis, mining, and visualization. The application of blockchain technology in electronic voting can make the voting process more fair and transparent. This is because the decentralized nature of blockchain technology ensures that voting data is not lost due to a single central server failure and also mitigates the risk of data tampering. However, electronic voting still faces security issues that are not easily resistant to quantum attacks. To address these challenges, we propose post-quantum cryptography and verifiable random functions for secure and efficient business intelligence electronic voting. Firstly, we propose a post-quantum verifiable random function algorithm that can resist quantum computer attacks. Secondly, we introduce a consensus algorithm based on random functions to achieve fast and efficient consensus. Thirdly, we propose a blockchain architecture based on the consensus algorithm to achieve secure and efficient blockchain applications. By integrating post-quantum verifiable random functions, consensus algorithms, and blockchain technology, we present an efficient business intelligence electronic voting system. Implementation and comparison with relevant designs demonstrate that this system provides efficient and secure electronic voting services for business intelligence users. Furthermore, the efficient consensus algorithm can be utilized to improve other blockchain applications or decentralized applications.
Zihan Zhou, Chenxiao Guo, Hao Xu, Xiaoshuai Zhang · 6 authors
To enhance security and confidentiality in P2P communication, we implement a blockchain-enabled system of identity management and mutual authentication protocol, Be-Mutual. It provides user-centric identity management based on blockchain addresses and employs mutual authentication based on asymmetric encryption to prevent unauthorized access. We address the complexity of blockchain addresses, a significant chal-lenge in real-world applications such as Decentralized Physical Infrastructure (DePIN) and Decentralized Wireless (DeWi), by integrating the Blockchain-enabled Domain Name System (Be-DNS) into BeMutual. BeDNS maps complex blockchain addresses to easy-to-remember domain names, improving user experience without sacrificing security. The proposed BeMutual system, combining blockchain-based identity management, mutual authentication, and domain name resolution, offers a pioneering solution for secure and user-friendly P2P communication in decentralized environments.
Huashuang Yang, Jinqiao Shi, Yue Gao, Xuebin Wang · 7 authors
Abstract Bitcoin is a decentralized P2P cryptocurrency. It supports users to use pseudonyms instead of network addresses to send and receive transactions at the data layer, hiding users’ real network identities. Traditional transaction tracing attack cuts through the network layer to directly associate each transaction with the network address that issued it, thus revealing the sender’s network identity. But this attack can be mitigated by Bitcoin’s network layer privacy protections. Since Bitcoin protects the unlinkability of Bitcoin addresses and there may be a many-to-one relationship between addresses and nodes, transactions sent from the same node via different addresses are seen as coming from different nodes because attackers can only use addresses as node identifiers. In this paper, we proposed the evicting and filling attack to expose the correlations between addresses and cluster transactions sent from different addresses of the same node. The attack exploited the unisolation of Bitcoin’s incoming connection processing mechanism. In particular, an attacker can utilize the shared connection pool and deterministic connection eviction strategy to infer the correlation between incoming and evicting connections, as well as the correlation between releasing and filling connections. Based on inferred results, different addresses of the same node with these connections can be linked together, whether they are of the same or different network types. We designed a multi-step attack procedure, and set reasonable attack parameters through analyzing the factors that affect the attack efficiency and accuracy. We mounted this attack on both our self-run nodes and multi-address nodes in real Bitcoin network, achieving an average accuracy of 96.9% and 82%, respectively. Furthermore, we found that the attack is also applicable to Zcash, Litecoin, Dogecoin, Bitcoin Cash, and Dash. We analyzed the cost of network-wide attacks, the application scenario, and proposed countermeasures of this attack.
Tamara Finogina
(English) One of the most common fears regarding electronic voting is that a voting device will disregard the voter's intent and cast a different vote instead. An undetectable attack like that on a large scale will allow the adversary to control the election result completely. Therefore, the cast-as-intended verification, which ensures that the ballot contains the voter's choice and not something else, is crucial. Another common fear when introducing electronic voting is coercion, which captures a variety of ways the coercer can use to prevent voters from expressing their will. Hence, coercion resistance is a valuable property of electronic voting as well. One particularly challenging task is to find a trade-off between ensuring a voter cannot be coerced and, at the same time, preventing a malicious voting device from cheating. This thesis explores this trade-off to find how we can provide coercion-resistant cast-as-intended verification. The contributions can be roughly divided into three parts: (1) study in the standard settings, (2) exploration of post-quantum cryptography, and (3) practical constructions and search for the limitations of both properties. In the first part, we give an extensive overview of the current state of the art in electronic voting literature regarding those properties. Then, we put forward two formal definitions for achieving coercion-resistant cast-as-intended verification in settings without pre-exchanged data. After that, we present two practical constructions and prove their security under the proposed definitions. We also show the efficiency of our proposals by providing proof of the concept implementations. In the second part, we switch to post-quantum settings and identify the usability issues rooted in the lattice-based math affecting both proposed solutions. To address those issues, we present a generic transformation that departs from an interactive zero-knowledge system (that might require multiple re-runs to complete the protocol) and obtains a 3-move zero-knowledge system (without re-runs). The transformation combines the well-known Fiat-Shamir technique with several initially exchanged messages. The resulting 3-move system enjoys honest-verifier zero-knowledge and can be easily turned into a fully deniable proof using standard methods. In the final part, we focus on the practical aspects of the coercion-resistant cast-as-intended verification. First, we present the case of a computationally limited voter, which we consider the most realistic. We show that even a computationally limited voter can enjoy coercion-resistant cast-as-intended verification, but a help of a simple aid device for nonce generation is required. Also, we demonstrate that our generic definition easily adapts to the constraints of the limited voter. After that, we present ongoing work that focuses on the cases of extreme coercion based on new and unexplored mechanisms such as delay encryption and blockchain. We show an advanced coercive attack on our first construction and describe an improvement to the second solution that reduces the number of interactions to an optimal three rounds. To summarize, we start by studying coercion-resistant cast-as-intended verification in standard settings, which results in formal definitions and two practical solutions. Then we move into the post-quantum world, where we learn that an extra step is needed to preserve the usability of our previously proposed constructions, which results in the generic transformation to avoid protocol re-runs. After that, we concentrate on a computationally limited voter, which leads to another simple solution and shows the adaptability of our original definitions. Finally, we explore the extreme coercion threats, which result in a new coercion attack on the first construction and upgrade of the second solution. (Català) Una de les preocupacions més comunes pel que fa al vot electrònic és que el dispositiu de votació no tingui en compte la intenció del votant i emeti un vot diferent. Un atac com aquest, si no fos detectable, a gran escala permetria a l'adversari controlar completament el resultat electoral. Per tant, és crucial permetre la propietat de verificació de la intenció del vot emès, la qual garanteix que la papereta contingui la intenció del votant i no una altra cosa. Una altra preocupació és la coacció, que engloba una varietat de maneres que el coaccionador pot utilitzar per obligar que els votants expressin la seva voluntat. La prevenció de la coacció també és una propietat valuosa del vot electrònic .Una tasca especialment difícil és trobar un compromís entre assegurar que un votant no pot ser coaccionat i, al mateix temps, evitar que un dispositiu de vot compromès faci trampes. Aquesta tesi analitza aquesta problemàtica; les contribucions de la tesi es poden dividir en tres parts: (1) estudi de les configuracions d’escenaris de vot estàndards, (2) exploració de la criptografia post-quàntica i (3) construccions pràctiques i cerca de les limitacions d'ambdues propietats. A la primera part, donem una visió general de l'estat actual de la literatura sobre el vot electrònic relacionada a aquestes propietats. A continuació, proposem dues definicions formals per assolir una verificació resistent a la coacció de la intenció del vot emès, en escenaris on no existeix un intercanvi de dades previ. Després, presentem dues propostes pràctiques i demostrem la seva seguretat sota les definicions proposades. També mostrem l'eficàcia de les nostres propostes implementant proves de concepte A la segona part, canviem a l’escenari post-quàntic amb matemàtiques basades en reticles i identifiquem els problemes d'usabilitat que afectarien ambdues solucions proposades en aquest nou escenari. Per solucionar-los, presentem una transformació genèrica que parteix d'un sistema interactiu de coneixement nul (que podria requerir múltiples re-execucions per completar el protocol) i que obté un sistema de coneixement nul de 3 moviments (sense re-execucions). La transformació combina la coneguda tècnica Fiat-Shamir amb diversos missatges intercanviats inicialment. A la part final, ens centrem en els aspectes pràctics de la verificació resistent a la coacció de la intenció del vot emès. En primer lloc, presentem el cas d'un votant limitat computacionalment, que considerem el més realista. Mostrem que fins i tot un votant amb limitacions computacionals pot gaudir d'una verificació resistent a la coacció de la intenció del vot emès, però requereix l'ajuda d'un dispositiu senzill per a la generació d’una prova. A més, demostrem que la nostra definició genèrica s'adapta fàcilment a les limitacions del votant. Després d'això, presentem un treball recent que se centra en els casos de coacció extrema basats en mecanismes nous i poc explorats com ara el xifrat amb retard i la cadena de blocs. Mostrem un atac coercitiu avançat a la nostra primera proposta genèrica i descrivim una millora de la segona que redueix el nombre d'interaccions a tres rondes òptimes. Com a resum, comencem estudiant la verificació resistent a la coacció de la intenció del vot emès en entorns criptogràfics estàndard, que dóna lloc a definicions formals i dues solucions pràctiques. Aleshores ens movem al món de la criptografia post-quàntica, on cal un pas addicional per preservar la usabilitat de les dues solucions proposades anteriorment: una transformació genèrica per evitar repeticions del protocol. Després d'això, ens concentrem en un votant computacionalment limitat, que condueix a una altra solució senzilla i mostra l'adaptabilitat de les nostres definicions originals. Finalment, explorem les amenaces de coacció extremes, que donen lloc a un nou atac de coerció a la primera solució i a una actualització de la segona solució.
M. Arun, S. V. Gokulnath, S Nithyapriya
Ethereum introduced decentralized applications (DApps) to leverage blockchain's potential, distinct from the cryptocurrency buzz dominating discussions. Ethereum offers a robust platform for DApp development, utilizing the Ethereum Virtual Machine (EVM). With increasing smart contract integration, Ethereum's ecosystem strengthens, as these self-executing contracts govern transactions while ensuring consensus among all participants. In democratic societies, the demand for a transparent and secure electronic voting platform is high. Ethereum, with its expansive network, is an ideal choice for such projects. Our implementation focuses on a decentralized, blockchain-based voting system. Multiple nodes collectively store voting data, ensuring redundancy. In case of node issues, users can access their data from operational nodes, enhancing system reliability. This contrasts with traditional centralized servers, prone to hacking or failures that compromise data accessibility and integrity. Blockchain's immutable data storage prevents tampering, as nodes independently verify each block using cryptographic hash codes. Unauthorized changes trigger immediate alerts, enhancing security and trust in the voting system.
Zejia Tang, Tianyao Pan, Yang Han, Tongzhou Shen · 6 authors
Tor is now using a centralized measurement system called Sbws to measure the bandwidth of relays to guide clients in selecting relays to balance traffic. Sbws has been proven to be vulnerable to multiple attacks because of the centralized structure and exposed measurements. We present SmartMeasurer, a secure and decentralized system for bandwidth measurement. Combining smart contract, Oracle Chainlink and ECC technology, we achieve decentralization while hiding the measurement circuits among the general circuits by exploiting the dual identity of randomly dynamic measurers and guards. We analyze the security of our system and demonstrate that it defends against three types of attacks. Our experiments on both private and public Tor networks show that our system is decentralized while keeping the error and the average of our measurements converges to a small interval of 0.30 Mbps. Compared to other existing methods, our system reduces trust assumptions and the costs of using smart contract, and enhances the practical feasibility of the solution.
Khush Shah, Nilesh Kumar Jadav, Sudeep Tanwar, Anupam Singh · 7 authors
The rapid expansion of the Internet of Things (IoT) on a global scale has facilitated the convergence of revolutionary technologies such as artificial intelligence (AI), blockchain, and cloud computing. The integration of these technologies has paved the way for the development of intricate infrastructures, such as smart homes, smart cities, and smart industries, that are capable of delivering advanced solutions and enhancing human living standards. Nevertheless, IoT devices, while providing effective connectivity and convenience, often rely on traditional network interfaces that can be vulnerable to exploitation by adversaries. If not properly secured and updated, these legacy communication protocols and interfaces can expose potential vulnerabilities that attackers may exploit to gain unauthorized access, disrupt operations, or compromise sensitive data. To overcome the security challenges associated with smart home systems, we have devised a robust framework that leverages the capabilities of both AI and blockchain technology. The proposed framework employs a standard dataset for smart home systems, from which we first eliminated the anomalies using an isolation forest (IF) algorithm using random partitioning, path length, anomaly score calculation, and thresholding stages. Next, the dataset is utilized for training classification algorithms, such as K-nearest neighbors (KNN), support vector machine (SVM), linear discriminate analysis (LDA), and quadratic discriminant analysis (QDA) to classify the attack and non-attack data of the smart home system. Further, an interplanetary file system (IPFS) is utilized to store classified data (non-attack data) from classification algorithms to confront data-manipulation attacks. The IPFS acts as an onsite storage system, securely storing non-attack data, and its computed hash is forwarded to the blockchain’s immutable ledger. We evaluated the proposed framework with different performance parameters. These include training accuracy (99.53%) by the KNN classification algorithm and 99.27% by IF for anomaly detection. Further, we used the validation curve, lift curve, execution cost of blockchain transactions, and scalability (86.23%) to showcase the effectiveness of the proposed framework.
Ashwag Albakri, Bayan Alabdullah, Fatimah Alhayan
Cyber attack detection is the process of detecting and responding to malicious or unauthorized activities in networks, computer systems, and digital environments. The objective is to identify these attacks early, safeguard sensitive data, and minimize the potential damage. An intrusion detection system (IDS) is a cybersecurity tool mainly designed to monitor system activities or network traffic to detect and respond to malicious or suspicious behaviors that may indicate a cyber attack. IDSs that use machine learning (ML) and deep learning (DL) have played a pivotal role in helping organizations identify and respond to security risks in a prompt manner. ML and DL techniques can analyze large amounts of information and detect patterns that may indicate the presence of malicious or cyber attack activities. Therefore, this study focuses on the design of blockchain-assisted hybrid metaheuristics with a machine learning-based cyber attack detection and classification (BHMML-CADC) algorithm. The BHMML-CADC method focuses on the accurate recognition and classification of cyber attacks. Moreover, the BHMML-CADC technique applies Ethereum BC for attack detection. In addition, a hybrid enhanced glowworm swarm optimization (HEGSO) system is utilized for feature selection (FS). Moreover, cyber attacks can be identified with the design of a quasi-recurrent neural network (QRNN) model. Finally, hunter–prey optimization (HPO) algorithm is used for the optimal selection of the QRNN parameters. The experimental outcomes of the BHMML-CADC system were validated on the benchmark BoT-IoT dataset. The wide-ranging simulation analysis illustrates the superior performance of the BHMML-CADC method over other algorithms, with a maximum accuracy of 99.74%.
Валерій Анатолійович Яланецький
Розвинені демократичні країни стрімко удосконалюють інфраструктуру систем електораль-ного волевиявлення. Технологія блокчейн швидко заполонила дефіцит інновацій в різноманітних сферах людської діяльності. У системи підтримки виборчого процесу також поступово впроваджуються концепції децентралізованого реєстру зберігання голосів та виключення із парадигми голосування третіх зацікавлених осіб. Від третіх осіб, які зазвичай є фальсифікаторами голосів, ніяк не можна було позбутись. Із появою блокчейнів така можливість стає реальністю. Об’єктом дослідження є процес електронного голосування. Предметом дослідження є системи електронного голосування на децентралізованих реєстрах типу блокчейн. Метою роботи є проведення оглядового дослідження існуючих систем електронного голосування на найбільш вживаних, поширених і надійних блокчейнах Bitcoin та Ethereum. Серед досліджених блокчейн-рішень електронного голосування, нажаль, жодне не впроваджено на загальнонаціональному рівні. У майбутніх дослідженнях планується пошук систем електронного голосування на новітніх блокчейнах, зокрема на блокчейні Near Protocol.
Abhinav Jain, Ehan Masud, Michelle Han, Rohan Dhillon · 8 authors
Due to the modern relevance of blockchain technology, smart contracts present both substantial risks and benefits. Vulnerabilities within them can trigger a cascade of consequences, resulting in significant losses. Many current papers primarily focus on classifying smart contracts for malicious intent, often relying on limited contract characteristics, such as bytecode or opcode. This paper proposes a novel, two-layered framework: 1) classifying and 2) directly repairing malicious contracts. Slither’s vulnerability report is combined with source code and passed through a pre-trained RandomForestClassifier (RFC) and Large Language Models (LLMs), classifying and repairing each suggested vulnerability. Experiments demonstrate the effectiveness of fine-tuned and prompt-engineered LLMs. The smart contract repair models, built from pre-trained GPT-3.5-Turbo and fine-tuned Llama-2-7B models, reduced the overall vulnerability count by 97.5% and 96.7% respectively. A manual inspection of repaired contracts shows that all retain functionality, indicating that the proposed method is appropriate for automatic batch classification and repair of vulnerabilities in smart contracts.
Rui Shi, Yang Yang, Yingjiu Li, Huamin Feng · 7 authors
Attribute-based anonymous credentials offer users fine-grained access control in a privacy-preserving manner. However, in such schemes obtaining a user's credentials requires knowledge of the issuer's public key, which obviously reveals the issuer's identity that must be hidden from users in certain scenarios. Moreover, verifying a user's credentials also requires the knowledge of issuer's public key, which may infer the user's private information from their choice of issuer. In this paper, we introduce the notion of double issuer-hiding attribute-based credentials (${\sf DIHAC}$) to tackle these two problems. In our model, a central authority can issue public-key credentials for a group of issuers, and users can obtain attribute-based credentials from one of the issuers without knowing which one it is. Then, a user can prove that their credential was issued by one of the authenticated issuers without revealing which one to a verifier. We provide a generic construction, as well as a concrete instantiation for${\sf DIHAC}$based on structure-preserving signatures on equivalence classes (JOC's 19) and a novel primitive which we calltag-based aggregatable mercurial signatures. Our construction is efficient without relying on zero-knowledge proofs. We provide rigorous evaluations on personal laptop and smartphone platforms, respectively, to demonstrate its practicability.
Joseph Bamidele Awotunde, Tarek Gaber, L V Narasimha Prasad, Sakinat Oluwabukonla Folorunso · 5 authors
The emergence of the Internet of Things (IoT) accelerated the implementation of various smart city applications and initiatives. The rapid adoption of IoT-powered smart cities is faced by a number of security and privacy challenges that hindered their application in areas such as critical infrastructure. One of the most crucial elements of any smart city is safety. Without the right safeguards, bad actors can quickly exploit weak systems to access networks or sensitive data. Security issues are a big worry for smart cities in addition to safety issues. Smart cities become easy targets for attackers attempting to steal data or disrupt services if they are not adequately protected against cyberthreats like malware or distributed denial-of-service (DDoS) attacks. Therefore, in order to safeguard their systems from potential threats, businesses must employ strong security protocols including encryption, authentication, and access control measures. In order to ensure that their network traffic remains secure, organizations should implement powerful network firewalls and intrusion detection systems (IDS). This article proposes a blockchain-supported hybrid Convolutional Neural Network (CNN) with Kernel Principal Component Analysis (KPCA) to provide privacy and security for smart city users and systems. Blockchain is used to provide trust, and CNN enabled with KPCA is used for classifying threats. The proposed solution comprises three steps, preprocessing, feature selection, and classification. The standard features of the datasets used are converted to a numeric format during the preprocessing stage, and the result is sent to KPCA for feature extraction. Feature extraction reduces the dimensionality of relevant features before it passes the resulting dataset to the CNN to classify and detect malicious activities. Two prominent datasets namely ToN-IoT and BoT-IoT were used to measure the performance of this anticipated method compared to its best rivals in the literature. Experimental evaluation results show an improved performance in terms of threat prediction accuracy, and hence, increased security, privacy, and maintainability of IoT-enabled smart cities.
Liuxuan Pan, Owen Vaughan, Craig Wright
The ‘Big Four’ accountancy firms dominate the auditing market, auditing almost all the Financial Times Stock Exchange (FTSE) 100 companies. This leads to people having to accept auditing results even if they may be poor quality and/or for inadequate purposes. In addition, accountants may provide different auditing results with the same financial data. These issues are hard for regulators such as the Financial Reporting Council to identify because of insufficient resources or inconsistent compliance. In this paper, we proposed a triple-entry accounting protocol to allow users to report Bitcoin transactions to a third-party auditor to comply with regulations such as the travel rule. It allows the auditor to easily detect anomalies and identify the non-compliant parties, whilst the blockchain itself provides a transparent and immutable record of these anomalies. Despite building on a public ledger, our solution preserves privacy and offers an interoperability layer for information exchange. Merkle proofs were used to record non-compliant transactions whilst allowing compliant transactions to be pruned from an auditor’s active database.
Ya-nan Li, Tian Qiu, Qiang Tang
Cryptocurrency exchange platforms such as Coinbase, enable users to purchase and sell cryptocurrencies conveniently just like trading stocks/commodities.However, because of the nature of blockchain, when a user withdraws coins (i.e., transfers coins to an external on-chain account), all future transactions can be learned by the platform.This is in sharp contrast to conventional stock exchange where all external activities of users are always hidden from the platform.Since the platform knows highly sensitive user private information such as passport number, bank information etc, linking all (on-chain) transactions raises a serious privacy concern about the potential disastrous data breach in those cryptocurrency exchange platforms.In this paper, we propose a cryptocurrency exchange that restores user anonymity for the first time.To our surprise, the seemingly well-studied privacy/anonymity problem has several new challenges in this setting.Since the public blockchain and internal transaction activities naturally provide many non-trivial leakages to the platform, internal privacy is not only useful in the usual sense but also becomes necessary for regaining the basic anonymity of user transactions.We also ensure that the user cannot double spend, and the user has to properly report accumulated profit for tax purposes, even in the private setting.We give a careful modeling and efficient construction of the system that achieves constant computation and communication overhead (with only simple cryptographic tools and rigorous security analysis); we also implement our system and evaluate its practical performance.We would like to design a cryptocurrency exchange system that could at least restore the user's anonymity/privacy so that it is unlinkable between external transaction records and the user's real identity.
Md. Muneeruddin, U. Prashant, T. Bhanu Prakash
Blockchain technologies deliver an endless variety of applications that benefit from distributed economies. The proposed model is an Android application that has enhanced security features, which include both authentication and authorization. Authentication is incorporated by using a unique identification and authorization is done by using a fingerprint. Voters are also being verified by time password. The security in this project is implemented by using a 128-bit AES encryption algorithm and SHA-256 along with the blockchain. The vote is cast in the form of a transaction, where a blockchain is created, which keeps track of the tallies of votes. Through this, atomicity and integrity are maintained This blockchain-based voting system that satisfies the legal requirements of legislators has been a challenge for a long time. Distributed ledger technologies are an exciting technological advancement in the information technology world Blockchain technologies offer an infinite range of applications, benefiting from sharing economies. This project aims to evaluate the application of blockchain as a service to implement distributed electronic voting systems. The project elicits the requirements for building electronic voting systems and identifies the legal and technological limitations of using blockchain as a service for realizing such systems.
Biegon Kipkoech Collins, Alex Kibet, Andrew M. Kahonge
Amidst rapid technological advancement and digital transformation, ensuring privacy and data security is paramount. Governments and digital service providers face the challenge of establishing secure identification systems that protect individuals' personal information while enabling reliable authentication and seamless user experiences. Traditional identification methods often require individuals to disclose sensitive personal information, leading to privacy risks and potential data breaches. Zero-knowledge proofs (ZKPs) have emerged as a promising solution to address these concerns. By leveraging ZKPs, individuals can authenticate their identities or assert specific attributes without revealing sensitive data. This approach holds great potential for preserving privacy while enabling efficient and trustworthy verification processes. This paper explored ZKPs and how governments and digital service providers can utilize this technology to achieve secure identification while upholding privacy. A key focus was prototyping a secure identification protocol using ZKPs. Through practical implementation, this research aimed to demonstrate the reliability and effectiveness of ZKPs in real-world scenarios. Keywords : zero-knowledge proofs, privacy, digital identity, governments, digital services. DOI: 10.7176/ISDE/13-2-06 Publication date: September 30 th 2023
Universidad Autónoma Metropolitana, Carlos Ortega-Laurel
In this work a guide is proposed, introducing the idea of alternative implementation of blockchain technology to the popularized use as a currency. As an axis of the guide, the use and support of non-fungible token technology (NFT) for the Public Property Registry (RPP) is presented, as an example, which allows us to conceive the different technological and non-technological aspects that the use of this technology would involve in contexts such as the one explained. The research of the technological fund, the institutional-legal fund, and the techno-institutional-legal is exposed, this to holistically foresee the implications that would have the use of the registry transactions of the RPP through a blockchain supported by NFT tokens. Subsequently, and based on the set of variables, the interdisciplinary research problem is externalized, while summarizing the proposal and discussing its derivations and findings. Finally, it concludes by giving an account of the main challenges and guidelines in which any organization or institution with characteristics analogous to the RPP that seeks a digital transformation and innovation in the near future will have to work.
Admirim Aliti, Marika Apostolova, Artan Luma, Azir Aliu · 6 authors
The real industry is crucial sector of the world wide financial system, with significant economic, social and environmental implications. However, real estate transactions are often slow, complex and costly and can be prone to fraud errors, which can lead to significant financial losses and legal disputes. This paper proposes the adoption of blockchain technology in real estate cadastral systems as a solution to the challenges encountered in managing property ownership and transactions. We have described the implementation of our prototype called REMS (Real Estate Management System) and we have presented the deployment of smart contracts in Ethereum platform. Based on measurement, benchmarks and other observation of the system, we have evaluated the server usage of the blockchain network and decided whether Blockchain-as-a-Service (BaaS) should be involved or not in our system. The study results demonstrate the successful implementation of a real estate management system (REMS) using blockchain technology and Ethereum's smart contracts. This study is important because it confirms that similar solutions can be implemented in other areas of public administration, where the structure of the work is similar, i.e. where we deal with issuing documents to citizens.
Birglang Bargayary, Nabajyoti Medhi
Abstract SDN revolutionises network management by providing a centralised controller that enables flexible and effortless configuration of networks. However, this flexibility also leads to a vulnerability that enables the adversary to trick the security system into allowing the installation of unauthorised flow rules in the switches. Blockchain provides us with a way to protect against malicious tampering with flow rules by storing them in the distributed ledger. In this work, we propose FTISCON, a mechanism to preserve the integrity of the OpenFlow flow table that utilizes blockchain technology. We employ the Ethereum Private Blockchain to implement the proof-of-concept and conduct a comparative analysis of the proposed scheme and existing related schemes, evaluating their performance in terms of delay, computation time, transaction cost, and detection rate. The proposed work is found to perform better in each of these. The study results suggest that the proposed approach offers a practical and efficient remedy to prevent flow modification attacks within SDN networks.
Wenjuan Li, Christian T Stidsen, Tobias Adam
Aiming to safeguard a decentralized setup such as smart cities, collaborative intrusion detection system (CIDS) has become a mainstream security mechanism to protect different types of computer networks, especially decentralized computing platforms such as Internet of Things (IoT). The main benefit of CIDS relies on the information sharing process among devices, nodes, software and hardware entities. However, traditional CIDS often requires a trusted third partner, e.g., a centralized computing server, to help build up a trusted communication channel among various entities. Such requirement is not practical in real-world implementation, making the integrity of shared information compromised easily. With the wide adoption, blockchain technology has given a solution to protect the distributed/collaborative detection system. In the current market, blockchain technology has been extensively researched across many detection scenarios, but there is a need to explore how such technology can overall contribute to CIDS and a general distributed detection system. In this work, we introduce a blockchain-assisted security management framework for CIDS, which summarizes and provides an integrated protection given by blockchain. In the case study , we evaluate our proposed framework in both a simulated and a real CIDS setup with challenge-based mechanism. The results demonstrate the promising benefits provided by blockchain in CIDS.
Mark C. Ballandies, Hongyang Wang, Andrew Chung Chee Law, Joshua C. Yang · 6 authors
As digitalization and technological advancements continue to shape the infrastructure landscape, the emergence of blockchain-based decentralized physical infrastructure networks (DePINs) has gained prominence. However, a systematic categorization of DePIN components and their interrelationships is still missing. To address this gap, we conduct a literature review and analysis of existing frameworks and derived a taxonomy of DePIN systems from a conceptual architecture. Our taxonomy encompasses three key dimensions: distributed ledger technology, cryptoeconomic design and physicial infrastructure network. Within each dimension, we identify and define relevant components and attributes, establishing a clear hierarchical structure. Moreover, we illustrate the relationships and dependencies among the identified components, highlighting the interplay between governance models, hardware architectures, networking protocols, token mechanisms, and distributed ledger technologies. This taxonomy provides a foundation for understanding and classifying diverse DePIN networks, serving as a basis for future research and facilitating knowledge exchange, fostering collaboration and standardization within the emerging field of decentralized physical infrastructure networks.
Md. Mamunur Rashid, Piljoo Choi, Suk‐Hwan Lee, Jan Platoš · 6 authors
The Internet of Things (IoT) has become a game-changing technology, bridging the gap between the real and virtual worlds and allowing for smooth data transfer and communication between linked objects. The other two potential technologies are blockchain (BC) and artificial intelligence (AI), whose application areas are incredibly diverse and which may perform best when combined. Since some traditional machine learning (ML) techniques have limitations, this article proposed using distributed machine learning techniques such as federated learning and blockchain to build a more reliable and secure IoT network that will be better protected and less susceptible to outside intrusions. As an alternative to centralized cloud storage, we also recommended using decentralized data storage techniques like the InterPlanetary File System (IPFS) and Hyperledger Fabric (HLF). Additionally, as a proof of concept, we deployed our model using Ethereum Smart Contracts (SC). Using the well-known cybersecurity dataset known as Edge-IIoTset, we utilized both centralized and federated machine learning models to evaluate the efficiency of the suggested approach. The experimental results and successful deployment of Smart Contracts demonstrate that employing Blockchain and distributed storage systems is preferable for safeguarding IoT networks.
Abhay Pratap Singh, A. Sri Ganesh, Rutuja Rajendra Patil, Sumit Kumar · 6 authors
Voting is a democratic process that allows individuals to choose their leaders and voice their opinions. However, the current situation with physical voting involves long queues, paper-based ballots, and security challenges. Blockchain-based voting models have appeared as a method to address the limitations of traditional voting methods. As blockchain is distributed and decentralized, which uses hash functions for securing transactions, it dramatically improves the existing voting system. These digital platforms eliminate the need for physical presence, reduce paperwork, and ensure the integrity of votes through transparent and tamper-proof blockchain technology. This paper introduces a blockchain-based voting model to enhance accessibility, security, and efficiency in the voting process. The research focuses on developing a robust and user-friendly voting system by leveraging the advantages of decentralized technology. The proposed model employs Ethereum as the underlying blockchain platform through an innovative and iterative approach. The model uses Smart contracts to record and validate votes, while AI-based facial recognition technology is integrated to verify the identity of voters. Rigorous testing and analysis are conducted to validate the effectiveness and reliability of the proposed blockchain-based voting model. The system underwent extensive simulation scenarios and stress tests to evaluate its performance, security, and usability.