Srijita Kundu
Status: Alumnus (data might not be up-to-date)
Former Internship Student
Preprints
- S.Kundu, Ernest Tan. Composably secure device-independent encryption with certified deletion.
Publications
- Upendra Kapshikar, S.Kundu. (2023). On the hardness of the minimum distance problem of quantum codes. IEEE Trans. Inf.
- S.Kundu, Shalev Ben-David, Anurag Anshu. (2021). On Query-to-Communication Lifting for Adversary Bounds. Proceedings of the Computational Complexity Conference
- S.Kundu, R. Jain. (2021). A direct product theorem for quantum communication complexity with applications to device-independent QKD. Proc. IEEE FOCS
- S.Kundu, R. Jain. (2021). A Direct Product Theorem for One-Way Quantum Communication. Proceedings of the Computational Complexity Conference
- S.Kundu, Ernest Y. -Z. Tan, Jamie Sikora. (2020). A device-independent protocol for XOR oblivious transfer. Proceedings of TQC
- R. Jain, H. Klauck, D. Gavinsky, T. Lee, S.Kundu, Jevgenijs Vihrovs, Swagato Sanyal, M. Santha, T. Lee. (2020). Quadratically Tight Relations for Randomized Query Complexity. Theory of Computing Systems 64 101-119
- D. Gavinsky, R. Jain, H. Klauck, S.Kundu, T. Lee, T. Lee, M. Santha, S. Sanyal, Jevgenijs Vihrovs. (2017). Quadratically Tight Relations for Randomized Query Complexity. CSR
- A. Anshu, A. Anshu, D. Gavinsky, R. Jain, S.Kundu, T. Lee, T. Lee, P. Mukhopadhyay, M. Santha, S. Sanyal. (2017). A Composition Theorem for Randomized Query Complexity. FSTTCS
- Andre Chailloux, I. Kerenidis, S.Kundu, Jamie William Jonathon Sikora. (2016). Optimal bounds for parity-oblivious random access codes. New J. Phys. 045003
