E-government provides access to services anytime anywhere. There are many e-Government frameworks already exist to integrate e-government services, but efficient full interoperability still a challenge. Interoperability per se can be modeled via four maturity stages, in which the interoperability zone is the holy grail of full interoperability to be reached ultimately with strategy alignment. As e-government services shift in the same way as e-commerce with value chain, this implicitly implies the possibility of benefiting from blockchain with e-government. Blockchain is a nascent promising architecture, whose transactions are permanent, verifiable, and recorded in a distributed ledger. This research article suggests applying blockchain in achieving e- government interoperability. Forms are juxtaposed on the outer borders of the system. These forms adopt those used by UK government, because they are standard as well as they are available for Python developers. Once a form has been completed, PySOA calls the requested service, before storing the data in Ontology Blockchain. After the service is performed, the policies are analyzed in batch processing using quantgov. A report is submitted to the central government periodically. Ontology Blockchain has a dual effect. On the one hand, it works as a secure data storage. On the other hand, it cooperates with PySOA in supporting both technology and semantic interoperability . The most important feature of the proposed method is the presence of (Government Interoperability Zone Alignment; GIZA), which acts as a backbone that coherently connects the internal subcomponents. This linkage is possible, because each form has an title, that corresponds to the appropriate service name. Each service in turn has a counterpart in the wallets stored in Ontology blockchain. To measure interoperability empirically, there is a need for metrics. This study adopts and quantizes a standard interoperability matrix along three dimensions of interoperability of Conceptual (Syntax& Semantics), Organizational (Responsibilities& Organization per se), and Technology (Platform& Communication). While concerns are : data, business, service, and process. Any deviation from the standard could contributes to the interoperability score (counting mismatches) or interoperability grade (counting absolute differences). An estimation is performed, for 1000 total random cases. It is estimated that the probability of getting a conceptual/technical interoperability score as large as the standard strategy score is (713 /1000 = 0.713 (2 in 3). It is estimated too that the probability of getting a organizational interoperability score as large as the standard strategy score is (712 /1000 = 0.712 (2 in 3). Then, Markov model is proposed to provide an accurate representation of the evolution of the strategies over time.
Peter B. Rønne, Arash Atashpendar, Kristian Gjøsteen, Peter Y. A. Ryan
We present an approach for performing the tallying work in the coercion-resistant JCJ voting protocol, introduced by Juels, Catalano, and Jakobsson, in linear time using fully homomorphic encryption (FHE). The suggested enhancement also paves the path towards making JCJ quantum-resistant, while leaving the underlying structure of JCJ intact. The exhaustive, comparison-based approach of JCJ using plaintext equivalence tests leads to a quadratic blow-up in the number of votes, which makes the tallying process rather impractical in realistic settings with a large number of voters. We show how the removal of invalid votes can be done in linear time via a solution based on recent advances in various FHE primitives such as hashing, zero-knowledge proofs of correct decryption, verifiable shuffles and threshold FHE. We conclude by touching upon some of the advantages and challenges of such an approach, followed by a discussion of further security and post-quantum considerations.
Elie Kfoury, Jose Gomez, Jorge Crichigno, Elias Bou‐Harb · 5 authors
Network Address Translation (NAT) is a method that enables devices with private IP addresses to connect to the Internet by sharing a public IP address. Traversing the NAT device remains a challenge for a wide range of applications such as Voice over IP (VoIP) and Internet of Things (IoT). The Port Control Protocol (PCP) is a relatively new protocol standardized by the Internet Engineering Task Force (IETF) to solve the NAT traversal issues. It allows a NATed device to request and manage a mapping between its private IP address and transport-layer port to a public IP address and port. As PCP requires an application-dependent method for distributing the mappings to remote hosts, several attacks can target the distributing server and render the communication channel vulnerable. In this paper, we propose and implement a decentralized Blockchain-based approach for distributing PCP-mappings, enabling secure end-to-end (e2e) direct communications without any trusted third party server. NATed devices register their PCP mappings and public keys into the Blockchain, and other peers can then learn about these mappings to establish end-to-end secure direct communications. The implementation verifies that the system is feasible in terms of transactions fees, can simplify and secure end-to-end direct communications, and can interwork with conventional security methods.
Permissionless Blockchains sind dezentrale Systeme, die Konsens erzielen. Das prominenteste Beispiel einer Permissionless Blockchain ist das elektronische Zahlungssystem Bitcoin, welches Konsens über die von Teilnehmern des Systems erzeugten Finanztransaktionen erzielt. Während verteilter Konsens seit Jahrzehnten Gegenstand zahlreicher Forschungsarbeiten ist, ist Bitcoin das erste bekannte System, welches Konsens im sog. permissionless-Modell erzielt, d.h. ohne die vorausgehende Feststellung der Identitäten der Teilnehmer des Systems. Die Teilnehmer von Permissionless Blockchains kommunizieren über ein unstrukturiertes Peer-to-Peer (P2P) Netzwerk miteinander. Da das Verfahren zur Konsensbildung von Permissionless Blockchains auf Daten basiert, die über dieses P2P-Netzwerk übertragen werden, können Sicherheitslücken in der Netzwerkschicht auch die Konsensbildung und damit die angestrebte Funktion des Systems beeinflussen. Während unstrukturierte P2P-Netzwerke in der Vergangenheit umfassend analysiert wurden, führt ihr Einsatz in Permissionless Blockchains zu Sicherheitsanforderungen und Angreifermodellen, die bisher noch nicht berücksichtigt wurden. Obwohl einzelne Angriffe auf die Netzwerkschicht von Permissionless Blockchains analysiert wurden, ist unklar, welche Sicherheitseigenschaften die Netzwerkschicht von Permissionless Blockchains haben sollte. Diese Unklarheit motiviert die erste in dieser Dissertation behandelte Forschungsfrage: Wie können Anforderungen und Zielkonflikte, die in den Mechanismen der Netzwerkschicht von Permissionless Blockchains vorhanden sind, untersucht werden? In dieser Dissertation wird eine Systematisierung von Angriffen auf die Netzwerkschicht von Bitcoin vorgestellt, in der Angriffe hinsichtlich der angegriffenen Mechanismen und der Auswirkungen der Angriffe auf höhere Schichten des Systems kategorisiert werden. Basierend auf der Systematisierung werden fünf Anforderungen für die Netzwerkschicht von Permissionless Blockchains abgeleitet: Leistung, niedrige Beteiligungskosten, Anonymität, Robustheit gegen Denial-of-Service Angriffe sowie Topologieverschleierung. Darüber hinaus werden der Entwurfsraum der Netzwerkschicht aufgezeigt und der Einfluss von Entwurfsentscheidungen auf die Erfüllung von Anforderungen qualitativ untersucht. Die durchgeführten Systematisierungen weisen auf inhärente Zielkonflikte sowie Forschungsmöglichkeiten hin und unterstützen die Entwicklung von Permissionless Blockchains. Weiterhin wird auf Grundlage von seit 2015 durchgeführten Messungen eine Charakterisierung des Bitcoin-P2P-Netzwerks präsentiert. Die Charakterisierung ermöglicht die Parametrisierung und Validierung von Simulationsmodellen und die Bewertung der Zuverlässigkeit von realen Experimenten. Darüber hinaus gewährt die Netzwerkcharakterisierung Einblicke in das Verhalten von Netzwerkknoten und deren Betreibern. Beispielsweise kann gezeigt werden, dass Sybil-Ereignisse in der Vergangenheit im Bitcoin-P2P-Netzwerk stattgefunden haben und dass die Leistung und die Anonymitätseigenschaften der Transaktions- und Blockausbreitung durch Implementierungs- und Protokolländerungen verbessert worden sind. Auf Grundlage dieser Charakterisierung werden zwei ereignisdiskrete Simulationsmodelle des Bitcoin-P2P-Netzwerks entworfen. Die Modelle werden durch einen Vergleich der simulierten Informationsausbreitungsverzögerung mit der beobachteten Informationsausbreitungsverzögerung im realen Netzwerk validiert. Da der Vergleich eine hohe Übereinstimmung zeigt, ermöglichen die vorgestellten Simulationsmodelle die Simulation des Bitcoin-Netzwerks mit einer Genauigkeit, die für die Analyse von Angriffen im Bitcoin-Netzwerk ausreicht. Die vorgestellten Simulationsmodelle sowie die durchgeführte Systematisierung von Angriffen verdeutlichen die Bedeutung der Kenntnis der Netzwerktopologie als Grundlage für Forschung und die Analyse von Deanonymisierungsangriffe. Daher adressiert die zweite Forschungsfrage dieser Dissertation Methoden der Topologieinferenz und der Deanonymisierung: Unter welchen Voraussetzungen und in welchem Maße sind netzwerkbasierte Topologieinferenz und Deanonymisierung in Bitcoin (un)möglich? Diese Frage wird durch Anwendung der vorgeschlagenen Methodenkombination aus Messungen, Simulationen und Experimenten beantwortet. In dieser Dissertation werden vier verschiedene Methoden zur Topologieinferenz vorgestellt und unter Verwendung von Experimenten und Simulationsstudien analysiert. Anhand von Experimenten wird gezeigt, dass ein Angreifer, der in der Lage ist, Verbindungen zu allen Knoten des Netzwerks zu etablieren, die direkten Nachbarn eines Netzwerkknotens mit hoher Sensitivität (recall) und Genauigkeit (precision) (87% recall, 71% precision) durch die Veröffentlichung von widersprüchlichen Transaktionen im Netzwerk herausfinden kann. Unter der Annahme eines passiven Angreifers, der in der Lage ist, sich mit allen erreichbaren Netzwerkknoten zu verbinden, war 2016 ein Rückschluss auf die Nachbarn eines Netzwerkknotens mit einer Sensitivität von 40% bei einer Genauigkeit von 40% durch Beobachtung von mindestens acht Transaktionen, die von diesem Netzwerkknoten stammen, möglich. Darüber hinaus ist es möglich, die Akkumulation mehrere Transaktionen zum Zwecke der Topologieinferenz zu geringen Kosten auszunutzen. Allerdings bleibt die erwartete Inferenzqualität aufgrund fehlender Validierungsmöglichkeiten unklar. Schließlich kann simulativ gezeigt werden, dass der Peer-Discovery-Mechanismus eines P2P-Netzwerks bei bestimmte Parametrisierungen Topologinferenz ermöglichen kann. Abschließend wird die Möglichkeit einer netzwerkbasierten Deanonymisierung bewertet, indem analysiert wird, ob eine Korrelation zwischen der IP-Adresse des Netzwerkknotens, der eine Transaktion veröffentlicht, und dem mutmaßlichen Ersteller der Transaktion besteht. Der zugrundeliegende Datensatz basiert auf den durchgeführten Messungen und besteht aus fast 10 Millionen Transaktionen mit zugehörigen IP-Adressen. Es wird gezeigt, dass Transaktionen von 5% bis 8.3% der Benutzer auffallend häufig von einzelnen Netzwerkknoten veröffentlicht wurden, was diese Benutzer dem Risiko netzwerkbasierter Deanonymisierungsangriffe aussetzt.
Carlos Eduardo Tofanim, Gabriel Moralo da Costa, Jean Paul Pezzutti, Matheus Casarin Giaculi
This study investigates the feasibility of applying blockchain technology to enhance the security and transparency of electronic voting systems. The research analyzes potential vulnerabilities and trust challenges associated with traditional electronic voting infrastructure and explores how distributed ledger technologies can be used to improve vote integrity and auditability. A prototype voting system was developed to simulate an online voting environment using blockchain as the underlying data storage mechanism. The system was implemented as a web application using ASP.NET MVC and C# within the .NET Framework environment, with blockchain functionality integrated through an open-source implementation adapted for the study. The prototype demonstrates how votes can be recorded as blockchain transactions, ensuring immutability and distributed verification of voting data. The architecture also includes a web-based user interface for vote selection and confirmation, as well as backend blockchain validation mechanisms responsible for maintaining the integrity of the distributed ledger. The study evaluates the technical feasibility of integrating blockchain with electronic voting processes and discusses potential advantages such as improved transparency, tamper resistance, and decentralized validation of election results. Although the study focuses primarily on the technical feasibility and proof-of-concept implementation, the findings suggest that blockchain-based voting systems could represent a promising approach for improving trust and security in digital electoral systems. Future research directions include scalability analysis, infrastructure requirements for nationwide implementation, and mechanisms for secure voter verification.
Distributed ledgers are institutional technologies that pose complex challenges regarding regulation and inter-jurisdictional competition. This chapter introduces ‘crypto-friendly’ public policy as a way to understand these challenges. Blockchains are relevant to public policy in at least three ways. First, they can be adopted by governments for the provision of public services. Second, many blockchain applications interact with existing regulatory frameworks and may provide new regulatory challenges. Third, they present the possibility of ‘crypto-secession’ as a form of privately provided public goods provision. The chapter applies an institutional theory of regulation to assess how blockchains effect relative institutional costs and guide public policy choices. Blockchain applications such as property rights and identity management are also considered. Finally the chapter considers the possibility of crypto-friendliness as a dimension for international regulatory competition.
Leyi Shi, Yang Li, Tianxu Liu, Jia Liu · 6 authors
Honeypot technology can be applied to efficiently attract attackers and exhaust their resources. However, the traditional static honeypot is easy to be recognized by anti-honeypot technology. By contrast, most of the dynamic honeypots can simulate the real system in time, thus interacting with an intruder in disguise. In this paper, we employ the dynamic property of honeypot in four kinds of services of our system. However, this dynamic property shows up in a location and identification, indicating that genuine or fake services (honeypots) are changeable in different hosts. Thus, the dynamic property of our system differs from the dynamic honeypot aforementioned. Besides, we adopt the blockchain platform (Ethereum) to decentralize our system and store the port access data by delivering a private chain. To illustrate the effectiveness of our scheme in theory and practice, security analysis, eavesdropping attack, scanning attack, and DoS attack experiments are conducted. The results show that our scheme is valid in safeguarding against network attack.
Hai Wang, Yong Wang, Zigang Cao, Zhen Li · 5 authors
The blockchain, with its own characteristics, has received much attention at the beginning of its birth and been applied in many fields. At the same time, however, its security issues are exposed constantly and cyber attacks have caused significant losses in it. At present, there is little concern and research in the field of network security of the blockchain. This paper introduces the applications of blockchain in various fields, systematically analyzes the security of each layer of the blockchain and possible cyber attacks, expounds the challenges brought by the blockchain to network supervision, and summarizes research progress in the protection technology. This paper is a review of the current security of the blockchain and will effectively help the development and improvement of security technologies of the blockchain.
Open access
Blockchain Technology Applications and Security
Advanced Steganography and Watermarking Techniques
Jordi Paillissé, Jan Manrique, Guillem Bonet, Alberto Rodríguez-Natal · 6 authors
Inter-domain routing security is of critical importance to the Internet since it prevents unwanted traffic redirections. The current system is based on a Public Key Infrastructure (PKI), a centralized repository of digital certificates. However, the inherent centralization of such design creates tensions between its participants and hinders its deployment. In addition, some technical drawbacks of PKIs delay widespread adoption. In this paper we present IPchain, a blockchain to store the allocations and delegations of IP addresses. IPchain leverages blockchains' properties to decentralize trust among its participants, with the final goal of providing flexible trust models that adapt better to the ever-changing geopolitical landscape. Moreover, we argue that Proof of Stake is a suitable consensus algorithm for IPchain due to the unique incentive structure of this use-case, and that blockchains offer relevant technical advantages when compared to existing systems, such as simplified management. In order to show its feasibility and suitability, we have implemented and evaluated IPchain's performance and scalability storing around 350k IP prefixes in a 2.5 GB chain.
As an important method of making democratic decisions, voting has always been a topic of social concern. Compared with the traditional, e-voting is widely used in various decision scenarios because of the convenience, easy to participate and low cost. However, the proposed e-voting protocols are at the risk of excessive authority and tampered information, which makes it impossible to achieve true fairness and transparency in e-voting. By combining the blockchain technology, it enables to solve these problems with the decentralization and tamper-resistant features. Moreover, the misoperations of the voters will also affect this fairness, such as voting for non-candidates, abstention or repeated voting. Therefore, to ensure the efficiency of the voting process and maintain the fairness of the voting environment, it is important to append the function of audit in e-voting protocol. This paper proposes an e-voting protocol based on blockchain, which provides transparency in the process of voting. At the same time, this scheme has the ability to audit voters operating incorrectly and resist quantum attacks by adopting the certificateless and code-based cryptography. After performance analysis, our scheme is suitable for the small-scale election and has some advantages in security and efficiency when the number of voters is small.
Flexible regulation of smart grid is vital for grid operation. This paper proposes a smart grid data aggregation and regulation mechanism based on consortium blockchain, and its signcryption algorithm can be applied to multidimensional data acquisition and multiple receivers in the consortium blockchain. In the process of regulation, the control center, the grid operator, and the equipment supplier receive fixed-height blocks from the blockchain and obtain plaintext from the decryption. Each receiver analyzes the multidimensional data and formulates corresponding control policies for individual users. Grid operators implement user power regulation by feedback on smart contracts. The security analysis and performance comparison show that the proposed scheme has advantages in computing and communication costs while meeting security requirements for confidentiality and data integrity.
Jordi Paillissé, Jordi Subira, Albert López, Alberto Rodríguez-Natal · 7 authors
The specification and enforcement of network-wide policies in a single administrative domain is common in today's networks and considered as already resolved. However, this is not the case for multi-administrative domains, e.g. among different enterprises. In such situation, new problems arise that challenge classical solutions such as PKIs, which suffer from scalability and granularity concerns. In this paper, we present an extension to Group-Based Policy -- a widely used network policy language -- for the aforementioned scenario. To do so, we take advantage of a permissioned blockchain implementation (Hyperledger Fabric) to distribute access control policies in a secure and auditable manner, preserving at the same time the independence of each organization. Network administrators specify polices that are rendered into blockchain transactions. A LISP control plane (RFC 6830) allows routers performing the access control to query the blockchain for authorizations. We have implemented an end-to-end experimental prototype and evaluated it in terms of scalability and network latency.
Mohsin Ur Rahman, Fabrizio Baiardi, Barbara Guidi, Laura Ricci
Decentralized Online Social Networks (DOSNs) have been proposed as an alternative solution to the current centralized Online Social Networks (OSNs). Online Social Networks are based on centralized architecture (e.g., Facebook, Twitter, or Google+), while DOSNs do not have a service provider that acts as central authority and users have more control over their information. Several DOSNs have been proposed during the last years. However, the decentralization of the OSN requires efficient solutions for protecting the privacy of users, and to evaluate the trust between users. Blockchain represents a disruptive technology which has been applied to several fields, among these also to Social Networks. In this paper, we propose a manageable, user-driven and auditable access control framework for DOSNs using blockchain technology. In the proposed approach, the blockchain is used as a support for the definition of privacy policies. The resource owner uses the public key of the subject to define flexible role-based access control policies, while the private key associated with the subject's Ethereum account is used to decrypt the private data once access permission is validated on the blockchain. We evaluate our solution by exploiting the Rinkeby Ethereum testnet to deploy the smart contract, and to evaluate its performance. Experimental results show the feasibility of the proposed scheme in achieving auditable and user-driven access control via smart contract deployed on the Blockchain.
Zero-Knowledge Proof-of-Identity from trusted public certificates (e.g., national identity cards and/or ePassports; eSIM) is introduced here to permissionless blockchains in order to remove the inefficiencies of Sybil-resistant mechanisms such as Proof-of-Work (i.e., high energy and environmental costs) and Proof-of-Stake (i.e., capital hoarding and lower transaction volume). The proposed solution effectively limits the number of mining nodes a single individual would be able to run while keeping membership open to everyone, circumventing the impossibility of full decentralization and the blockchain scalability trilemma when instantiated on a blockchain with a consensus protocol based on the cryptographic random selection of nodes. Resistance to collusion is also considered. Solving one of the most pressing problems in blockchains, a zk-PoI cryptocurrency is proved to have the following advantageous properties: - an incentive-compatible protocol for the issuing of cryptocurrency rewards based on a unique Nash equilibrium - strict domination of mining over all other PoW/PoS cryptocurrencies, thus the zk-PoI cryptocurrency becoming the preferred choice by miners is proved to be a Nash equilibrium and the Evolutionarily Stable Strategy - PoW/PoS cryptocurrencies are condemned to pay the Price of Crypto-Anarchy, redeemed by the optimal efficiency of zk-PoI as it implements the social optimum - the circulation of a zk-PoI cryptocurrency Pareto dominates other PoW/PoS cryptocurrencies - the network effects arising from the social networks inherent to national identity cards and ePassports dominate PoW/PoS cryptocurrencies - the lower costs of its infrastructure imply the existence of a unique equilibrium where it dominates other forms of payment