Rainbow Connectivity: Hardness and Tractability. - Prabhanjan Ananth; Meghana Nasre; Kanthi K. Sarpatwar (FSTTCS, 2011)

Border basis detection is NP-complete. - Prabhanjan Vijendra Ananth; Ambedkar Dukkipati (ISSAC, 2011)

New Hardness Results in Rainbow Connectivity - Prabhanjan Ananth; Meghana Nasre (CoRR, 2011)

On Gröbner Basis Detection for Zero-dimensional Ideals - Prabhanjan Vijendra Ananth; Ambedkar Dukkipati (CoRR, 2011)

Hardness and Parameterized Algorithms on Rainbow Connectivity problem - Prabhanjan Ananth; Meghana Nasre; Kanthi K. Sarpatwar (CoRR, 2011)

An Algebraic Characterization of Rainbow Connectivity. - Prabhanjan Vijendra Ananth; Ambedkar Dukkipati (CASC, 2012)

Non Observability in the Random Oracle Model. - Prabhanjan Ananth; Raghav Bhaskar (IACR Cryptol. ePrint Arch., 2012)

On the (In)security of Fischlin's Paradigm. - Prabhanjan Ananth; Raghav Bhaskar; Vipul Goyal; Vanishree Rao (IACR Cryptol. ePrint Arch., 2012)

Complexity of Gröbner basis detection and border basis detection. - Prabhanjan Vijendra Ananth; Ambedkar Dukkipati (Theor. Comput. Sci., 2012)

Lower Bounds in the Hardware Token Model. - Shashank Agrawal; Prabhanjan Ananth; Vipul Goyal; Manoj Prabhakaran 001; Alon Rosen (IACR Cryptol. ePrint Arch., 2013)

Differing-Inputs Obfuscation and Applications. - Prabhanjan Ananth; Dan Boneh; Sanjam Garg; Amit Sahai; Mark Zhandry (IACR Cryptol. ePrint Arch., 2013)

Achieving Privacy in Verifiable Computation with Multiple Servers - Without FHE and without Pre-processing. - Prabhanjan Ananth; Nishanth Chandran; Vipul Goyal; Bhavana Kanukurthi; Rafail Ostrovsky (Public Key Cryptography, 2014)

The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically. - Prabhanjan Ananth; Zvika Brakerski; Gil Segev 001; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2014)

Optimizing Obfuscation: Avoiding Barrington's Theorem. - Prabhanjan Ananth; Divya Gupta 001; Yuval Ishai; Amit Sahai (IACR Cryptol. ePrint Arch., 2014)

Interactive Proofs under Continual Memory Leakage. - Prabhanjan Vijendra Ananth; Vipul Goyal; Omkant Pandey (IACR Cryptol. ePrint Arch., 2014)

From Selective to Adaptive Security in Functional Encryption. - Prabhanjan Ananth; Zvika Brakerski; Gil Segev 001; Vinod Vaikuntanathan (CRYPTO (2), 2015)

Delegating RAM Computations with Adaptive Soundness and Privacy. - Prabhanjan Ananth; Yu-Chi Chen; Kai-Min Chung; Huijia Lin; Wei-Kai Lin (IACR Cryptol. ePrint Arch., 2015)

Indistinguishability Obfuscation from Compact Functional Encryption. - Prabhanjan Ananth; Abhishek Jain 002 (IACR Cryptol. ePrint Arch., 2015)

Achieving Compactness Generically: Indistinguishability Obfuscation from Non-Compact Functional Encryption. - Prabhanjan Ananth; Abhishek Jain 002; Amit Sahai (IACR Cryptol. ePrint Arch., 2015)

Indistinguishability Obfuscation with Constant Size Overhead. - Prabhanjan Ananth; Abhishek Jain 002; Amit Sahai (IACR Cryptol. ePrint Arch., 2015)

Patchable Obfuscation. - Prabhanjan Ananth; Abhishek Jain 002; Amit Sahai (IACR Cryptol. ePrint Arch., 2015)

Functional Encryption for Turing Machines. - Prabhanjan Ananth; Amit Sahai (IACR Cryptol. ePrint Arch., 2015)

Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption. - Prabhanjan Ananth; Aayush Jain; Moni Naor; Amit Sahai; Eylon Yogev (CRYPTO (2), 2016)

Cryptography with Updates. - Prabhanjan Ananth; Aloni Cohen; Abhishek Jain 002 (IACR Cryptol. ePrint Arch., 2016)

Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security. - Prabhanjan Ananth; Aayush Jain; Moni Naor; Amit Sahai; Eylon Yogev (IACR Cryptol. ePrint Arch., 2016)

Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation From Degree-5 Multilinear Maps. - Prabhanjan Ananth; Amit Sahai (IACR Cryptol. ePrint Arch., 2016)

Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization. - Prabhanjan Ananth; Abhishek Jain 002; Amit Sahai (CRYPTO (2), 2017)

Patchable Indistinguishability Obfuscation: iO for Evolving Software. - Prabhanjan Ananth; Abhishek Jain 002; Amit Sahai (EUROCRYPT (3), 2017)

