Searcharxiv⌕ Search

arXiv subjects

Katinka Wolter

Publications and source records attributed to Katinka Wolter.

7 recordsLinked to original sources
arXiv2025

NT-ML: Backdoor Defense via Non-target Label Training and Mutual Learning

Recent studies have shown that deep neural networks (DNNs) are vulnerable to backdoor attacks, where a designed trigger is injected into the dataset, causing erroneous predictions when activated. In this paper, we propose a novel defense mechanism, Non-target label Training and Mutual Learning (NT-ML), which can successfully restore the poisoned model under advanced backdoor attacks. NT aims to reduce the harm of poisoned data by retraining the model with the outputs of the standard training. At this stage, a teacher model with high accuracy on clean data and a student model with higher confidence in correct prediction on poisoned data are obtained. Then, the teacher and student can learn the strengths from each other through ML to obtain a purified student model. Extensive experiments show that NT-ML can effectively defend against 6 backdoor attacks with a small number of clean samples, and outperforms 5 state-of-the-art backdoor defenses.

cs.LG↗
arXiv2024

UKFin+: A Research Agenda for Financial Services

This document presents a research agenda for financial services as a deliverable of UKFin+, a Network Plus grant funded by the Engineering and Physical Sciences Research Council. UKFin+ fosters research collaborations between academic and non-academic partners directed at tackling complex long-term challenges relevant to the UK's financial services sector. Confronting these challenges is crucial to promote the long-term health and international competitiveness of the UK's financial services industry. As one route to impact, UKFin+ includes dedicated funding streams for research collaborations between academic researchers and non-academic organisations. The intended audience of this document includes researchers based in academia, academic funders, as well as practitioners based in industry, regulators, charities or NGOs. It is not intended to be comprehensive or exhaustive in scope but may provide applicants to UKFin+ funding streams and other funding bodies with inspiration for their proposals or at least an understanding of how their proposals align with the broader needs of the UK financial services industry.

cs.CE↗
arXiv2024

DBNode: A Decentralized Storage System for Big Data Storage in Consortium Blockchains

Storing big data directly on a blockchain poses a substantial burden due to the need to maintain a consistent ledger across all nodes. Numerous studies in decentralized storage systems have been conducted to tackle this particular challenge. Most state-of-the-art research concentrates on developing a general storage system that can accommodate diverse blockchain categories. However, it is essential to recognize the unique attributes of a consortium blockchain, such as data privacy and access control. Beyond ensuring high performance, these specific needs are often overlooked by general storage systems. This paper proposes a decentralized storage system for Hyperledger Fabric, which is a well-known consortium blockchain. First, we employ erasure coding to partition files, subsequently organizing these chunks into a hierarchical structure that fosters efficient and dependable data storage. Second, we design a two-layer hash-slots mechanism and a mirror strategy, enabling high data availability. Third, we design an access control mechanism based on a smart contract to regulate file access.

cs.CR↗
arXiv2022

CBlockSim: A Modular High-Performance Blockchain Simulator

Blockchain has attracted much attention from both academia and industry since emerging in 2008. Due to the inconvenience of the deployment of large-scale blockchains, blockchain simulators are used to facilitate blockchain design and implementation. We evaluate state-of-the-art simulators applied to both Bitcoin and Ethereum and find that they suffer from low performance and scalability which are significant limitations. To build a more general and faster blockchain simulator, we extend an existing blockchain simulator, i.e. BlockSim. We add a network module integrated with a network topology generation algorithm and a block propagation algorithm to generate a realistic blockchain network and simulate the block propagation efficiently. We design a binary transaction pool structure and migrate BlockSim from Python to C++ so that bitwise operations can be used to accelerate the simulation and reduce memory usage. Moreover, we modularize the simulator based on five primary blockchain processes. Significant blockchain elements including consensus protocols (PoW and PoS), information propagation algorithms (Gossip) and finalization rules (Longest rule and GHOST rule) are implemented in individual modules and can be combined flexibly to simulate different types of blockchains. Experiments demonstrate that the new simulator reduces the simulation time by an order of magnitude and improves scalability, enabling us to simulate more than ten thousand nodes, roughly the size of the Bitcoin and Ethereum networks. Two typical use cases are proposed to investigate network-related issues which are not covered by most other simulators.

cs.DC↗
arXiv2016

Delay Evaluation of OpenFlow Network Based on Queueing Model

As one of the most popular south-bound protocol of software-defined networking(SDN), OpenFlow decouples the network control from forwarding devices. It offers flexible and scalable functionality for networks. These advantages may cause performance issues since there are performance penalties in terms of packet processing speed. It is important to understand the performance of OpenFlow switches and controllers for its deployments. In this paper we model the packet processing time of OpenFlow switches and controllers. We mainly analyze how the probability of packet-in messages impacts the performance of switches and controllers. Our results show that there is a performance penalty in OpenFlow networks. However, the penalty is not much when probability of packet-in messages is low. This model can be used for a network designer to approximate the performance of her deployments.

cs.DC↗