Fair Identification. - Omkant Pandey; Julien Cathalo; Jean-Jacques Quisquater (CT-RSA, 2006)

Improved Algorithms for Optimal Embeddings. - Nishanth Chandran; Ryan Moriarty; Rafail Ostrovsky; Omkant Pandey; Amit Sahai (Electron. Colloquium Comput. Complex., 2006)

Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data. - Vipul Goyal; Omkant Pandey; Amit Sahai; Brent Waters (IACR Cryptol. ePrint Arch., 2006)

Private Locally Decodable Codes. - Rafail Ostrovsky; Omkant Pandey; Amit Sahai (IACR Cryptol. ePrint Arch., 2007)

Precise Concurrent Zero Knowledge. - Omkant Pandey; Rafael Pass; Amit Sahai; Wei-Lung Dustin Tseng; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2007)

Adaptive One-Way Functions and Applications. - Omkant Pandey; Rafael Pass; Vinod Vaikuntanathan (CRYPTO, 2008)

Bounded Ciphertext Policy Attribute Based Encryption. - Vipul Goyal; Abhishek Jain 002; Omkant Pandey; Amit Sahai (ICALP (2), 2008)

Non-black-box Techniques Are Not Necessary for Constant Round Non-malleable Protocols. - Omkant Pandey (IACR Cryptol. ePrint Arch., 2008)

Improved algorithms for optimal embeddings. - Nishanth Chandran; Ryan Moriarty; Rafail Ostrovsky; Omkant Pandey; Mohammad Ali Safari; Amit Sahai (ACM Trans. Algorithms, 2008)

Computational Differential Privacy. - Ilya Mironov; Omkant Pandey; Omer Reingold; Salil P. Vadhan (CRYPTO, 2009)

Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge. - Rafail Ostrovsky; Omkant Pandey; Ivan Visconti (TCC, 2010)

Publicly Verifiable Secret Sharing for Cloud-Based Key Management. - Roy D'Souza; David Jao; Ilya Mironov; Omkant Pandey (INDOCRYPT, 2011)

Non-Malleable Zero Knowledge: Black-Box Constructions and Definitional Relationships. - Abhishek Jain 002; Omkant Pandey (IACR Cryptol. ePrint Arch., 2011)

Property Preserving Symmetric Encryption. - Omkant Pandey; Yannis Rouselakis (EUROCRYPT, 2012)

Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma. - Vipul Goyal; Omkant Pandey; Amit Sahai (IACR Cryptol. ePrint Arch., 2012)

Cryptography Using CAPTCHA Puzzles. - Abishek Kumarasubramanian; Rafail Ostrovsky; Omkant Pandey; Akshay Wadia (IACR Cryptol. ePrint Arch., 2012)

Achieving Constant Round Leakage-Resilient Zero-Knowledge. - Omkant Pandey (IACR Cryptol. ePrint Arch., 2012)

Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols. - Vipul Goyal; Ilya Mironov; Omkant Pandey; Amit Sahai (CRYPTO (1), 2013)

Obfuscation-based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP. - Omkant Pandey; Manoj Prabhakaran 001; Amit Sahai (IACR Cryptol. ePrint Arch., 2013)

Explicit Non-Malleable Codes Resistant to Permutations. - Shashank Agrawal; Divya Gupta 001; Hemanta K. Maji; Omkant Pandey; Manoj Prabhakaran 001 (Electron. Colloquium Comput. Complex., 2014)

Explicit Non-malleable Codes Resistant to Permutations and Perturbations. - Shashank Agrawal; Divya Gupta 001; Hemanta K. Maji; Omkant Pandey; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2014)

Explicit Optimal-Rate Non-malleable Codes Against Bit-wise Tampering and Permutations. - Shashank Agrawal; Divya Gupta 001; Hemanta K. Maji; Omkant Pandey; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2014)

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

Public-Coin Differing-Inputs Obfuscation and Its Applications. - Yuval Ishai; Omkant Pandey; Amit Sahai (IACR Cryptol. ePrint Arch., 2014)

Deterministic Public-Key Encryption under Continual Leakage. - Venkata Koppula; Omkant Pandey; Yannis Rouselakis; Brent Waters (IACR Cryptol. ePrint Arch., 2014)

Relaxed Two-to-one Recoding Schemes. - Omkant Pandey; Kim Ramchen; Brent Waters (IACR Cryptol. ePrint Arch., 2014)

Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations. - Shashank Agrawal; Divya Gupta 001; Hemanta K. Maji; Omkant Pandey; Manoj Prabhakaran 001 (CRYPTO (1), 2015)

A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations. - Shashank Agrawal; Divya Gupta 001; Hemanta K. Maji; Omkant Pandey; Manoj Prabhakaran 001 (TCC (1), 2015)

Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma. - Vipul Goyal; Huijia Lin; Omkant Pandey; Rafael Pass; Amit Sahai (TCC (1), 2015)