On Secure Two-Party Computation in Three Rounds. - Prabhanjan Ananth; Abhishek Jain 002 (IACR Cryptol. ePrint Arch., 2017)

A New Approach to Round-Optimal Secure Multiparty Computation. - Prabhanjan Ananth; Arka Rai Choudhuri; Abhishek Jain 002 (IACR Cryptol. ePrint Arch., 2017)

Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption. - Prabhanjan Ananth; Aayush Jain; Amit Sahai (IACR Cryptol. ePrint Arch., 2017)

Indistinguishability Obfuscation from Low Degree Multilinear Maps. - Prabhanjan Ananth (2017)

From FE Combiners to Secure MPC and Back. - Prabhanjan Ananth; Saikrishna Badrinarayanan; Aayush Jain; Nathan Manohar; Amit Sahai (IACR Cryptol. ePrint Arch., 2018)

Round-Optimal Secure Multiparty Computation with Honest Majority. - Prabhanjan Ananth; Arka Rai Choudhuri; Aarushi Goel; Abhishek Jain 002 (IACR Cryptol. ePrint Arch., 2018)

Two Round Information-Theoretic MPC with Malicious Security. - Prabhanjan Ananth; Arka Rai Choudhuri; Aarushi Goel; Abhishek Jain 002 (IACR Cryptol. ePrint Arch., 2018)

Attribute Based Encryption for RAMs from LWE. - Prabhanjan Ananth; Xiong Fan (IACR Cryptol. ePrint Arch., 2018)

Private Circuits: A Modular Approach. - Prabhanjan Ananth; Yuval Ishai; Amit Sahai (IACR Cryptol. ePrint Arch., 2018)

Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness. - Prabhanjan Ananth; Aayush Jain; Dakshita Khurana; Amit Sahai (IACR Cryptol. ePrint Arch., 2018)

Succinct Garbling Schemes from Functional Encryption through a Local Simulation Paradigm. - Prabhanjan Ananth; Alex Lombardi (IACR Cryptol. ePrint Arch., 2018)

Towards Attribute-Based Encryption for RAMs from LWE: Sub-linear Decryption, and More. - Prabhanjan Ananth; Xiong Fan; Elaine Shi (ASIACRYPT (1), 2019)

Fully Homomorphic NIZK and NIWI Proofs. - Prabhanjan Ananth; Apoorvaa Deshpande; Yael Tauman Kalai; Anna Lysyanskaya (IACR Cryptol. ePrint Arch., 2019)

Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification. - Prabhanjan Ananth; Aayush Jain; Huijia Lin; Christian Matt 002; Amit Sahai (IACR Cryptol. ePrint Arch., 2019)

Secure Quantum Extraction Protocols. - Prabhanjan Ananth; Rolando L. La Placa (IACR Cryptol. ePrint Arch., 2019)

Optimal Bounded-Collusion Secure Functional Encryption. - Prabhanjan Ananth; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2019)

Multi-key Fully-Homomorphic Encryption in the Plain Model. - Prabhanjan Ananth; Abhishek Jain 002; Zhengzhong Jin; Giulio Malavolta (TCC (1), 2020)

Accelerating 2PC-based ML with Limited Trusted Hardware. - Muqsit Nawaz; Aditya Gulati; Kunlong Liu; Vishwajeet Agrawal; Prabhanjan Ananth; Trinabh Gupta (CoRR, 2020)

Towards Efficiency-Preserving Round Compression in MPC: Do fewer rounds mean more computation? - Prabhanjan Ananth; Arka Rai Choudhuri; Aarushi Goel; Abhishek Jain 002 (IACR Cryptol. ePrint Arch., 2020)

On the Concurrent Composition of Quantum Zero-Knowledge. - Prabhanjan Ananth; Kai-Min Chung; Rolando L. La Placa (IACR Cryptol. ePrint Arch., 2020)

Multiparty Homomorphic Encryption (or: On Removing Setup in Multi-Key FHE). - Prabhanjan Ananth; Abhishek Jain 002; Zhengzhong Jin (IACR Cryptol. ePrint Arch., 2020)

Multikey FHE in the Plain Model. - Prabhanjan Ananth; Abhishek Jain 002; Zhengzhong Jin; Giulio Malavolta (IACR Cryptol. ePrint Arch., 2020)

Secure Software Leasing. - Prabhanjan Ananth; Rolando L. La Placa (EUROCRYPT (2), 2021)

Unclonable Encryption, Revisited. - Prabhanjan Ananth; Fatih Kaleoglu (TCC (1), 2021)

Towards Accountability in CRS Generation. - Prabhanjan Ananth; Gilad Asharov; Hila Dahari; Vipul Goyal (IACR Cryptol. ePrint Arch., 2021)

Unbounded Multi-Party Computation from Learning with Errors. - Prabhanjan Ananth; Abhishek Jain 002; Zhengzhong Jin; Giulio Malavolta (IACR Cryptol. ePrint Arch., 2021)

Uncloneable Encryption, Revisited. - Prabhanjan Ananth; Fatih Kaleoglu (IACR Cryptol. ePrint Arch., 2021)

