Venkata Koppula

According to our database1, Venkata Koppula authored at least 32 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Incompressible Functional Encryption.
IACR Cryptol. ePrint Arch., 2024

Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower Bounds.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023
Homomorphic Indistinguishability Obfuscation and its Applications.
IACR Cryptol. ePrint Arch., 2023

2022
Adaptive Multiparty NIKE.
IACR Cryptol. ePrint Arch., 2022

2020
Collusion Resistant Traitor Tracing from Learning with Errors.
SIAM J. Comput., 2020

Chosen Ciphertext Security from Injective Trapdoor Functions.
IACR Cryptol. ePrint Arch., 2020

NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations.
IACR Cryptol. ePrint Arch., 2020

Simpler Proofs of Quantumness.
Proceedings of the 15th Conference on the Theory of Quantum Computation, 2020

2019
New Approaches to Traitor Tracing with Embedded Identities.
IACR Cryptol. ePrint Arch., 2019

On Perfect Correctness in (Lockable) Obfuscation.
IACR Cryptol. ePrint Arch., 2019

2018
Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption.
IACR Cryptol. ePrint Arch., 2018

Output Compression, MPC, and iO for Turing Machines.
IACR Cryptol. ePrint Arch., 2018

2017
Universal Samplers with Fast Verification.
IACR Cryptol. ePrint Arch., 2017

Lockable Obfuscation.
IACR Cryptol. ePrint Arch., 2017

Separating IND-CPA and Circular Security for Unbounded Length Key Cycles.
IACR Cryptol. ePrint Arch., 2017

Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption.
IACR Cryptol. ePrint Arch., 2017

Risky Traitor Tracing and New Differential Privacy Negative Results.
IACR Cryptol. ePrint Arch., 2017

A Generic Approach to Constructing and Proving Verifiable Random Functions.
IACR Cryptol. ePrint Arch., 2017

Signature Schemes with Randomized Verification.
Proceedings of the Applied Cryptography and Network Security, 2017

2016
Circular Security Counterexamples for Arbitrary Length Cycles from LWE.
IACR Cryptol. ePrint Arch., 2016

Semi-Adaptive Security and Bundling Functionalities Made Generic and Easy.
IACR Cryptol. ePrint Arch., 2016

Constrained Pseudorandom Functions for Unconstrained Inputs.
IACR Cryptol. ePrint Arch., 2016

Impossibility of Simulation Secure Functional Encryption Even with Random Oracles.
IACR Cryptol. ePrint Arch., 2016

Circular Security Separations for Arbitrary Length Cycles from LWE.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2014
Deterministic Public-Key Encryption under Continual Leakage.
IACR Cryptol. ePrint Arch., 2014

Indistinguishability Obfuscation for Turing Machines with Unbounded Memory.
IACR Cryptol. ePrint Arch., 2014

Universal Signature Aggregators.
IACR Cryptol. ePrint Arch., 2014

Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model.
IACR Cryptol. ePrint Arch., 2014

Adaptively Secure Constrained Pseudorandom Functions.
IACR Cryptol. ePrint Arch., 2014

2013
Separations in Circular Security for Arbitrary Length Key Cycles.
IACR Cryptol. ePrint Arch., 2013

Functional Encryption for Randomized Functionalities.
IACR Cryptol. ePrint Arch., 2013

2010
On the Kernelization Complexity of Colorful Motifs.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010


  Loading...