- Blockchain Technology Applications and Security
- Distributed systems and fault tolerance
- Cloud Computing and Resource Management
- Caching and Content Delivery
- Peer-to-Peer Network Technologies
- Cryptography and Data Security
- FinTech, Crowdfunding, Digital Finance
- Access Control and Trust
- Privacy-Preserving Technologies in Data
- Auction Theory and Applications
- Business Process Modeling and Analysis
- Cognitive Functions and Memory
- Information and Cyber Security
- IoT and Edge/Fog Computing
- Security and Verification in Computing
- Cloud Data Security Solutions
- Advanced Memory and Neural Computing
- Stochastic Gradient Optimization Techniques
- Transportation and Mobility Innovations
- Digital Rights Management and Security
- Software-Defined Networks and 5G
- Internet Traffic Analysis and Secure E-voting
University of Copenhagen
2022-2024
Cardiff University
2018-2020
The exponential growth of the blockchain size has become a major contributing factor that hinders decentralisation and its potential implementations in data-heavy applications. In this paper, we propose segment blockchain, an approach segmentises enables nodes to only store copy one segment. We use PoW as membership threshold limit number taken by Adversary-the Adversary can gain at most n/2 network n when it 50% calculation power system (the Nakamoto security threshold). A fails stores all...
Bitcoin-derived blockchain has shown promise as infrastructure for many decentralized models. However, problems are withholding the realization of potentials. The booming increase storage demand hindered devices with shortage to use powered distributed applications. In this paper, we present section-blockchain, a new protocol, which is designed solve oversize problem without compromise security blockchain. There no full nodes or lightweight nodes, all equal and contributing...
Sharding is a critical technique that enhances the scalability of blockchain technology.However, existing protocols often assume adversarial nodes in general term without considering different types attacks, which limits transaction throughput at runtime because attacks on liveness could be mitigated.There have been attempts to increase by separately handling attacks; however, they security vulnerabilities.This paper introduces Reticulum, novel sharding protocol overcomes these limitations...
Blockchain mining should not be a game among power oligarchs. In this paper, we present the Multiple Winners Proof of Work Protocol (MWPoW), mining-pool-like decentralised blockchain consensus protocol. MWPoW enables disadvantaged nodes which post only small amount calculation resource in to create blocks together and compete with oligarchs without centralised representatives. A precise Support Rate can determined through process; mechanism mainchain determination is therefore changed has...
Traditional Blockchain Sharding approaches can only tolerate up to n/3 of nodes being adversary because they rely on the hypergeometric distribution make a failure (an does not have globally but manipulate consensus Shard) hard happen. The system must maintain large Shard size (the number inside sustain low probability so that small Shards may exist. In this paper, we present new approach withstand n/2 bad. We categorise into different classes, and every has fixed from classes. prove design...
Blockchain sharding splits a blockchain into several shards where consensus is reached at the shard level rather than over entire blockchain. It improves transaction throughput and reduces computational resources required of individual nodes. But derivation trustworthy within becomes an issue as longest chain based mechanisms used in conventional blockchains can no longer be used. Instead, vote-based mechanism must employed. However, existing Byzantine fault tolerance protocols do not offer...
Smart contracts executed on blockchains are interactive programs where external actors generate events that trigger function invocations. Events can be emitted by participants asynchronously. However, some functionalities should restricted to inhabiting specific roles in the system, which might dynamically adjusted while system evolves. We argue current smart contract languages adopting imperative programming paradigms require additional complicated access control code. Furthermore, often...
Blockchain sharding protocols randomly distribute nodes to different shards. They limit the quantity of shards ensure that adversary remains a minority inside each shard with high probability. There can exist only small number In this article, we propose new protocol links population in real-time instead fixed upper-bounded population. The is two-phase design. First, several committee are constructed where majority honest probability; then, splits into worker likelihood at least one node...
In this article, we present designs for a Multi Winner Proof of Work (MWPoW) consensus primitive. MWPoW is protocol that places the group mining idea directly into to prevent power centralization, higher general reward expectation among participants and shorten interval time block generation. It makes every miner component one three groups assigned by network, not as an individual competitor; all users in winner receive compensation. The hash difficulty than ordinary blockchain because there...
Blockchain sharding is a promising approach to solving the dilemma between decentralisation and high performance (transaction throughput) for blockchain. The main challenge of systems how reach decision on statement among sub-group (shard) people while ensuring whole population recognises this statement. Namely, prevent an adversary who does not have majority nodes globally but inside shard. Most approaches can only correct consensus shard with at most $n/3$ evil in $n$ node system. There...
With the increasingly widespread application of machine learning, how to strike a balance between protecting privacy data and algorithm parameters ensuring verifiability learning has always been challenge. This study explores intersection reinforcement privacy, specifically addressing Multi-Armed Bandit (MAB) problem with Upper Confidence Bound (UCB) algorithm. We introduce zkUCB, an innovative that employs Zero-Knowledge Succinct Non-Interactive Argument Knowledge (zk-SNARKs) enhance UCB....
With the increasingly widespread application of machine learning, how to strike a balance between protecting privacy data and algorithm parameters ensuring verifiability learning has always been challenge. This study explores intersection reinforcement privacy, specifically addressing Multi-Armed Bandit (MAB) problem with Upper Confidence Bound (UCB) algorithm. We introduce zkUCB, an innovative that employs Zero-Knowledge Succinct Non-Interactive Argument Knowledge (zk-SNARKs) enhance UCB....
Abstract Smart contracts executed on blockchains are interactive programs where external actors generate events that trigger function invocations. Events can be emitted by participants asynchronously. However, some functionalities should restricted to inhabiting specific roles in the system, which might dynamically adjusted while system evolves. We argue current smart contract languages adopting imperative programming paradigms require additional complicated access control code. Furthermore,...
Vote-based blockchains construct a state machine replication (SMR) system among participating nodes, using Byzantine Fault Tolerance (BFT) consensus protocols to transition from one another. Currently, they rely on either synchronous or partially networks with leader-based coordination costly Asynchronous Common Subset (ACS) in asynchronous settings, making them impractical for large-scale applications. To make SMR scalable, this paper proposes \emph{validated strong} BFT model that allows...
Distributed Ledger Technology (DLT) is promising to become the foundation of many decentralised systems. However, unbalanced and unregulated network layout contributes inefficiency DLT especially in Internet Things (IoT) environments, where nodes connect only a limited number peers. The data communication speed globally does not live up constraints efficient real-time distributed In this paper, we introduce new protocol, which enables calculate tradeoff between connecting/disconnecting peer...
A decade long thrive of cryptocurrency has shown its potential as a source alternative-finance and the security robustness underpinning blockchain technology. However, most cryptocurrencies fail to show inimitability their meanings in real world. As result, they usually start off favourites but quickly become outcasts digital asset market. The society attempts anchor value cryp-tocurrency with values by employing smart contracts link it computation resources digital-productivity that have...
A decade long thrive of cryptocurrency has shown its potential as a source alternative-finance and the security robustness underpinning blockchain technology. However, most cryptocurrencies fail to show inimitability their meanings in real world. As result, they usually start off favourites but quickly become outcasts digital asset market. The society attempts anchor value with values by employing smart contracts link it computation resources digital-productivity that have demands But some...
We provide a practical translation from the Dynamic Condition Response (DCR) process modelling language to Transaction Execution Approval Language (TEAL) used by Algorand blockchain. Compared earlier implementations of business notations on blockchains, particularly Ethereum, present implementation is four orders magnitude cheaper. This has following immediate ramifications: (1) It allows decentralised execution DCR-specified processes in absence expensive intermediaries (lawyers, brokers)...
Sharding is essential for improving blockchain scalability. Existing protocols overlook diverse adversarial attacks, limiting transaction throughput. This paper presents Reticulum, a groundbreaking sharding protocol addressing this issue, boosting Reticulum employs two-phase approach, adapting throughput based on runtime attacks. It comprises "control" and "process" shards in two layers. Process contain at least one trustworthy node, while control have majority of trusted nodes. In the first...