Cryptography from Pseudorandom Quantum States. - Prabhanjan Ananth; Luowen Qian; Henry Yuen (IACR Cryptol. ePrint Arch., 2021)

Pre-Constrained Encryption. - Prabhanjan Ananth; Abhishek Jain 002; Zhengzhong Jin; Giulio Malavolta (ITCS, 2022)

Collusion-Resistant Functional Encryption for RAMs. - Prabhanjan Ananth; Kai-Min Chung; Xiong Fan; Luowen Qian (IACR Cryptol. ePrint Arch., 2022)

Post-Quantum Zero-Knowledge with Space-Bounded Simulation. - Prabhanjan Ananth; Alex B. Grilo (IACR Cryptol. ePrint Arch., 2022)

Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications. - Prabhanjan Ananth; Aditya Gulati; Luowen Qian; Henry Yuen (IACR Cryptol. ePrint Arch., 2022)

On the Feasibility of Unclonable Encryption, and More. - Prabhanjan Ananth; Fatih Kaleoglu; Xingjian Li 006; Qipeng Liu 001; Mark Zhandry (IACR Cryptol. ePrint Arch., 2022)

A Note on Copy-Protection from Random Oracles. - Prabhanjan Ananth; Fatih Kaleoglu (IACR Cryptol. ePrint Arch., 2022)

ORTOA: One Round Trip Oblivious Access. - Sujaya Maiyya; Yuval Steinhart; Divyakant Agrawal; Prabhanjan Ananth; Amr El Abbadi (IACR Cryptol. ePrint Arch., 2022)

A Modular Approach to Unclonable Cryptography. - Prabhanjan Ananth; Amit Behera (IACR Cryptol. ePrint Arch., 2023)

Pseudorandom Isometries. - Prabhanjan Ananth; Aditya Gulati; Fatih Kaleoglu; Yao-Ting Lin (IACR Cryptol. ePrint Arch., 2023)

On the (Im)plausibility of Public-Key Quantum Money from Collision-Resistant Hash Functions. - Prabhanjan Ananth; Zihan Hu; Henry Yuen (IACR Cryptol. ePrint Arch., 2023)

Cloning Games: A General Framework for Unclonable Primitives. - Prabhanjan Ananth; Fatih Kaleoglu; Qipeng Liu 001 (IACR Cryptol. ePrint Arch., 2023)

Pseudorandom Strings from Pseudorandom Quantum States. - Prabhanjan Ananth; Yao-Ting Lin; Henry Yuen (IACR Cryptol. ePrint Arch., 2023)

Revocable Cryptography from Learning with Errors. - Prabhanjan Ananth; Alexander Poremba; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2023)

ORTOA: A Family of One Round Trip Protocols For Operation-Type Obliviousness. - Sujaya Maiyya; Yuval Steinhart; Adrian Davila; Jason Du; Divyakant Agrawal; Prabhanjan Ananth; Amr El Abbadi (EDBT, 2024)

Provable Robust Watermarking for AI-Generated Text. - Xuandong Zhao; Prabhanjan Vijendra Ananth; Lei Li 005; Yu-Xiang Wang 003 (ICLR, 2024)

Ideal Pseudorandom Codes. - Omar Alrabiah; Prabhanjan Ananth; Miranda Christ; Yevgeniy Dodis; Sam Gunn (IACR Cryptol. ePrint Arch., 2024)

NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness. - Prabhanjan Ananth; Gilad Asharov; Vipul Goyal; Hadar Kaner; Pratik Soni; Brent Waters (IACR Cryptol. ePrint Arch., 2024)

Pseudorandomness in the (Inverseless) Haar Random Oracle Model. - Prabhanjan Ananth; John Bostanci; Aditya Gulati; Yao-Ting Lin (IACR Cryptol. ePrint Arch., 2024)

A Note on the Common Haar State Model. - Prabhanjan Ananth; Aditya Gulati; Yao-Ting Lin (IACR Cryptol. ePrint Arch., 2024)

Cryptography in the Common Haar State Model: Feasibility Results and Separations. - Prabhanjan Ananth; Aditya Gulati; Yao-Ting Lin (IACR Cryptol. ePrint Arch., 2024)

Unclonable Secret Sharing. - Prabhanjan Ananth; Vipul Goyal; Jiahui Liu 003; Qipeng Liu 001 (IACR Cryptol. ePrint Arch., 2024)

Quantum Key-Revocable Dual-Regev Encryption, Revisited. - Prabhanjan Ananth; Zihan Hu; Zikuan Huang (IACR Cryptol. ePrint Arch., 2024)

Simultaneous Haar Indistinguishability with Applications to Unclonable Cryptography. - Prabhanjan Ananth; Fatih Kaleoglu; Henry Yuen (IACR Cryptol. ePrint Arch., 2024)

Revocable Encryption, Programs, and More: The Case of Multi-Copy Security. - Prabhanjan Ananth; Saachi Mutreja; Alexander Poremba (IACR Cryptol. ePrint Arch., 2024)

Copy-Protection from UPO, Revisited. - Prabhanjan Ananth; Amit Behera; Zikuan Huang (IACR Cryptol. ePrint Arch., 2025)