Venkata Koppula
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Venkata Koppula has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Mahesh Sreekumar Rajasree
CISPA Helmholtz
3 shared publications - Rishab Goyal
University of Wisconsin-Madison
3 shared publications Mahesh Sreekumar Rajasree
CISPA Helmholtz Center for Information Security
2 shared publications- Abhinav Kumar
IIT Delhi
1 shared publication - Antoine Joux
CISPA Helmholtz Center for Information Security
1 shared publication - Avantika Agarwal1 shared publication
Latest Publications
- 9 August 2026
- Published by Springer Nature
- p. 282-313
Chosen Ciphertext Secure Pseudorandom Codes in the Standard Model
- 9 August 2026
- Published by Springer Nature
- p. 282-313
Chosen Ciphertext Secure Pseudorandom Codes in the Standard Model
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 101-136
A Note on Adaptive Security in Hierarchical Identity-Based Encryption
- 17 August 2025
- Published by Springer Nature
- p. 101-136
Open AccessA Note on Adaptive Security in Hierarchical Identity-Based Encryption
- Open Access
- 7 July 2025
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (2)
Incompressible Encryption Beyond CPA/CCA Security
An incompressible encryption scheme offers protection against adversaries who possess the entire secret key but can store only a portion of the ciphertext. In recent years, there has been growing interest in developing such primitives in both public-key and secret-key settings, as well as in the multi-user scenario. In this work, we extend the concept of incompressible encryption to incorporate anonymity and key-dependent message security. We introduce the following schemes: 1. The first key-dependent message incompressible SKE scheme secure against unbounded adversaries. 2.The first anonymous incompressible SKE scheme secure against unbounded encryption queries. Furthermore, we present the public key versions of these schemes.
- 7 July 2025
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (2)
Open AccessIncompressible Encryption Beyond CPA/CCA Security
An incompressible encryption scheme offers protection against adversaries who possess the entire secret key but can store only a portion of the ciphertext. In recent years, there has been growing interest in developing such primitives in both public-key and secret-key settings, as well as in the multi-user scenario. In this work, we extend the concept of incompressible encryption to incorporate anonymity and key-dependent message security. We introduce the following schemes: 1. The first key-dependent message incompressible SKE scheme secure against unbounded adversaries. 2.The first anonymous incompressible SKE scheme secure against unbounded encryption queries. Furthermore, we present the public key versions of these schemes.
- 5 May 2025
- Published by Springer Nature
- p. 158-193
Non-committing Identity Based Encryption: Constructions and Applications
- 5 May 2025
- Published by Springer Nature
- p. 158-193
Non-committing Identity Based Encryption: Constructions and Applications
- 9 December 2024
- Published by Springer Nature
- p. 201-234
Leakage-Resilient Incompressible Cryptography: Constructions and Barriers
- 9 December 2024
- Published by Springer Nature
- p. 201-234
Leakage-Resilient Incompressible Cryptography: Constructions and Barriers
- Open Access
Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds
The Polynomial-Time Hierarchy ($\mathsf{PH}$) is a staple of classical complexity theory, with applications spanning randomized computation to circuit lower bounds to ''quantum advantage'' analyses for near-term quantum computers. Quantumly, however, despite the fact that at least \emph{four} definitions of quantum $\mathsf{PH}$ exist, it has been challenging to prove analogues for these of even basic facts from $\mathsf{PH}$. This work studies three quantum-verifier based generalizations of $\mathsf{PH}$, two of which are from [Gharibian, Santha, Sikora, Sundaram, Yirka, 2022] and use classical strings ($\mathsf{QCPH}$) and quantum mixed states ($\mathsf{QPH}$) as proofs, and one of which is new to this work, utilizing quantum pure states ($\mathsf{pureQPH}$) as proofs. We first resolve several open problems from [GSSSY22], including a collapse theorem and a Karp-Lipton theorem for $\mathsf{QCPH}$. Then, for our new class $\mathsf{pureQPH}$, we show one-sided error reduction for $\mathsf{pureQPH}$, as well as the first bounds relating these quantum variants of $\mathsf{PH}$, namely $\mathsf{QCPH}\subseteq \mathsf{pureQPH} \subseteq \mathsf{EXP}^{\mathsf{PP}}$.Open AccessQuantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds
The Polynomial-Time Hierarchy ($\mathsf{PH}$) is a staple of classical complexity theory, with applications spanning randomized computation to circuit lower bounds to ''quantum advantage'' analyses for near-term quantum computers. Quantumly, however, despite the fact that at least \emph{four} definitions of quantum $\mathsf{PH}$ exist, it has been challenging to prove analogues for these of even basic facts from $\mathsf{PH}$. This work studies three quantum-verifier based generalizations of $\mathsf{PH}$, two of which are from [Gharibian, Santha, Sikora, Sundaram, Yirka, 2022] and use classical strings ($\mathsf{QCPH}$) and quantum mixed states ($\mathsf{QPH}$) as proofs, and one of which is new to this work, utilizing quantum pure states ($\mathsf{pureQPH}$) as proofs. We first resolve several open problems from [GSSSY22], including a collapse theorem and a Karp-Lipton theorem for $\mathsf{QCPH}$. Then, for our new class $\mathsf{pureQPH}$, we show one-sided error reduction for $\mathsf{pureQPH}$, as well as the first bounds relating these quantum variants of $\mathsf{PH}$, namely $\mathsf{QCPH}\subseteq \mathsf{pureQPH} \subseteq \mathsf{EXP}^{\mathsf{PP}}$.