Algorithms & Theory Research Projects

Breaking the Box - On Security of Cryptographic Devices

Divesh AGGARWAL

This project focuses on advancing the security of cryptographic systems against active and passive adversaries, particularly in the context of tampering and side-channel attacks. By addressing foundational problems such as constructing non-malleable extractors, codes, and secret-sharing schemes, the research aims to develop robust cryptographic protocols that remain secure under a wide range of physical and mathematical attacks.

Computational Hardness of Lattice Problems and Implications

Divesh AGGARWAL

This project explores the computational hardness of lattice problems, aiming to develop optimal algorithms, establish near-tight complexity bounds, and investigate the limitations of proving lower bounds. It also seeks to introduce new fine-grained hardness assumptions with significant implications for cryptography and computational complexity, alongside extending and studying the scope of fine-grained hardness results.

A Hybrid Approach to Automatic Programming

Prateek SAXENA

The project introduces an innovative approach that combines traditional program analysis, neural machine translation, and human guidance to enhance accuracy and generalization in automated programming tasks, thereby making coding accessible to non-experts.

Safety and Reliability in Black-Box Optimization

Jonathan SCARLETT

This project seeks to enhance safety, reliability, and robustness in black-box optimization, exploring new function structures and addressing limitations. This includes extending decision-making frameworks to grey-box settings and multi-agent learning, utilizing a methodology blending theoretical analyses and algorithm development.

• Optimisation

Fault-tolerant Graph Structures: Efficient Constructions and Optimality

Diptarka CHAKRABORTY

This project aims to enhance graph problem solutions in the presence of network failures by developing fault-tolerant constructions and optimized graph structures. Through novel approaches, it contributes to algorithmic understanding, graph theory, and real-life applications.

You See the Whole Picture When the Puzzle Pieces Match

YU Haifeng

Massively Parallel Aggregation in Dynamic Networks

YU Haifeng

Handling Massive Data under the Edit Metric: Clustering, Finding Median and Computational Hardness

Diptarka CHAKRABORTY

• Combinatorial Algorithms, Optimisation

Rank Aggregation: Fairness and Computational Challenges

Diptarka CHAKRABORTY

• Combinatorial Algorithms, Optimisation

Computational Hardness Assumptions and the Foundations of Cryptography

Prashant Nalini VASUDEVAN

This program seeks to broaden and diversify the foundations of cryptography by identifying new plausible computational hardness assumptions that can be used to construct cryptosystems. Our current approach is to study and construct "fine-grained" cryptographic primitives based on the conjectured hardness of various well-studied algorithmic problems.

• 
• Complexity Theory, Cryptography

Algorithmic Solutions for Fair Resource Allocation

Warut SUKSOMPONG

Computational Methods for Tournament Selection

Warut SUKSOMPONG