default search action
Prabhanjan Vijendra Ananth
Prabhanjan Ananth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c54]Prabhanjan Ananth, Amit Behera:
A Modular Approach to Unclonable Cryptography. CRYPTO (7) 2024: 3-37 - [c53]Sujaya Maiyya, Yuval Steinhart, Adrian Davila, Jason Du, Divyakant Agrawal, Prabhanjan Ananth, Amr El Abbadi:
ORTOA: A Family of One Round Trip Protocols For Operation-Type Obliviousness. EDBT 2024: 534-546 - [c52]Prabhanjan Ananth, Aditya Gulati, Fatih Kaleoglu, Yao-Ting Lin:
Pseudorandom Isometries. EUROCRYPT (4) 2024: 226-254 - [c51]Xuandong Zhao, Prabhanjan Vijendra Ananth, Lei Li, Yu-Xiang Wang:
Provable Robust Watermarking for AI-Generated Text. ICLR 2024 - [c50]Prabhanjan Ananth, Yao-Ting Lin, Henry Yuen:
Pseudorandom Strings from Pseudorandom Quantum States. ITCS 2024: 6:1-6:22 - [c49]Prabhanjan Ananth
, Gilad Asharov
NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness. SCN (1) 2024: 3-23 - [c48]Prabhanjan Ananth, Aditya Gulati, Yao-Ting Lin:
Cryptography in the Common Haar State Model: Feasibility Results and Separations. TCC (2) 2024: 94-125 - [c47]Prabhanjan Ananth, Zihan Hu, Zikuan Huang:
Quantum Key-Revocable Dual-Regev Encryption, Revisited. TCC (3) 2024: 257-288 - [i86]Prabhanjan Ananth, Aditya Gulati, Yao-Ting Lin:
A Note on the Common Haar State Model. CoRR abs/2404.05227 (2024) - [i85]Prabhanjan Ananth, Fatih Kaleoglu, Henry Yuen:
Simultaneous Haar Indistinguishability with Applications to Unclonable Cryptography. CoRR abs/2405.10274 (2024) - [i84]Prabhanjan Ananth, Vipul Goyal, Jiahui Liu, Qipeng Liu:
Unclonable Secret Sharing. CoRR abs/2406.11008 (2024) - [i83]Prabhanjan Ananth, Aditya Gulati, Yao-Ting Lin:
Cryptography in the Common Haar State Model: Feasibility Results and Separations. CoRR abs/2407.07908 (2024) - [i82]Prabhanjan Ananth, Saachi Mutreja, Alexander Poremba:
Revocable Encryption, Programs, and More: The Case of Multi-Copy Security. CoRR abs/2410.13163 (2024) - [i81]Prabhanjan Ananth, John Bostanci, Aditya Gulati, Yao-Ting Lin:
Pseudorandomness in the (Inverseless) Haar Random Oracle Model. CoRR abs/2410.19320 (2024) - [i80]Prabhanjan Ananth, Gilad Asharov, Vipul Goyal, Hadar Kaner, Pratik Soni, Brent Waters:
NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness. IACR Cryptol. ePrint Arch. 2024: 207 (2024) - [i79]Prabhanjan Ananth, Aditya Gulati, Yao-Ting Lin:
A Note on the Common Haar State Model. IACR Cryptol. ePrint Arch. 2024: 543 (2024) - [i78]Prabhanjan Ananth, Vipul Goyal, Jiahui Liu, Qipeng Liu:
Unclonable Secret Sharing. IACR Cryptol. ePrint Arch. 2024: 716 (2024) - [i77]Prabhanjan Ananth, Zihan Hu, Zikuan Huang:
Quantum Key-Revocable Dual-Regev Encryption, Revisited. IACR Cryptol. ePrint Arch. 2024: 738 (2024) - [i76]Prabhanjan Ananth, Fatih Kaleoglu, Henry Yuen:
Simultaneous Haar Indistinguishability with Applications to Unclonable Cryptography. IACR Cryptol. ePrint Arch. 2024: 751 (2024) - [i75]Prabhanjan Ananth, Aditya Gulati, Yao-Ting Lin:
Cryptography in the Common Haar State Model: Feasibility Results and Separations. IACR Cryptol. ePrint Arch. 2024: 1043 (2024) - [i74]Prabhanjan Ananth, Saachi Mutreja, Alexander Poremba:
Revocable Encryption, Programs, and More: The Case of Multi-Copy Security. IACR Cryptol. ePrint Arch. 2024: 1687 (2024) - [i73]Prabhanjan Ananth, John Bostanci, Aditya Gulati, Yao-Ting Lin:
Pseudorandomness in the (Inverseless) Haar Random Oracle Model. IACR Cryptol. ePrint Arch. 2024: 1745 (2024) - [i72]Omar Alrabiah, Prabhanjan Ananth, Miranda Christ, Yevgeniy Dodis, Sam Gunn:
Ideal Pseudorandom Codes. IACR Cryptol. ePrint Arch. 2024: 1840 (2024) - 2023
- [c46]Prabhanjan Ananth
On the (Im)plausibility of Public-Key Quantum Money from Collision-Resistant Hash Functions. ASIACRYPT (8) 2023: 39-72 - [c45]Prabhanjan Ananth, Fatih Kaleoglu, Qipeng Liu:
Cloning Games: A General Framework for Unclonable Primitives. CRYPTO (5) 2023: 66-98 - [c44]Prabhanjan Ananth, Alexander Poremba
Revocable Cryptography from Learning with Errors. TCC (4) 2023: 93-122 - [i71]Prabhanjan Ananth, Zihan Hu, Henry Yuen:
On the (Im)plausibility of Public-Key Quantum Money from Collision-Resistant Hash Functions. CoRR abs/2301.09236 (2023) - [i70]Prabhanjan Ananth, Fatih Kaleoglu, Qipeng Liu:
Cloning Games: A General Framework for Unclonable Primitives. CoRR abs/2302.01874 (2023) - [i69]Prabhanjan Ananth, Alexander Poremba, Vinod Vaikuntanathan:
Revocable Cryptography from Learning with Errors. CoRR abs/2302.14860 (2023) - [i68]Prabhanjan Ananth, Yao-Ting Lin, Henry Yuen:
Pseudorandom Strings from Pseudorandom Quantum States. CoRR abs/2306.05613 (2023) - [i67]Xuandong Zhao, Prabhanjan Ananth, Lei Li, Yu-Xiang Wang:
Provable Robust Watermarking for AI-Generated Text. CoRR abs/2306.17439 (2023) - [i66]Prabhanjan Ananth, Aditya Gulati, Fatih Kaleoglu, Yao-Ting Lin:
Pseudorandom Isometries. CoRR abs/2311.02901 (2023) - [i65]Prabhanjan Ananth, Amit Behera:
A Modular Approach to Unclonable Cryptography. CoRR abs/2311.11890 (2023) - [i64]Prabhanjan Ananth, Zihan Hu, Henry Yuen:
On the (Im)plausibility of Public-Key Quantum Money from Collision-Resistant Hash Functions. IACR Cryptol. ePrint Arch. 2023: 69 (2023) - [i63]Prabhanjan Ananth, Fatih Kaleoglu, Qipeng Liu:
Cloning Games: A General Framework for Unclonable Primitives. IACR Cryptol. ePrint Arch. 2023: 128 (2023) - [i62]Prabhanjan Ananth, Alexander Poremba, Vinod Vaikuntanathan:
Revocable Cryptography from Learning with Errors. IACR Cryptol. ePrint Arch. 2023: 325 (2023) - [i61]Prabhanjan Ananth, Yao-Ting Lin, Henry Yuen:
Pseudorandom Strings from Pseudorandom Quantum States. IACR Cryptol. ePrint Arch. 2023: 904 (2023) - [i60]Prabhanjan Ananth, Aditya Gulati, Fatih Kaleoglu, Yao-Ting Lin:
Pseudorandom Isometries. IACR Cryptol. ePrint Arch. 2023: 1741 (2023) - [i59]Prabhanjan Ananth, Amit Behera:
A Modular Approach to Unclonable Cryptography. IACR Cryptol. ePrint Arch. 2023: 1797 (2023) - 2022
- [c43]Prabhanjan Ananth, Kai-Min Chung, Xiong Fan, Luowen Qian:
Collusion-Resistant Functional Encryption for RAMs. ASIACRYPT (1) 2022: 160-194 - [c42]Prabhanjan Ananth
Cryptography from Pseudorandom Quantum States. CRYPTO (1) 2022: 208-236 - [c41]Prabhanjan Ananth, Fatih Kaleoglu, Xingjian Li
On the Feasibility of Unclonable Encryption, and More. CRYPTO (2) 2022: 212-241 - [c40]Prabhanjan Ananth, Abhishek Jain
Pre-Constrained Encryption. ITCS 2022: 4:1-4:20 - [c39]Prabhanjan Ananth, Aditya Gulati, Luowen Qian, Henry Yuen:
Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications. TCC (1) 2022: 237-265 - [i58]Prabhanjan Ananth, Fatih Kaleoglu, Xingjian Li
On the Feasibility of Unclonable Encryption, and More. CoRR abs/2207.06589 (2022) - [i57]Prabhanjan Ananth, Fatih Kaleoglu:
A Note on Copy-Protection from Random Oracles. CoRR abs/2208.12884 (2022) - [i56]Prabhanjan Ananth, Alex B. Grilo:
Post-Quantum Zero-Knowledge with Space-Bounded Simulation. CoRR abs/2210.06093 (2022) - [i55]Prabhanjan Ananth, Aditya Gulati, Luowen Qian, Henry Yuen:
Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications. CoRR abs/2211.01444 (2022) - [i54]Prabhanjan Ananth, Fatih Kaleoglu, Xingjian Li, Qipeng Liu, Mark Zhandry:
On the Feasibility of Unclonable Encryption, and More. IACR Cryptol. ePrint Arch. 2022: 884 (2022) - [i53]Prabhanjan Ananth, Fatih Kaleoglu:
A Note on Copy-Protection from Random Oracles. IACR Cryptol. ePrint Arch. 2022: 1109 (2022) - [i52]Prabhanjan Ananth, Kai-Min Chung, Xiong Fan, Luowen Qian:
Collusion-Resistant Functional Encryption for RAMs. IACR Cryptol. ePrint Arch. 2022: 1269 (2022) - [i51]Prabhanjan Ananth, Alex B. Grilo:
Post-Quantum Zero-Knowledge with Space-Bounded Simulation. IACR Cryptol. ePrint Arch. 2022: 1380 (2022) - [i50]Sujaya Maiyya, Yuval Steinhart, Divyakant Agrawal, Prabhanjan Ananth, Amr El Abbadi:
ORTOA: One Round Trip Oblivious Access. IACR Cryptol. ePrint Arch. 2022: 1506 (2022) - [i49]Prabhanjan Ananth, Aditya Gulati, Luowen Qian, Henry Yuen:
Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications. IACR Cryptol. ePrint Arch. 2022: 1514 (2022) - 2021
- [c38]Prabhanjan Ananth, Kai-Min Chung, Rolando L. La Placa:
On the Concurrent Composition of Quantum Zero-Knowledge. CRYPTO (1) 2021: 346-374 - [c37]Prabhanjan Ananth, Gilad Asharov
Towards Accountability in CRS Generation. EUROCRYPT (3) 2021: 278-308 - [c36]Prabhanjan Ananth, Rolando L. La Placa:
Secure Software Leasing. EUROCRYPT (2) 2021: 501-530 - [c35]Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, Giulio Malavolta
Unbounded Multi-party Computation from Learning with Errors. EUROCRYPT (2) 2021: 754-781 - [c34]Prabhanjan Ananth, Fatih Kaleoglu:
Unclonable Encryption, Revisited. TCC (1) 2021: 299-329 - [i48]Prabhanjan Ananth, Fatih Kaleoglu:
Uncloneable Encryption, Revisited. CoRR abs/2103.15009 (2021) - [i47]Prabhanjan Ananth, Luowen Qian, Henry Yuen:
Cryptography from Pseudorandom Quantum States. CoRR abs/2112.10020 (2021) - [i46]Prabhanjan Ananth, Fatih Kaleoglu:
Uncloneable Encryption, Revisited. IACR Cryptol. ePrint Arch. 2021: 412 (2021) - [i45]Prabhanjan Ananth, Abhishek Jain
Unbounded Multi-Party Computation from Learning with Errors. IACR Cryptol. ePrint Arch. 2021: 431 (2021) - [i44]Prabhanjan Ananth, Gilad Asharov, Hila Dahari, Vipul Goyal:
Towards Accountability in CRS Generation. IACR Cryptol. ePrint Arch. 2021: 1090 (2021) - [i43]Prabhanjan Ananth, Luowen Qian, Henry Yuen:
Cryptography from Pseudorandom Quantum States. IACR Cryptol. ePrint Arch. 2021: 1663 (2021) - 2020
- [c33]Prabhanjan Ananth, Arka Rai Choudhuri
Towards Efficiency-Preserving Round Compression in MPC - Do Fewer Rounds Mean More Computation? ASIACRYPT (3) 2020: 181-212 - [c32]Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, Giulio Malavolta
Multi-key Fully-Homomorphic Encryption in the Plain Model. TCC (1) 2020: 28-57 - [c31]Prabhanjan Ananth, Rolando L. La Placa:
Secure Quantum Extraction Protocols. TCC (3) 2020: 123-152 - [i42]Prabhanjan Ananth, Rolando L. La Placa:
Secure Software Leasing. CoRR abs/2005.05289 (2020) - [i41]Muqsit Nawaz, Aditya Gulati, Kunlong Liu, Vishwajeet Agrawal, Prabhanjan Ananth, Trinabh Gupta:
Accelerating 2PC-based ML with Limited Trusted Hardware. CoRR abs/2009.05566 (2020) - [i40]Prabhanjan Ananth, Abhishek Jain
Multiparty Homomorphic Encryption (or: On Removing Setup in Multi-Key FHE). IACR Cryptol. ePrint Arch. 2020: 169 (2020) - [i39]Prabhanjan Ananth, Abhishek Jain
Multikey FHE in the Plain Model. IACR Cryptol. ePrint Arch. 2020: 180 (2020) - [i38]Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain
Towards Efficiency-Preserving Round Compression in MPC: Do fewer rounds mean more computation? IACR Cryptol. ePrint Arch. 2020: 1100 (2020) - [i37]Prabhanjan Ananth, Kai-Min Chung, Rolando L. La Placa:
On the Concurrent Composition of Quantum Zero-Knowledge. IACR Cryptol. ePrint Arch. 2020: 1528 (2020)
2010 – 2019
- 2019
- [c30]Prabhanjan Ananth, Xiong Fan, Elaine Shi:
Towards Attribute-Based Encryption for RAMs from LWE: Sub-linear Decryption, and More. ASIACRYPT (1) 2019: 112-141 - [c29]Prabhanjan Ananth, Aayush Jain, Huijia Lin, Christian Matt
Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification. CRYPTO (3) 2019: 284-332 - [c28]Prabhanjan Ananth, Arka Rai Choudhuri
Two Round Information-Theoretic MPC with Malicious Security. EUROCRYPT (2) 2019: 532-561 - [c27]Prabhanjan Ananth, Vinod Vaikuntanathan:
Optimal Bounded-Collusion Secure Functional Encryption. TCC (1) 2019: 174-198 - [c26]Prabhanjan Ananth, Saikrishna Badrinarayanan, Aayush Jain, Nathan Manohar, Amit Sahai:
From FE Combiners to Secure MPC and Back. TCC (1) 2019: 199-228 - [c25]Prabhanjan Ananth, Apoorvaa Deshpande, Yael Tauman Kalai, Anna Lysyanskaya:
Fully Homomorphic NIZK and NIWI Proofs. TCC (2) 2019: 356-385 - [i36]Prabhanjan Ananth, Rolando L. La Placa:
Secure Quantum Extraction Protocols. CoRR abs/1911.07672 (2019) - [i35]Prabhanjan Ananth, Vinod Vaikuntanathan:
Optimal Bounded-Collusion Secure Functional Encryption. IACR Cryptol. ePrint Arch. 2019: 314 (2019) - [i34]Prabhanjan Ananth, Aayush Jain, Huijia Lin, Christian Matt, Amit Sahai:
Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification. IACR Cryptol. ePrint Arch. 2019: 643 (2019) - [i33]Prabhanjan Ananth, Apoorvaa Deshpande, Yael Tauman Kalai, Anna Lysyanskaya:
Fully Homomorphic NIZK and NIWI Proofs. IACR Cryptol. ePrint Arch. 2019: 732 (2019) - [i32]Prabhanjan Ananth, Rolando L. La Placa:
Secure Quantum Extraction Protocols. IACR Cryptol. ePrint Arch. 2019: 1323 (2019) - 2018
- [c24]Prabhanjan Ananth, Arka Rai Choudhuri
Round-Optimal Secure Multiparty Computation with Honest Majority. CRYPTO (2) 2018: 395-424 - [c23]Prabhanjan Ananth, Yuval Ishai, Amit Sahai:
Private Circuits: A Modular Approach. CRYPTO (3) 2018: 427-455 - [c22]Prabhanjan Ananth, Alex Lombardi:
Succinct Garbling Schemes from Functional Encryption Through a Local Simulation Paradigm. TCC (2) 2018: 455-472 - [i31]Prabhanjan Ananth, Xiong Fan:
Attribute Based Encryption for RAMs from LWE. IACR Cryptol. ePrint Arch. 2018: 273 (2018) - [i30]Prabhanjan Ananth, Saikrishna Badrinarayanan, Aayush Jain, Nathan Manohar, Amit Sahai:
From FE Combiners to Secure MPC and Back. IACR Cryptol. ePrint Arch. 2018: 457 (2018) - [i29]Prabhanjan Ananth, Yuval Ishai, Amit Sahai:
Private Circuits: A Modular Approach. IACR Cryptol. ePrint Arch. 2018: 566 (2018) - [i28]Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain
Round-Optimal Secure Multiparty Computation with Honest Majority. IACR Cryptol. ePrint Arch. 2018: 572 (2018) - [i27]Prabhanjan Ananth, Aayush Jain, Dakshita Khurana, Amit Sahai:
Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness. IACR Cryptol. ePrint Arch. 2018: 615 (2018) - [i26]Prabhanjan Ananth, Alex Lombardi:
Succinct Garbling Schemes from Functional Encryption through a Local Simulation Paradigm. IACR Cryptol. ePrint Arch. 2018: 759 (2018) - [i25]Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain
Two Round Information-Theoretic MPC with Malicious Security. IACR Cryptol. ePrint Arch. 2018: 1078 (2018) - 2017
- [b1]Prabhanjan Ananth:
Indistinguishability Obfuscation from Low Degree Multilinear Maps. University of California, Los Angeles, USA, 2017 - [c21]Prabhanjan Ananth, Abhishek Jain, Amit Sahai:
Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization. CRYPTO (2) 2017: 252-279 - [c20]Prabhanjan Ananth, Arka Rai Choudhuri
A New Approach to Round-Optimal Secure Multiparty Computation. CRYPTO (1) 2017: 468-499 - [c19]Prabhanjan Ananth, Aayush Jain, Amit Sahai:
Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption. EUROCRYPT (1) 2017: 91-121 - [c18]Prabhanjan Ananth, Abhishek Jain, Amit Sahai:
Patchable Indistinguishability Obfuscation: iO for Evolving Software. EUROCRYPT (3) 2017: 127-155 - [c17]Prabhanjan Ananth, Amit Sahai:
Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps. EUROCRYPT (1) 2017: 152-181 - [c16]Prabhanjan Ananth, Aloni Cohen, Abhishek Jain:
Cryptography with Updates. EUROCRYPT (2) 2017: 445-472 - [c15]Prabhanjan Ananth, Abhishek Jain:
On Secure Two-Party Computation in Three Rounds. TCC (1) 2017: 612-644 - [i24]Prabhanjan Ananth, Aayush Jain, Amit Sahai:
Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption. IACR Cryptol. ePrint Arch. 2017: 127 (2017) - [i23]Prabhanjan Ananth, Arka Rai Choudhuri, Abhishek Jain
A New Approach to Round-Optimal Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2017: 402 (2017) - [i22]Prabhanjan Ananth, Abhishek Jain
On Secure Two-Party Computation in Three Rounds. IACR Cryptol. ePrint Arch. 2017: 942 (2017) - 2016
- [c14]Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev:
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption. CRYPTO (2) 2016: 491-520 - [c13]Prabhanjan Ananth, Yu-Chi Chen
Delegating RAM Computations with Adaptive Soundness and Privacy. TCC (B2) 2016: 3-30 - [c12]Prabhanjan Vijendra Ananth, Amit Sahai:
Functional Encryption for Turing Machines. TCC (A1) 2016: 125-153 - [i21]Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev:
Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security. IACR Cryptol. ePrint Arch. 2016: 281 (2016) - [i20]Prabhanjan Ananth, Aloni Cohen, Abhishek Jain
Cryptography with Updates. IACR Cryptol. ePrint Arch. 2016: 934 (2016) - [i19]Prabhanjan Ananth, Amit Sahai:
Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation From Degree-5 Multilinear Maps. IACR Cryptol. ePrint Arch. 2016: 1097 (2016) - 2015
- [c11]Prabhanjan Ananth, Abhishek Jain:
Indistinguishability Obfuscation from Compact Functional Encryption. CRYPTO (1) 2015: 308-326 - [c10]Prabhanjan Ananth, Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan:
From Selective to Adaptive Security in Functional Encryption. CRYPTO (2) 2015: 657-677 - [i18]Prabhanjan Ananth, Abhishek Jain
Indistinguishability Obfuscation from Compact Functional Encryption. IACR Cryptol. ePrint Arch. 2015: 173 (2015) - [i17]Prabhanjan Ananth, Abhishek Jain
Achieving Compactness Generically: Indistinguishability Obfuscation from Non-Compact Functional Encryption. IACR Cryptol. ePrint Arch. 2015: 730 (2015) - [i16]Prabhanjan Ananth, Amit Sahai:
Functional Encryption for Turing Machines. IACR Cryptol. ePrint Arch. 2015: 776 (2015) - [i15]Prabhanjan Ananth, Abhishek Jain
Indistinguishability Obfuscation with Constant Size Overhead. IACR Cryptol. ePrint Arch. 2015: 1023 (2015) - [i14]Prabhanjan Ananth, Yu-Chi Chen, Kai-Min Chung, Huijia Lin, Wei-Kai Lin:
Delegating RAM Computations with Adaptive Soundness and Privacy. IACR Cryptol. ePrint Arch. 2015: 1082 (2015) - [i13]Prabhanjan Ananth, Abhishek Jain
Patchable Obfuscation. IACR Cryptol. ePrint Arch. 2015: 1084 (2015) - 2014
- [c9]Prabhanjan Vijendra Ananth, Divya Gupta, Yuval Ishai, Amit Sahai:
Optimizing Obfuscation: Avoiding Barrington's Theorem. CCS 2014: 646-658 - [c8]Prabhanjan Ananth, Vipul Goyal, Omkant Pandey:
Interactive Proofs under Continual Memory Leakage. CRYPTO (2) 2014: 164-182 - [c7]Prabhanjan Ananth, Nishanth Chandran, Vipul Goyal, Bhavana Kanukurthi, Rafail Ostrovsky:
Achieving Privacy in Verifiable Computation with Multiple Servers - Without FHE and without Pre-processing. Public Key Cryptography 2014: 149-166 - [c6]Shashank Agrawal, Prabhanjan Ananth, Vipul Goyal, Manoj Prabhakaran, Alon Rosen:
Lower Bounds in the Hardware Token Model. TCC 2014: 663-687 - [i12]Prabhanjan Ananth, Divya Gupta, Yuval Ishai, Amit Sahai:
Optimizing Obfuscation: Avoiding Barrington's Theorem. IACR Cryptol. ePrint Arch. 2014: 222 (2014) - [i11]Prabhanjan Vijendra Ananth, Vipul Goyal, Omkant Pandey:
Interactive Proofs under Continual Memory Leakage. IACR Cryptol. ePrint Arch. 2014: 660 (2014) - [i10]Prabhanjan Ananth, Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan:
The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically. IACR Cryptol. ePrint Arch. 2014: 917 (2014) - 2013
- [c5]Prabhanjan Ananth, Raghav Bhaskar:
Non Observability in the Random Oracle Model. ProvSec 2013: 86-103 - [c4]Prabhanjan Ananth, Raghav Bhaskar, Vipul Goyal, Vanishree Rao:
On the (In)security of Fischlin's Paradigm. TCC 2013: 202-221 - [i9]Prabhanjan Ananth, Dan Boneh, Sanjam Garg
Differing-Inputs Obfuscation and Applications. IACR Cryptol. ePrint Arch. 2013: 689 (2013) - [i8]Shashank Agrawal, Prabhanjan Ananth, Vipul Goyal, Manoj Prabhakaran, Alon Rosen:
Lower Bounds in the Hardware Token Model. IACR Cryptol. ePrint Arch. 2013: 827 (2013) - 2012
- [j1]Prabhanjan Vijendra Ananth, Ambedkar Dukkipati:
Complexity of Gröbner basis detection and border basis detection. Theor. Comput. Sci. 459: 1-15 (2012) - [c3]Prabhanjan Vijendra Ananth, Ambedkar Dukkipati:
An Algebraic Characterization of Rainbow Connectivity. CASC 2012: 12-21 - [i7]Prabhanjan Ananth, Raghav Bhaskar:
Non Observability in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2012: 710 (2012) - [i6]Prabhanjan Ananth, Raghav Bhaskar, Vipul Goyal, Vanishree Rao:
On the (In)security of Fischlin's Paradigm. IACR Cryptol. ePrint Arch. 2012: 721 (2012) - 2011
- [c2]Prabhanjan Ananth, Meghana Nasre
Rainbow Connectivity: Hardness and Tractability. FSTTCS 2011: 241-251 - [c1]Prabhanjan Vijendra Ananth, Ambedkar Dukkipati:
Border basis detection is NP-complete. ISSAC 2011: 11-18 - [i5]Prabhanjan Ananth, Meghana Nasre:
New Hardness Results in Rainbow Connectivity. CoRR abs/1104.2074 (2011) - [i4]Prabhanjan Vijendra Ananth, Ambedkar Dukkipati:
On Gröbner Basis Detection for Zero-dimensional Ideals. CoRR abs/1105.0433 (2011) - [i3]Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar:
Hardness and Parameterized Algorithms on Rainbow Connectivity problem. CoRR abs/1105.0979 (2011) - [i2]Prabhanjan Vijendra Ananth, Ambedkar Dukkipati:
An Algebraic Characterization of Rainbow Connectivity. CoRR abs/1109.2291 (2011) - 2010
- [i1]Prabhanjan Vijendra Ananth, Ambedkar Dukkipati:
Border basis detection is NP-complete. CoRR abs/1011.6021 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-13 19:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: