Venkata KoppulaAssistant Professor, IIT Delhi Office: 413, Bharti Building Email: kvenkata at cse.iitd.ac.in |
|
I am a faculty member in the Computer Science and Engineering department at IIT Delhi. Before this, I was a postdoc at the Weizmann Institute of Science, hosted by Zvika Brakerski. I obtained my Ph.D. from University of Texas, Austin, where my advisor was Brent Waters.
My research interests are in field of theoretical cryptography (classical and quantum).
Supervision
Postdoc: Mahesh Rajasree (2023-2024)
PhD: Shashwat Agrawal (co-supervised with Rajendra Kumar, 2024 - Present)
MS (Research): Karthik Nambiar (ongoing)
M.Tech. Project: Kabir Tomer (2022), Abhinav Kumar (2024), Aman Verma (2024), Dhairya Gupta (2024), Rahul Dintyala Bhardwaj (2025), Shankh Gupta (2026)
B.Tech. Project: Avantika Agarwal (2023), Harihar S. (2024), Anish Banerjee (2025), Vedant Talegaonkar (2026)
Publications
- A Note on Adaptive Security in Hierarchical Identity-Based Encryption
- Non-Committing Identity based Encryption: Constructions and Applications
- Incompressible Functional Encryption
- Leakage-resilient incompressible cryptography: Constructions and barriers
- Homomorphic Indistinguishability Obfuscation and Its Applications
- Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower Bounds
- Adaptive Multiparty NIKE
- On Perfect Correctness in (Lockable) Obfuscation
- NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations
- Chosen Ciphertext Security from Injective Trapdoor Functions
- Simpler Proofs of Quantumness
- Output compression, MPC, and iO for Turing Machines
- New Approaches to Traitor Tracing with Embedded Identities
- Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption
- Impossibility of Simulation Secure Functional Encryption Even with Random Oracles
- Collusion Resistant Traitor Tracing from Learning with Errors
- Risky traitor tracing and new differential privacy negative results
- A Generic Approach to Constructing and Proving Verifiable Random Functions
- Lockable obfuscation
- Signature Schemes with Randomized Verification
- Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- Universal Samplers with Fast Verification
- Deterministic Public-Key Encryption under Continual Leakage
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Constrained Pseudorandom Functions for Unconstrained Inputs
- Semi-Adaptive Security and Bundling Functionalities Made Generic and Easy
- Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Universal Signature Aggregators
- Separations in Circular Security for Arbitrary Length Key Cycles
- Functional Encryption for Randomized Functionalities
Teaching
- Cryptography : Semester I, 2026-27; Semester II, 2024-25; Semester I, 2023-24; Semester I, 2022-23
- Introduction to Computers and Programming : Semester II, 2025-26; Semester I, 2025-26 (IITD-AD); Summer Semester, 2024-25
- Discrete Mathematical Structures : Semester I, 2024-25; Semester II, 2021-22
- Cryptographic Protocols : Semester II, 2023-24
- Quantum Cryptography : Semester II, 2022-23
- Data Structures and Algorithms : Semester I, 2021-22
- Lattices in Cryptography : Semester II, 2020-2021
Professional Service
Program Committees: Eurocrypt 2025, Eurocrypt 2024, Indocrypt 2024, FSTTCS 2023, TCC 2022, PKC 2021, Indocrypt 2020, Crypto 2020, TCC 2019
Co-organizer: FSTTCS 2026