The group is actively involved in research on various aspects of algorithm design and complexity theory including Algorithmic graph theory, Computational geometry, Randomized algorithms, Approximation algorithms, Complexity theory, and Online algorithms.
Publications
Leakage-Resilient Incompressible Cryptography: Constructions and Barriers Proceedings Article
In: Kai-Min Chung, Yu Sasaki (Ed.): Advances in Cryptology - ASIACRYPT 2024 - 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, December 9-13, 2024, Proceedings, Part VII, pp. 201–234, Springer, 2024.
Reactive Dataflow for Inflight Error Handling in ML Workflows Proceedings Article
In: Proceedings of the Eighth Workshop on Data Management for End-to-End Machine Learning, DEEM 2024, Santiago, AA, Chile, 9 June 2024, pp. 51–61, ACM, 2024.
Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower Bounds Proceedings Article
In: Rastislav Královic, Anton'ın Kucera (Ed.): 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, August 26-30, 2024, Bratislava, Slovakia, pp. 7:1–7:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
Incompressible Functional Encryption Journal Article
In: IACR Cryptol. ePrint Arch., pp. 798, 2024.
Approximate Distance Sensitivity Oracles in Subquadratic Space Journal Article
In: TheoretiCS, vol. 3, 2024.
Members
Projects
- Towards Securing Network Infrastructure with Post-Quantum CryptographyRajendra Kumar (PI), Vireshwar Kumar (co-PI) Sponsored by: Centre for Railway Information Systems (CRIS) India.