Prabhanjan Vijendra Ananth

Orcid: 0000-0001-5387-5730

According to our database1, Prabhanjan Vijendra Ananth authored at least 79 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Revocable Encryption, Programs, and More: The Case of Multi-Copy Security.
IACR Cryptol. ePrint Arch., 2024

Simultaneous Haar Indistinguishability with Applications to Unclonable Cryptography.
IACR Cryptol. ePrint Arch., 2024

Quantum Key-Revocable Dual-Regev Encryption, Revisited.
IACR Cryptol. ePrint Arch., 2024

Unclonable Secret Sharing.
IACR Cryptol. ePrint Arch., 2024

Cryptography in the Common Haar State Model: Feasibility Results and Separations.
IACR Cryptol. ePrint Arch., 2024

A Note on the Common Haar State Model.
IACR Cryptol. ePrint Arch., 2024

Pseudorandomness in the (Inverseless) Haar Random Oracle Model.
IACR Cryptol. ePrint Arch., 2024

NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness.
IACR Cryptol. ePrint Arch., 2024

Provable Robust Watermarking for AI-Generated Text.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

ORTOA: A Family of One Round Trip Protocols For Operation-Type Obliviousness.
Proceedings of the Proceedings 27th International Conference on Extending Database Technology, 2024

2023
Revocable Cryptography from Learning with Errors.
IACR Cryptol. ePrint Arch., 2023

Pseudorandom Strings from Pseudorandom Quantum States.
IACR Cryptol. ePrint Arch., 2023

Cloning Games: A General Framework for Unclonable Primitives.
IACR Cryptol. ePrint Arch., 2023

On the (Im)plausibility of Public-Key Quantum Money from Collision-Resistant Hash Functions.
IACR Cryptol. ePrint Arch., 2023

Pseudorandom Isometries.
IACR Cryptol. ePrint Arch., 2023

A Modular Approach to Unclonable Cryptography.
IACR Cryptol. ePrint Arch., 2023

2022
ORTOA: One Round Trip Oblivious Access.
IACR Cryptol. ePrint Arch., 2022

A Note on Copy-Protection from Random Oracles.
IACR Cryptol. ePrint Arch., 2022

On the Feasibility of Unclonable Encryption, and More.
IACR Cryptol. ePrint Arch., 2022

Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications.
IACR Cryptol. ePrint Arch., 2022

Post-Quantum Zero-Knowledge with Space-Bounded Simulation.
IACR Cryptol. ePrint Arch., 2022

Collusion-Resistant Functional Encryption for RAMs.
IACR Cryptol. ePrint Arch., 2022

Pre-Constrained Encryption.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Cryptography from Pseudorandom Quantum States.
IACR Cryptol. ePrint Arch., 2021

Uncloneable Encryption, Revisited.
IACR Cryptol. ePrint Arch., 2021

Unbounded Multi-Party Computation from Learning with Errors.
IACR Cryptol. ePrint Arch., 2021

Towards Accountability in CRS Generation.
IACR Cryptol. ePrint Arch., 2021

Unclonable Encryption, Revisited.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Secure Software Leasing.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

2020
Multikey FHE in the Plain Model.
IACR Cryptol. ePrint Arch., 2020

Multiparty Homomorphic Encryption (or: On Removing Setup in Multi-Key FHE).
IACR Cryptol. ePrint Arch., 2020

On the Concurrent Composition of Quantum Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2020

Towards Efficiency-Preserving Round Compression in MPC: Do fewer rounds mean more computation?
IACR Cryptol. ePrint Arch., 2020

Accelerating 2PC-based ML with Limited Trusted Hardware.
CoRR, 2020

Multi-key Fully-Homomorphic Encryption in the Plain Model.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2019
Optimal Bounded-Collusion Secure Functional Encryption.
IACR Cryptol. ePrint Arch., 2019

Secure Quantum Extraction Protocols.
IACR Cryptol. ePrint Arch., 2019

Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification.
IACR Cryptol. ePrint Arch., 2019

Fully Homomorphic NIZK and NIWI Proofs.
IACR Cryptol. ePrint Arch., 2019

Towards Attribute-Based Encryption for RAMs from LWE: Sub-linear Decryption, and More.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018
Succinct Garbling Schemes from Functional Encryption through a Local Simulation Paradigm.
IACR Cryptol. ePrint Arch., 2018

Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness.
IACR Cryptol. ePrint Arch., 2018

Private Circuits: A Modular Approach.
IACR Cryptol. ePrint Arch., 2018

Attribute Based Encryption for RAMs from LWE.
IACR Cryptol. ePrint Arch., 2018

Two Round Information-Theoretic MPC with Malicious Security.
IACR Cryptol. ePrint Arch., 2018

Round-Optimal Secure Multiparty Computation with Honest Majority.
IACR Cryptol. ePrint Arch., 2018

From FE Combiners to Secure MPC and Back.
IACR Cryptol. ePrint Arch., 2018

2017
Indistinguishability Obfuscation from Low Degree Multilinear Maps.
PhD thesis, 2017

Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption.
IACR Cryptol. ePrint Arch., 2017

A New Approach to Round-Optimal Secure Multiparty Computation.
IACR Cryptol. ePrint Arch., 2017

On Secure Two-Party Computation in Three Rounds.
IACR Cryptol. ePrint Arch., 2017

Patchable Indistinguishability Obfuscation: i<i>O</i> for Evolving Software.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation From Degree-5 Multilinear Maps.
IACR Cryptol. ePrint Arch., 2016

Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security.
IACR Cryptol. ePrint Arch., 2016

Cryptography with Updates.
IACR Cryptol. ePrint Arch., 2016

Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015
Functional Encryption for Turing Machines.
IACR Cryptol. ePrint Arch., 2015

Patchable Obfuscation.
IACR Cryptol. ePrint Arch., 2015

Indistinguishability Obfuscation with Constant Size Overhead.
IACR Cryptol. ePrint Arch., 2015

Achieving Compactness Generically: Indistinguishability Obfuscation from Non-Compact Functional Encryption.
IACR Cryptol. ePrint Arch., 2015

Indistinguishability Obfuscation from Compact Functional Encryption.
IACR Cryptol. ePrint Arch., 2015

Delegating RAM Computations with Adaptive Soundness and Privacy.
IACR Cryptol. ePrint Arch., 2015

From Selective to Adaptive Security in Functional Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Interactive Proofs under Continual Memory Leakage.
IACR Cryptol. ePrint Arch., 2014

Optimizing Obfuscation: Avoiding Barrington's Theorem.
IACR Cryptol. ePrint Arch., 2014

The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically.
IACR Cryptol. ePrint Arch., 2014

Achieving Privacy in Verifiable Computation with Multiple Servers - Without FHE and without Pre-processing.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

2013
Differing-Inputs Obfuscation and Applications.
IACR Cryptol. ePrint Arch., 2013

Lower Bounds in the Hardware Token Model.
IACR Cryptol. ePrint Arch., 2013

2012
Complexity of Gröbner basis detection and border basis detection.
Theor. Comput. Sci., 2012

On the (In)security of Fischlin's Paradigm.
IACR Cryptol. ePrint Arch., 2012

Non Observability in the Random Oracle Model.
IACR Cryptol. ePrint Arch., 2012

An Algebraic Characterization of Rainbow Connectivity.
Proceedings of the Computer Algebra in Scientific Computing - 14th International Workshop, 2012

2011
Hardness and Parameterized Algorithms on Rainbow Connectivity problem
CoRR, 2011

On Gröbner Basis Detection for Zero-dimensional Ideals
CoRR, 2011

New Hardness Results in Rainbow Connectivity
CoRR, 2011

Border basis detection is NP-complete.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

Rainbow Connectivity: Hardness and Tractability.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011


  Loading...