Optimal Computational Split-state Non-malleable Codes. - Divesh Aggarwal; Shashank Agrawal; Divya Gupta 001; Hemanta K. Maji; Omkant Pandey; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2015)

Block-wise Non-Malleable Codes. - Nishanth Chandran; Vipul Goyal; Pratyay Mukherjee; Omkant Pandey; Jalaj Upadhyay (IACR Cryptol. ePrint Arch., 2015)

Incremental Program Obfuscation. - Sanjam Garg; Omkant Pandey (IACR Cryptol. ePrint Arch., 2015)

On the Exact Cryptographic Hardness of Finding a Nash Equilibrium. - Sanjam Garg; Omkant Pandey; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2015)

Do Distributed Differentially-Private Protocols Require Oblivious Transfer? - Vipul Goyal; Dakshita Khurana; Ilya Mironov; Omkant Pandey; Amit Sahai (IACR Cryptol. ePrint Arch., 2015)

Textbook Non-Malleable Commitments. - Vipul Goyal; Omkant Pandey; Silas Richelson (IACR Cryptol. ePrint Arch., 2015)

Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium. - Sanjam Garg; Omkant Pandey; Akshayaram Srinivasan (CRYPTO (2), 2016)

Secure Multiparty RAM Computation in Constant Rounds. - Sanjam Garg; Divya Gupta 001; Peihan Miao 001; Omkant Pandey (IACR Cryptol. ePrint Arch., 2016)

The Exact Round Complexity of Secure Computation. - Sanjam Garg; Pratyay Mukherjee; Omkant Pandey; Antigoni Polychroniadou (IACR Cryptol. ePrint Arch., 2016)

Breaking the Sub-Exponential Barrier in Obfustopia. - Sanjam Garg; Omkant Pandey; Akshayaram Srinivasan; Mark Zhandry (IACR Cryptol. ePrint Arch., 2016)

On the Exact Round Complexity of Self-Composable Two-Party Computation. - Sanjam Garg; Susumu Kiyoshima; Omkant Pandey (IACR Cryptol. ePrint Arch., 2017)

A New Approach to Black-Box Concurrent Secure Computation. - Sanjam Garg; Susumu Kiyoshima; Omkant Pandey (IACR Cryptol. ePrint Arch., 2018)

Incremental Deterministic Public-Key Encryption. - Ilya Mironov; Omkant Pandey; Omer Reingold; Gil Segev 001 (J. Cryptol., 2018)

ProCSA: Protecting Privacy in Crowdsourced Spectrum Allocation. - Max Curran; Xiao Liang 014; Himanshu Gupta 001; Omkant Pandey; Samir R. Das (ESORICS (1), 2019)

Argus: Multi-Level Service Visibility Scoping for Internet-of-Things in Enterprise Environments. - Qian Zhou; Omkant Pandey; Fan Ye 003 (IPDPS, 2020)

Random Walks and Concurrent Zero-Knowledge. - Anand Aiyer; Xiao Liang 014; Nilu Nalini; Omkant Pandey (IACR Cryptol. ePrint Arch., 2020)

Improved Black-Box Constructions of Composable Secure Computation. - Rohit Chatterjee; Xiao Liang 014; Omkant Pandey (IACR Cryptol. ePrint Arch., 2020)

Black-Box Constructions of Bounded-Concurrent Secure Computation. - Sanjam Garg; Xiao Liang 014; Omkant Pandey; Ivan Visconti (IACR Cryptol. ePrint Arch., 2020)

Compact Ring Signatures from Learning With Errors. - Rohit Chatterjee; Sanjam Garg; Mohammad Hajiabadi; Dakshita Khurana; Xiao Liang 014; Giulio Malavolta; Omkant Pandey; Sina Shiehian (IACR Cryptol. ePrint Arch., 2021)

Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs. - Xiao Liang 014; Omkant Pandey (IACR Cryptol. ePrint Arch., 2021)

A New Approach to Efficient Non-Malleable Zero-Knowledge. - Allen Kim; Xiao Liang 014; Omkant Pandey (IACR Cryptol. ePrint Arch., 2022)

A New Approach to Post-Quantum Non-Malleability. - Xiao Liang 014; Omkant Pandey; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2022)

An Approach for Multi-Level Visibility Scoping of IoT Services in Enterprise Environments. - Qian Zhou; Omkant Pandey; Fan Ye 003 (IEEE Trans. Mob. Comput., 2022)

Credibility in Private Set Membership. - Sanjam Garg; Mohammad Hajiabadi; Abhishek Jain 002; Zhengzhong Jin; Omkant Pandey; Sina Shiehian (Public Key Cryptography (2), 2023)

The Round Complexity of Black-Box Post-Quantum Secure Computation. - Rohit Chatterjee; Xiao Liang 014; Omkant Pandey; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2025)

Almost-Total Puzzles and Their Applications. - Xiao Liang 014; Omkant Pandey; Yuhao Tang; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2025)