Teaching Assistant
Principles of Digital Forensics (CSD1001).
About
I’m a PhD student in the Security and Privacy Group at the School of Informatics, University of Edinburgh, where I’m fortunate to be supervised by Damiano Abram and Rahul Santhanam. Previously, I was a predoctoral researcher at the Trust Lab, IIT Bombay, and a research assistant at CISPA. I completed my integrated Master’s degree at VIT Bhopal University, where I worked on my thesis under the supervision of Matteo Campanelli. I’m broadly interested in theoretical computer science, mainly cryptography, computational complexity, and pseudorandomness.
Publications
3 publications
No publications match your search.
-
Simple Extremely Lossy Functions from Small-Exponent Hashing
ePrintarXivBibTeX
@misc{EPRINT:ADDR26, author = {Damiano Abram and Agni Datta and Archisman Dutta and Lawrence Roy}, howpublished = {Cryptology {ePrint} Archive, Paper 2026/2367}, title = {Simple Extremely Lossy Functions from Small-Exponent Hashing}, url = {https://eprint.iacr.org/2026/2367}, year = {2026}, } -
A Fiat-Shamir Transformation for Private-Coin Protocols
ePrintBibTeX
@misc{EPRINT:BenDatYog26, author = {Shany Ben-David and Agni Datta and Eylon Yogev}, howpublished = {Cryptology {ePrint} Archive, Paper 2026/2227}, title = {A {Fiat}-{Shamir} Transformation for Private-Coin Protocols}, url = {https://eprint.iacr.org/2026/2227}, year = {2026}, } -
Fiat-Shamir Goes Rational (Or: On the Perils of Sublinear Verification)
ePrintBibTeX
@misc{EPRINT:CamDat24, author = {Matteo Campanelli and Agni Datta}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1645}, title = {{Fiat}-{Shamir} Goes Rational}, url = {https://eprint.iacr.org/2024/1645}, year = {2024}, }
Teaching
Service
Ad Hoc Reviewing
Talks
- Fiat-Shamir Goes Rational
- Fiat-Shamir Goes Rational
- Windows Registry Forensic Analysis
- Oshin OS: Risk Mitigation for Minors
Expository notes
I sometimes write notes as I work through results and techniques, both old and new, that catch my interest, explaining their proofs in the way that feels most natural to me. I share some of my more carefully revised notes, hoping that other researchers will find them useful. I occasionally leave out formal details to make the ideas easier to follow, and as always, any errors are my own.
On the Simplex Method
PDF
Overview
A short note explaining how the simplex method moves between vertices of a feasible polytope in search of an optimal linear objective. The note is meant to make the geometric picture behind pivoting explicit before turning to the algebraic form of the algorithm. Written during my undergraduate studies.
On the KKT Method
PDF
Overview
A short introduction to the Karush-Kuhn-Tucker conditions for constrained optimization. The note explains how stationarity, feasibility, and complementary slackness combine to certify optimality under the usual regularity assumptions. Written during my undergraduate studies.
On Gomory Cutting Planes
PDF
Overview
A note on how Gomory cuts strengthen a linear relaxation by adding inequalities that exclude a fractional solution while preserving all integral feasible points. The goal is to show why cutting planes are a natural bridge between linear programming and integer programming. Written during my undergraduate studies.
On the Goldwasser-Sipser Lower-Bound Protocol
PDF
Overview
An expository note on the Goldwasser-Sipser protocol and the set-size lower-bound problem that it captures. The note focuses on the probabilistic idea behind the protocol and how hashing is used to turn a counting gap into an interactive proof.
On Schrödinger’s Equation
PDF
Overview
A short note deriving the Schrödinger equation from the basic correspondence between energy, momentum, and wave behavior. The emphasis is on the meaning of the equation and the role played by the wavefunction, rather than on physical formalism alone. Written during my undergraduate studies.
References
A list of books, courses, and links I return to. Useful if you are starting out in TCS or looking for a reference.
Books
Complexity
-
Arora and Barak — Computational Complexity: A Modern Approach
The standard graduate text.
-
Goldreich — Computational Complexity: A Conceptual Perspective
Complements Arora-Barak with a more conceptual treatment.
-
Papadimitriou — Computational Complexity
Older but still a solid reference for NP-completeness and space complexity.
-
Wigderson — Mathematics and Computation
Broad view of TCS and its connections to mathematics.
-
Cook and Nguyen — Logical Foundations of Proof Complexity
Connects bounded arithmetic and propositional proof complexity via two-sorted logic.
Computability
-
Sipser — Introduction to the Theory of Computation
The standard undergraduate introduction to automata, computability, and complexity.
-
Hopcroft, Motwani, and Ullman — Introduction to Automata Theory, Languages, and Computation
The classical reference on formal languages and automata.
-
Soare — Recursively Enumerable Sets and Degrees
The standard reference for classical computability theory and degree structures.
Average-Case and Kolmogorov Complexity
-
Bogdanov and Trevisan — Average-Case Complexity
Survey of average-case complexity and its connections to cryptography and derandomization.
-
Li and Vitányi — An Introduction to Kolmogorov Complexity and Its Applications
The standard reference on Kolmogorov complexity and algorithmic information theory.
Descriptive Complexity
-
Immerman — Descriptive Complexity
Logical characterizations of complexity classes via finite model theory.
Proof Complexity
-
Krajíček — Proof Complexity
The main reference for proof complexity.
-
Krajíček — Forcing with Random Variables and Proof Complexity
More advanced; connects model theory and forcing to proof complexity.
Circuits and Boolean Functions
-
Wegener — Complexity Theory
Good coverage of circuit complexity and space complexity at the graduate level.
-
Jukna — Boolean Function Complexity
Thorough treatment of circuit complexity and lower bounds.
-
O'Donnell — Analysis of Boolean Functions
The standard reference for Fourier analysis on the Boolean cube.
-
Savage — Models of Computation
Covers machine models, circuits, and complexity from first principles.
Randomized Algorithms
-
Motwani and Raghavan — Randomized Algorithms
The classical text on randomized algorithms.
-
Mitzenmacher and Upfal — Probability and Computing
More accessible than Motwani-Raghavan; good first text on randomized algorithms.
Pseudorandomness
-
Vadhan — Pseudorandomness
Comprehensive treatment of pseudorandomness, expanders, and derandomization.
-
Luby and Wigderson — Pairwise Independence and Derandomization
Monograph on pairwise independence and its applications to derandomization.
Approximation Algorithms
-
Vazirani — Approximation Algorithms
Standard graduate text on approximation algorithms.
-
Hochbaum (ed.) — Approximation Algorithms for NP-Hard Problems
Collected chapters on approximation and inapproximability.
-
Williamson and Shmoys — The Design of Approximation Algorithms
Modern graduate text on approximation algorithms.
Algorithms
-
Cormen et al. — Introduction to Algorithms (CLRS)
The standard algorithms reference.
Algorithmic Game Theory
-
Roughgarden — Twenty Lectures on Algorithmic Game Theory
Game theory and mechanism design from a TCS perspective.
Communication Complexity
-
Rao and Yehudayoff — Communication Complexity and Applications
Modern treatment of communication complexity.
-
Kushilevitz and Nisan — Communication Complexity
The original graduate text on communication complexity; still widely used.
Cryptography
-
Katz and Lindell — Introduction to Modern Cryptography
Rigorous and widely used graduate introduction.
-
Goldreich — Foundations of Cryptography (Vol. 1 & 2)
Thorough theoretical treatment.
-
Boneh and Shoup — A Graduate Course in Applied Cryptography
Modern and comprehensive; covers both theory and practice.
-
Pass and Shelat — A Course in Cryptography
Concise graduate-level lecture notes with a rigorous definitional style.
Coding Theory
-
Roth — Introduction to Coding Theory
Rigorous graduate introduction to algebraic coding theory.
-
Guruswami, Rudra, and Sudan — Essential Coding Theory
Modern treatment oriented toward TCS; covers list decoding and connections to complexity.
Combinatorics
-
Alon and Spencer — The Probabilistic Method
The definitive reference on the probabilistic method.
-
Jukna — Extremal Combinatorics
Combinatorial tools used throughout TCS.
-
Graham, Knuth, and Patashnik — Concrete Mathematics
Mathematical foundations for computer science.
-
Diestel — Graph Theory
The standard graduate reference on graph theory.
Expanders
-
Hoory, Linial, and Wigderson — Expander Graphs and their Applications
The standard survey on expander graphs.
Logic
-
Enderton — A Mathematical Introduction to Logic
Standard introductory text on first-order logic and model theory.
-
Enderton — Elements of Set Theory
Rigorous introduction to axiomatic set theory.
-
Shoenfield — Mathematical Logic
Classical graduate text; strong on proof theory and recursion theory.
-
Marker — Model Theory: An Introduction
Standard graduate introduction to model theory; useful for finite model theory connections.
-
Ebbinghaus and Flum — Finite Model Theory
The standard reference for finite model theory; closely connected to descriptive complexity.
Quantum Information
-
Nielsen and Chuang — Quantum Computation and Quantum Information
The standard textbook.
-
Aaronson — Quantum Computing Since Democritus
More informal and broader in scope; good complement to Nielsen-Chuang.
-
Wilde — Quantum Information Theory
Rigorous treatment of quantum Shannon theory; second edition freely available.
Courses and Notes
Complexity
-
Graduate Complexity and Foundations
Graduate-level notes on complexity and foundations.
-
Lecture Notes on Complexity, Cryptography, and Foundations
Notes on complexity, cryptography, and foundations.
-
Computational Complexity
Graduate complexity course notes; broad and philosophically oriented.
-
Lecture Notes on Computational Complexity
Concise notes covering the standard complexity curriculum.
-
Great Ideas in Theoretical Computer Science
Broad undergraduate introduction to TCS; accessible and wide-ranging.
Boolean Functions and Combinatorics
-
CS Theory Toolkit
Mathematical tools for TCS.
-
Analysis of Boolean Functions
Full lecture series to accompany the book.
Coding Theory
-
Introduction to Coding Theory
Graduate course notes on algebraic and combinatorial coding theory.
-
Algebra and Computation
Lecture notes on algebraic algorithms: FFT, polynomial identity testing, and coding.
-
Essential Coding Theory
Early version of what became the Guruswami-Rudra-Sudan text; freely available.
Pseudorandomness
-
Pseudorandomness and Combinatorial Constructions
Lecture notes on pseudorandomness, extractors, and derandomization.
Cryptography
-
Cryptography
A widely used online introduction to modern cryptography.
-
Recent Developments in Program Obfuscation
Covers techniques and results in program obfuscation.
-
Quantum Cryptography
Cryptography in the quantum setting.
Quantum Information
-
Theory of Quantum Information
Lecture notes on quantum information theory.
High-Dimensional Expanders
-
High-Dimensional Expanders
Lecture and seminar series covering spectral graph theory, high-dimensional expansion, constructions, and applications to codes and PCPs.
-
High-Dimensional Expanders
A graduate course covering combinatorial, topological, and group-theoretic notions of high-dimensional expansion, together with applications to coding and complexity.
Research Tools
Preprints
-
ECCC
Preprints in computational complexity.
-
arXiv — cs.CC, cs.DS, cs.LO, cs.CR
General preprint server for TCS and cryptography.
-
IACR ePrint
Preprints in cryptography.
References
-
TCS Stack Exchange
Q&A for TCS researchers and students.
-
Cryptography Stack Exchange
Q&A for cryptography.
-
The Complexity Zoo
Catalogue of complexity classes.
-
DBLP
Bibliography database for CS.
Open Access
-
Theory of Computing
Diamond open-access TCS journal.
-
LIPIcs
Open-access conference proceedings in informatics.
Conferences
Community
Blogs
-
Shtetl-Optimized
Scott Aaronson on quantum computing and complexity theory.
-
Gödel's Lost Letter and P=NP
Dick Lipton and Ken Regan on complexity theory.
-
Windows On Theory
Boaz Barak on complexity, cryptography, and ML theory.
-
Computational Complexity
Lance Fortnow and Bill Gasarch on complexity theory.
-
In Theory
Luca Trevisan on complexity, pseudorandomness, and combinatorics.
-
Goldreich — My Choices
Goldreich's curated reading list.
Communities
-
Theory of Computing Blog Aggregator
Aggregates posts from TCS blogs.
-
TCS+
Online seminar series with recorded talks.
-
Simons Institute Videos
Recorded workshops and talks from the Simons Institute.
-
SIGACT
ACM Special Interest Group on Algorithms and Computation Theory.
-
IACR
International Association for Cryptologic Research.