[] “Methods in Learning Graph Representations of Programs for Malware Detection”
Research Literature Review, Apr 2025.
Authors: Pascal U
Abstract: Malicious software poses a pervasive threat in the domain of cybersecurity.
Malware authors systematically develop sophisticated evasion techniques such as code obfuscation and abstraction, to bypass defence mechanisms.
Conventional signature-based detection have no mechanism for identifying zero-day attacks or code abstractions, conversely, traditional machine learning methods, leveraging static and dynamic heuristics, are increasingly hindered by concept-drift and act as black-boxes with no mechanism for identifying malicious patterns for analysis.
To overcome the limitations of previous methods, graph representation learning (GRL) has emerged as a robust alternative, able to capture both a global view, and fine-grained information about a program.
This review attempts to dissect the most relevant research papers and identify key challenges faced, and shortcomings present in the overall space of GRL malware detection.
Though this review is particularly focused on GNN-based GRL pipelines, many of the challenges are also relevant for shallow embedding-based pipelines, and are thus discussed in some detail to highlight advantages of GNN-based pipelines.
Namely, their end-to-end optimisation of learned representations, allow patterns to be learned directly through the loss function of the model.
Further, shallow embeddings have no direct mechanism to implement explainable AI evaluators such as GNNExplainer.
This review walks through the entire GRL pipeline for identifying and analysing malware, from binary disassembly, code transformation and graph pre-processing, methods of graph representation in learned vector embeddings, and finally a brief discussion of classification techniques and explainability.
The final main part of this review discusses challenges in the domain and potential avenues for future work.
Further, the Tesseract framework is invoked to discuss challenges with spatio-temporal bias and concept drift, where the vast majority of papers surveyed, did not meet the constraints laid out by the framework.
As graph-based classifiers remain preeminent, they are increasingly susceptible to sophisticated problem-space adversarial attacks, malicious actors find creative ways of perturbing underlying graph structures while preserving executable functionality, thereby demanding the need for evaluation of model robustness in future classifier designs.
[] Lecture Notes for
COMP0061 Privacy Enhancing Technologies, Apr 2026.
Overview: These lecture notes introduce privacy-enhancing technologies through both conceptual and cryptographic perspectives.
They begin with privacy harms and the distinction between hard and soft PETs, then examine communication privacy through end-to-end encryption, Diffie-Hellman key exchange, hybrid encryption, and perfect forward secrecy.
The notes further cover anonymous communication systems, including mix networks, traffic analysis, and Tor-style onion routing, before moving to privacy-preserving computation using homomorphic encryption, secret sharing, zero-knowledge proofs, multi-party computation, and private set intersection.
Overall, the material emphasizes how cryptographic mechanisms can minimise data exposure while preserving confidentiality, authenticity, anonymity, and computational utility.
[] Lecture Notes for
COMP0025 Introduction to Cryptography, Apr 2026.
Overview: These lecture notes provide a introduction to modern cryptography, beginning with formal security definitions, adversarial models, and proof-based reasoning.
They develop private-key encryption through perfect secrecy, computational indistinguishability, pseudorandomness, block ciphers, stream ciphers, and authenticated encryption.
The notes then extend to hash functions, message authentication, public-key encryption, digital signatures, certificates, key establishment, secret sharing, commitment schemes, identification protocols, and zero-knowledge proofs.
Overall, the material emphasizes how practical cryptographic constructions are justified through precise security games, hardness assumptions, and reductions.
[] “Honeypot Allocation for Network Hardening in Industrial Control Systems”
Final Year Project for BSc Computer Science, May 2025.
Authors: Pascal U
Abstract: This project studies the problem of network hardening in industrial control systems (ICSs) given an administrator having limited resources to allocate.
ICSs are a frequent target of attacks because of their importance to infrastructure and their notoriety for utilising legacy systems.
Honeypots (HPs) have been used as a form of intrusion detection system which can detect a vast swathe of possible attacks.
However, given that the administrator can only afford to have a select number HPs within a system, an allocation technique is required.
I propose a game-theoretic framework, which models a defender and attacker against each other, both attempting to maximise their stated goals.
This is done through a reward function that rewards the defender for successfully intercepting an attack, but penalises it for non-interceptions.
The attacker's reward function is the direct inverse of this and as such this game is what is called a Zero-Sum game.
The creation and preparation of the game-action space is done by utilising a novel graph generator and reducing it through creating what are known as CAGs so that the complexity of the action space is reasonable for large network sizes.
Analysis is conducted on various graph topology sizes in evaluating the performance and scalability of the model, including varying key parameters and their effects on the game outcome.
[] “Chest X-Ray Image Enhancement Using The LED Framework”
Deep Learning and Advanced AI Coursework, May 2025.
Authors: Ted Arlidge, Dawid Grzywocz, Pascal U
Abstract: Using the LED diffusion model as a framework, we evaluate its effectiveness in enhancing low quality chest x-rays (CXR).
The dataset used is a subset of the PadChest dataset containing 1000 super-negative exposure (low-quality) CXR images, and 1000 near-zero exposure (high-quality).
Following the LED framework, we first implement a CycleGAN to learn a degradation mapping between unpaired high-quality and low-quality images, creating a paired dataset of high-quality images and their generated mapping.
Then a conditional diffusion model is trained to learn the inverse. Evaluating on a pre-trained ResNet-18 model, our enhancing diffuser demonstrates improvement in diagnostic accuracy on low-quality CXRs from 56.6% to 66.3%, narrowing most of the gap to high-quality images (73.9%).
[] Lecture Notes for Weeks 1-6
Deep Learning and Advanced AI, May 2025.
Overview: This review document provides a concise overview of key deep-learning and advanced AI concepts, beginning with the Transformer architecture
and its core self-attention mechanism (including multi-head attention, residual connections, masking, and positional encodings such as sinusoidal, RoPE, and ALiBi);
it then explores large language and multimodal models (covering LLMs, Vision-Language Models, Mixture of Experts, parameter-efficient fine-tuning, extended-context transformers, and normalization techniques); proceeds to Vision Transformers alongside various autoencoder structures (standard, variational, masked, and U-Net segmentation networks);
and concludes with generative modelling frameworks (detailing the Evidence Lower Bound for VAEs, diffusion processes and Stable/Late Diffusion strategies, as well as adversarial methods like GANs and CycleGANs for unpaired image translation).
[] Lecture Notes for Weeks 1-10
Ethical Hacking and Pentesting, May 2025.
Overview: This review synthesizes core ethical‐hacking and penetration-testing topics: it begins with web security fundamentals
(HTTP, cookies, SQL injection, clickjacking), then examines common web-based attacks like CSRF and XSS;
it proceeds to system vulnerabilities including Shellshock, format-string exploits, buffer overflows, and associated shellcode techniques;
it covers low-level perspectives on C compilation, ELF binaries, assembly, the call stack, and binary analysis;
surveys malware classes (Trojans, viruses, worms, droppers, backdoors, botnets, ransomware, wipers, cryptominers);
and concludes with networking essentials (IP/UDP/TCP mechanics, ARP, firewalls, DNS spoofing/rebinding, and transport-layer attacks).
[] Part A:
Ethical Hacking and Pentesting Coursework, Apr 2025.
This assignment is based on labs 2 and 3, which cover XSS, CSRF, and shellshock, three common vulnerabilities found in web applications.
The report will therefore be presented in three sections. The tasks refer to the lab exercises, although not all lab exercises are to be used in the report.
[] Part B:
Ethical Hacking and Pentesting Coursework, Apr 2025.
The objective of this coursework is to analyse an ELF binary using various inspection tools.
The coursework is modelled on the static analysis lab.
Students will complete the tasks detailed below and submit a structured report answering specific questions about ELF headers, sections, segments, symbol tables, the GOT, and the PLT.
[] Lecture Notes for Weeks 7-10
Privacy Enhancing Technologies, Jan 2025.
Overview: This document delivers concise revision notes on Privacy Enhancing Technologies, spanning weeks 7–10: it begins with
secure messaging—defining IND-CPA/CCA security, digital‐signature unforgeability, AEAD schemes, key‐derivation chains, and the Double Ratchet/Signal protocol’s privacy guarantees;
moves to private‐function evaluation, covering MLS’s TreeKEM group key management, ElGamal (and exponentiation) homomorphic properties, lattice problems, LWE-based encryption, and the foundations of leveled and fully homomorphic encryption;
and concludes with privacy-preserving machine learning—including CryptoNets and TFHE schemes for encrypted inference, differential‐privacy mechanisms and theorems, federated learning models (cross-device and cross-silo), and secure aggregation via masking, homomorphic encryption, and multiparty computation.
[] “A Novel Approach to Optimising Convolutional Neural Networks based on the Ant Colony Optimiser”
Computational Intelligence Coursework, Dec 2024.
Authors: Ted Arlidge, Saul Roche, Pascal U
Abstract: This paper explores the application of Continuous Ant Colony Optimisation (CACO) for optimising Convolutional Neural Networks (CNNs)
and compares its performance to popular gradient descent and population-based optimisation algorithms.
The study evaluates these optimisation techniques in the context of training CNNs to classify images from the CIFAR- 10 dataset, a standard benchmark widely used for training in machine learning problems.
Our analysis shows that gradient descent continues to outperform population-based in terms of efficiency and accuracy.
However, CACO achieves the best loss due to its superior ability to reach generalised solutions, and we discuss the relative advantages and limitations which lead to this result.