Semester Projects

Available Projects

Students interested in a project with the group are kindly requested to send their transcript of records, along with a CV highlighting any relevant experience in cryptography, and either a preferred topic from the proposals below or a description of their interests within cryptography, to the contact noted under Student Projects.

Last updated: 12.05.2025

Ongoing Projects (Master's Level)

(We recommend students currently doing a project in our group to use this Download LaTeX template (ZIP, 230 KB) for the write-up.)

(Supervisor: Prof. Kenny Paterson, Joint Supervisors: Yuanming Song, Kien Tuong Truong)

This project investigates the largely unexplored area of timing side channels in data compression and decompression, building upon recent findings that highlight vulnerabilities in decompression processes. Data compression, while effective in reducing data size by eliminating redundancy, unintentionally introduces information leakage vectors, such as compression ratio side channels, previously exploited in attacks like CRIME and BREACH. The project aims to investigate timing variations during both compression and decompression, striving to enhance the reliability and efficiency of decompression timing side-channel attacks and exploring the potential for similar vulnerabilities during compression. The research may also extend to examining other compression algorithms, such as brotli and bzip2, for their susceptibility to timing side channels. Practically, the project involves crafting payloads to exploit timing differences, potentially through manual analysis, automated tools, or by adapting existing techniques for compression ratio side-channel attacks, with a strong focus on implementation and experimentation.

(Supervisor: Prof. Kenny Paterson, Joint Supervisor: Jan Gilcher)

This project aims to create a highly optimized x86_64 implementation of the Poly1163 universal hash function, which promises a better security-performance tradeoff than the widely used Poly1305. Poly1163 offers higher security with reduced computational complexity, making it a strong candidate to replace Poly1305, particularly within the ChaCha20-Poly1305 AEAD scheme. The project's first phase focuses on optimizing Poly1163 using vectorization techniques like AVX2 and low-level assembly optimizations to outperform OpenSSL’s Poly1305 on modern Intel processors by 10-20%. The second phase involves integrating this optimized Poly1163 with a ChaCha20 implementation to develop a new AEAD scheme, ChaCha20-Poly1163, which will be benchmarked against existing standards to determine its potential as a superior alternative. The project leverages previous optimization work to maximize performance gains and aims to demonstrate Poly1163's viability as a successor to Poly1305 in cryptographic applications.

(Supervisor: Prof. Christoph Studer, Joint Supervisor: Dr. Stefan Mangold)

This project seeks to establish and evaluate a smartphone-based communication framework for humanitarian missions, where internet connectivity is either disrupted or entirely unavailable. By leveraging widely used wireless standards, devices will form multi-hop networks capable of forwarding messages without centralized infrastructure or specialized hardware. A dedicated test environment—combining multiple smartphones and computers—will be used to measure performance under realistic conditions, focusing on metrics such as reliability and coverage. Ultimately, the project will provide insights into designing resilient, delay-tolerant mesh networks to support critical coordination efforts when conventional communication methods fail.

(Supervisor: Prof. Kenny Paterson, Joint Supervisors: Dr. Simon-Philipp Merz, Kien Tuong Truong)

This student project focuses on the emerging field of post-quantum cryptography, specifically exploring cryptographic systems based on the computational difficulty of decoding linear error-correcting codes. As quantum computers pose a threat to current public-key encryption, research in post-quantum cryptography has gained importance. The project aims to systematize recent advancements in information-set decoding (ISD) algorithms, which are crucial for understanding and potentially improving code-based cryptanalysis. The project will provide a comprehensive overview of existing ISD algorithms, analyze their variations and how they exploit the structure of decoding problems, such as regular syndrome decoding. Additionally, it will evaluate current leading implementations of ISD algorithms and seek to achieve concrete performance improvements. This research will contribute to the standardization efforts by organizations like the US National Institute of Standards and Technology (NIST) in developing secure cryptographic systems for a post-quantum world.

(Supervisor: Prof. Kenny Paterson, Joint Supervisor: Dr. Lenka Mareková)

This project's aim is to develop a Systematization of Knowledge, a type of work which aims to comprehensively review, organize, and synthesize existing knowledge on a particular topic. In this case the focus will be on mesh networks and their applications to offline communications, taking a broad definition of "mesh" to include traditional ad-hoc networks [1,2], peer-to-peer systems as well as more recently proposed mesh messaging designs [3,4,5], spanning cryptography but also security research more widely. The project will also survey a host of existing practical tools and their capabilities [6,7,8], thus providing a comprehensive overview of what is available in the real world, and what the potential gaps are.

The goal will be to catalogue existing usecases in which these networks have been or were intended to be utilised and describe the functionality they provide; to identify key assumptions behind the proposed designs; describe common threat models as well as the promised security guarantees. The work could also draw on related concepts from the anonymity and censorship resistance literature, and as a potential extension explore social science works on internet shutdowns and other contexts where standard communication media are not available or not reliable enough for use.

(Supervisor: Prof. Kenny Paterson, Joint Supervisors: Dr. Jean-Philippe Aumasson, Dr. Lenka Mareková)

This project seeks to evaluate the cryptographic foundation of HashiCorp Vault, a widely deployed but under-researched open-source key management system (KMS). KMS are essential for securely generating, storing, and handling cryptographic keys and other sensitive data, a task often complicated by the need for strong security measures, such as hardware security modules (HSM) for bootstrapping trust. While prominent KMS from Microsoft, Google, and AWS are closed-source and integrated with their respective ecosystems, Vault offers an open-source alternative with complex cryptographic mechanisms that have not been extensively examined in academic research.

The project involves a thorough review of Vault's documentation and source code to understand its threat model and security controls, including optional enhancements like HSM-based unsealing and secret-sharing mechanisms. The student will develop an informal model of Vault's cryptographic protocols, scrutinize them for potential vulnerabilities, and test these vulnerabilities through proof-of-concept implementations. The final deliverables include a comprehensive report detailing the protocols, identified flaws, and potential mitigations. The study may also extend to comparing Vault with its recent fork, OpenBao, to assess differences in their security properties.
 

Completed Projects (Master's Level)

2025

Fiona Willi. Identifying Compiler Optimizations that Break Constant Time Programming Techniques. Prof. Kenny Paterson. Co-supervisor: Jan Gilcher.

Daniela Thurnher. Fuzzy BFFs: Distance-Sensitive Binary Fuse Filters. Supervisor: Prof. Kenny Paterson. Co-supervisors: Laura Hetz, Dr. Francesca Falzon.

Noah Tittelbach. Breaking SSO. Supervisor: Prof. Kenny Paterson. Co-supervisor: Matteo Scarlata.

Vaclav Zvonicek. Concrete Cost Analysis of Finding Paths in Isogeny Graphs [Download pdf (PDF, 408 KB)]. Supervisor: Prof. Kenny Paterson. Co-supervisor: Dr. Simon-Philipp Merz.

Eduarda Assunção. Analyzing IKEv2: Security Proofs, Known Attacks, and Other Insights [Download pdf (PDF, 812 KB)]. Supervisor: Prof. Kenny Paterson. Co-supervisor: Shannon Veitch.  

2024

Marc Himmelberger. Performance Analysis of AEAD Schemes [Download pdf (PDF, 1.9 MB)]. Supervisor: Prof. Kenny Paterson. Co-supervisor: Jan Gilcher.

Melanie Jauch. UOV and MAYO: Analysis and Comparison. Supervisor: Prof. Kenny Paterson. Co-supervisor: Dr. Simon-Philipp Merz.

Andrea Raguso. Scalable Probabilistic Data Structures in Adversarial Environments [Download pdf (PDF, 1.8 MB)]. Supervisor: Prof. Kenny Paterson. Co-supervisor: Mia Filić.

Domenico Nobile. Metadata-private Messaging in the Wild: Session. Supervisor: Prof. Kenny Paterson. Co-supervisor: Dr. Lenka Mareková.

Marko Lisicic. Breaking Cryptography in the Wild: CryptPad. Supervisor: Prof. Kenny Paterson. Co-supervisor: Dr. Zichen Gui.

Jonas Lauer. Exploring Anonymous One-to-One Messaging with a Single Server. Supervisor: Prof. Kenny Paterson. Co-supervisors: Dr. Tianxin Tang, Laura Hetz.

Emanuel Opel. SoK: Authenticated Dictionaries and their Applications. Supervisor: Prof. Kenny Paterson. Co-supervisor: Dr. Francesca Falzon.

Andraž Strgar. WhatsApp Multi-Device: Analysis and Noise Protocol Interceptor. Supervisor: Prof. Kenny Paterson. Co-supervisor: Matteo Scarlata.

Junzhen Lou. Homomorphic Encryption for Healthcare Data Privacy in Industry Use Cases [Download pdf (PDF, 823 KB)]. Supervisor: Prof. Kenny Paterson. Co-supervisors: Dr. Anwar Hithnawi (Privacy Preserving Systems Lab, ETH Zurich), Roche.

Dimitri Francolla. Privacy implications of AMQ-based PQ TLS authentication [Download pdf (PDF, 932 KB)]. Supervisor: Prof. Kenny Paterson. Co-supervisors: Mia Filić, Shannon Veitch.

2023

Jonas Hofmann. Exploring Cuckoo filters in Redis [Download pdf (PDF, 1.9 MB)]. Supervisor: Prof. Kenny Paterson. Co-supervisors: Dr. Anupama Unnikrishnan, Mia Filić.

Iana Peix. Repairable Threshold Schemes with Malicious Security [Download pdf (PDF, 1.1 MB)]. Supervisor: Prof. Kenny Paterson. Co-supervisor: Shannon Veitch.

Yuanming Song. Cryptography in the Wild: Briar [Download pdf (PDF, 614 KB)]Supervisor: Prof. Kenny Paterson.

César Descalzo. Crypto in the wild – Analysing the security of CipherStash. Supervisor: Prof. Kenny Paterson. Co-supervisor: Dr. Zichen Gui.

Keran Kocher. Cuckoo filters in adversarial settings [Download pdf (PDF, 636 KB)]. Supervisor: Prof. Kenny Paterson. Co-supervisor: Dr. Anupama Unnikrishnan.

Sophia Artioli. How Practical is Single-Server Private Information Retrieval? [Download pdf (PDF, 1.5 MB)] Supervisor: Prof. Kenny Paterson. Co-supervisor: Dr. Tianxin Tang.

2022

Daniele Coppola. Breaking Cryptography in the Wild: Nextcloud. Supervisor: Prof. Kenny Paterson. Co-supervisors: Prof. Martin Albrecht and Matilda Backendal. [report Download pdf (PDF, 492 KB)] [paper external page pdf]

Younis Khalil. Implementing a Puncturable Key Wrapping Library [Download pdf (PDF, 1.6 MB)]. Supervisor: Prof. Kenny Paterson. Co-supervisors: Dr. Felix Günther and Matilda Backendal.

Daniel PöllmannPerceptual Hash Functions. Supervisor: Prof. Kenny Paterson. Co-supervisor: Dr. Fernando Virdia.

Mirco Stäuble. Actually Good Encryption? Confusing Users by Changing Nonces [Download pdf (PDF, 1023 KB)]. Supervisor: Prof. Kenny Paterson.

2021

Theo von Arx. Analysis of Telegram Clients' Security [Download pdf (PDF, 675 KB)]. Supervisor: Prof. Kenny Paterson.

Louis Leclair. Analysing Encrypted Databases Using Learning Algorithms. Supervisor: Prof. Kenny Paterson.

Lena Csomor. Why Johnny Can’t Compute Securely: Exploring the Gap between Threat Models and Stakeholder Concerns [Download pdf (PDF, 618 KB)]. Supervisor: Prof. Kenny Paterson, Co-supervisor: Alexander Viand.

Silvia Ritsch. Analysing Privacy of Zcash PKE scheme. Joint supervisor: Prof. Kenny Paterson

2020

Mathilde Aliénor Raynal. Probabilistic Data-structures in Adversarial Scenarios: The HyperLogLog Case [Download pdf]. Supervisor: Prof. Kenny Paterson.

2019

Ali El Wahsh. Compromises in Private Set Intersection for Contact Discovery. Supervisor: Prof. Kenny Paterson.

JavaScript has been disabled in your browser