• Invited Talks
  • Leakage-Resilience meets Incompressibility, IIT-Delhi, India 2024 [Slides]
  • Leakage-Resilience meets Incompressibility, IIIT-Hyderabad, India 2024 [Slides]
  • Incompressible Encryption beyond Public Key Encryption, University of Wollongong, Australia 2024 [Slides]
  • Incompressible Encryption beyond Public Key Encryption, IIST, Trivandrum 2024 [Slides]
  • Incompressible Encryption beyond Public Key Encryption, Microsoft Research, Bangalore 2023 [Slides]
  • Incompressible Cryptography, TrustLab, IIT Bombay 2023 (Online) [Video][Slides]
  • Cryptography: Performing a Task Securely, STEM Mentorship Program, IIT Delhi 2023
  • On the Subset Sum Problem, CSE, IUST Jammu & Kashmir 2022.
  • Cryptanalysis of KECCAK & Algorithms for Lattice Problems, PMRF Symposium 2021 [Video] [Slides]

---

• Conference/Workshop Talks
  • Incompressible Functional Encryption, ITCS 2025 [Video][Slides]
  • Leakage-Resilient Key-Dependent Message Secure Encryption Schemes, INDOCRYPT 2024 [Slides]
  • Complexity of Monomial Prediction in Cryptography and Machine Learning, SYNASC 2024 [Slides]
  • On the Maximum Distance Sublattice Problem and Closest Vector Problem, SYNASC 2024 [Slides]
  • On the Variants of Subset Sum: Projected and Unbounded, SYNASC 2023 [Slides]
  • Efficient reductions and algorithms for Subset Product, CALDAM 2023 [Slides]
  • On the bases of Z^n lattice, SYNACS 2022 [Slides]
  • On the hardness of monomial prediction problem, WCC 2022 [Slides]
  • Cryptanalysis of Round-Reduced KECCAK using Non-Linear Structures, INDOCRYPT 2019 [Slides]

---

• Informal Talks
  • ITCS Graduating Bits ITCS [Slides]
  • An Algebraic Algorithm for Hamming Subset-Sum Problem
  • Cryptanalysis of Round-Reduced KECCAK using Non-linear Structures (Jan 2020)
  • Leftover Hash Lemma (Oct 2019) [Lecture note by Leo Reyzin][Video]
  • Lattices in Computer Science (Jun 2017) [Lecture notes by Oded Regev]
  • A Deterministic Exponential Time Algorithm for some lattice problems (Feb 2017)