Lattice-based swarm attestation

Modern large-scale systems increasingly comprise numerous heterogeneous and resource-constrained devices. Swarm attestation schemes have been introduced to address the scalability and efficiency limitations of traditional single-prover, single-verifier attestation approaches. However, existing swarm attestation protocols rely on classical cryptographic assumptions, primarily the integer factorization problem and the discrete logarithm problem. These assumptions are vulnerable to attacks by quantum computers, particularly through algorithms such as Shor’s algorithm, rendering current schemes non–post-quantum secure. An adversary equipped with a sufficiently powerful quantum computer could therefore compromise the security guarantees of existing protocols.

To ensure long-term security, it is necessary to transition swarm attestation schemes from classical cryptographic primitives to quantum-resistant constructions. Several families of post-quantum cryptographic primitives have been proposed, including code-based, hash-based, multivariate-based, and lattice-based cryptography. Among these, lattice-based cryptography appears particularly promising due to its flexibility, efficiency, and support for advanced functionalities such as aggregatable and compact digital signatures.

This PhD project aims to design and develop the first lattice-based, post-quantum secure swarm attestation scheme. The research will focus on constructing efficient and scalable protocols suitable for heterogeneous device environments while ensuring strong security guarantees against quantum adversaries.

Applicants must meet the entry requirements for the Computer Science PhD programme and demonstrate a strong background in mathematics.

Open to candidates who pay UK/home rate fees. See UKCISA for further information.