On Randomized Broadcasting and Gossiping in Radio Networks. - Ding Liu; Manoj Prabhakaran 001 (COCOON, 2002)

Concurrent Zero Knowledge with Logarithmic Round-Complexity. - Manoj Prabhakaran 001; Alon Rosen; Amit Sahai (FOCS, 2002)

Approximating the smallest grammar: Kolmogorov complexity in natural models. - Moses Charikar; Eric Lehman; Ding Liu; Rina Panigrahy; Manoj Prabhakaran 001; April Rasala; Amit Sahai; Abhi Shelat (STOC, 2002)

Concurrent Zero Knowledge Proofs with Logarithmic Round-Complexity. - Manoj Prabhakaran 001; Amit Sahai (IACR Cryptol. ePrint Arch., 2002)

On the (Im)possibility of Cryptography with Imperfect Randomness. - Yevgeniy Dodis; Shien Jin Ong; Manoj Prabhakaran 001; Amit Sahai (FOCS, 2004)

Positive Results and Techniques for Obfuscation. - Ben Lynn; Manoj Prabhakaran 001; Amit Sahai (IACR Cryptol. ePrint Arch., 2004)

New Notions of Security: Achieving Universal Composability without Trusted Setup. - Manoj Prabhakaran 001; Amit Sahai (IACR Cryptol. ePrint Arch., 2004)

Concurrent general composition of secure protocols in the timing model. - Yael Tauman Kalai; Yehuda Lindell; Manoj Prabhakaran 001 (STOC, 2005)

Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation. - Manoj Prabhakaran 001; Amit Sahai (TCC, 2005)

The smallest grammar problem. - Moses Charikar; Eric Lehman; Ding Liu; Rina Panigrahy; Manoj Prabhakaran 001; Amit Sahai; Abhi Shelat (IEEE Trans. Inf. Theory, 2005)

Private Circuits II: Keeping Secrets in Tamperable Circuits. - Yuval Ishai; Manoj Prabhakaran 001; Amit Sahai; David A. Wagner 001 (EUROCRYPT, 2006)

Concurrent Non-Malleable Zero Knowledge. - Boaz Barak; Manoj Prabhakaran 001; Amit Sahai (IACR Cryptol. ePrint Arch., 2006)

Rerandomizable RCCA Encryption. - Manoj Prabhakaran 001; Mike Rosulek (IACR Cryptol. ePrint Arch., 2007)

Statistically Hiding Sets. - Manoj Prabhakaran 001; Rui Xue 001 (IACR Cryptol. ePrint Arch., 2007)

Concurrent Composition of Secure Protocols in the Timing Model. - Yael Tauman Kalai; Yehuda Lindell; Manoj Prabhakaran 001 (J. Cryptol., 2007)

Towards Robust Computation on Encrypted Data. - Manoj Prabhakaran 001; Mike Rosulek (ASIACRYPT, 2008)

Founding Cryptography on Oblivious Transfer - Efficiently. - Yuval Ishai; Manoj Prabhakaran 001; Amit Sahai (CRYPTO, 2008)

Cryptographic Complexity of Multi-party Computation Problems: Classifications and Separations. - Manoj Prabhakaran 001; Mike Rosulek (Electron. Colloquium Comput. Complex., 2008)

Secure Arithmetic Computation with No Honest Majority. - Yuval Ishai; Manoj Prabhakaran 001; Amit Sahai (IACR Cryptol. ePrint Arch., 2008)

Attribute-Based Signatures: Achieving Attribute-Privacy and Collusion-Resistance. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (IACR Cryptol. ePrint Arch., 2008)

Complexity of Multiparty Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (IACR Cryptol. ePrint Arch., 2008)

Homomorphic Encryption with CCA Security. - Manoj Prabhakaran 001; Mike Rosulek (IACR Cryptol. ePrint Arch., 2008)

Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (TCC, 2009)

Cryptographic Complexity Classes and Computational Intractability Assumptions. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (Electron. Colloquium Comput. Complex., 2009)

Attribute-Sets: A Practically Motivated Enhancement to Attribute-Based Encryption. - Rakeshbabu Bobba; Himanshu Khurana; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2009)

A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (CRYPTO, 2010)

On the Computational Complexity of Coin Flipping. - Hemanta K. Maji; Manoj Prabhakaran 001; Amit Sahai (FOCS, 2010)

Assisted common information. - Vinod M. Prabhakaran; Manoj Prabhakaran 001 (ISIT, 2010)

Assisted Common Information with Applications to Secure Two-Party Computation - Vinod M. Prabhakaran; Manoj Prabhakaran 001 (CoRR, 2010)

A Zero-One Law for Deterministic 2-Party Secure Computation. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (IACR Cryptol. ePrint Arch., 2010)

Attribute-Based Signatures. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (IACR Cryptol. ePrint Arch., 2010)

Attribute-Based Messaging: Access Control and Confidentiality. - Rakeshbabu Bobba; Omid Fatemieh; Fariba Khan; Arindam Khan 001; Carl A. Gunter; Himanshu Khurana; Manoj Prabhakaran 001 (ACM Trans. Inf. Syst. Secur., 2010)

Constant-Rate Oblivious Transfer from Noisy Channels. - Yuval Ishai; Eyal Kushilevitz; Rafail Ostrovsky; Manoj Prabhakaran 001; Amit Sahai; Jürg Wullschleger (CRYPTO, 2011)

Efficient Non-interactive Secure Computation. - Yuval Ishai; Eyal Kushilevitz; Rafail Ostrovsky; Manoj Prabhakaran 001; Amit Sahai (EUROCRYPT, 2011)

The Limits of Common Coins: Further Results. - Hemanta K. Maji; Manoj Prabhakaran 001 (INDOCRYPT, 2011)

Assisted common information: Further results. - Vinod M. Prabhakaran; Manoj Prabhakaran 001 (ISIT, 2011)

Exploring the Limits of Common Coins Using Frontier Analysis of Protocols. - Hemanta K. Maji; Pichayoot Ouppaphan; Manoj Prabhakaran 001; Mike Rosulek (IACR Cryptol. ePrint Arch., 2011)

Resource Fairness and Composability of Cryptographic Protocols. - Juan A. Garay; Philip D. MacKenzie; Manoj Prabhakaran 001; Ke Yang 005 (J. Cryptol., 2011)

A Unified Characterization of Completeness and Triviality for Secure Function Evaluation. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (INDOCRYPT, 2012)

On secure multiparty sampling for more than two parties. - Manoj Prabhakaran 001; Vinod M. Prabhakaran (ITW, 2012)

Limits of Random Oracles in Secure Computation. - Mohammad Mahmoody; Hemanta K. Maji; Manoj Prabhakaran 001 (Electron. Colloquium Comput. Complex., 2012)

New Impossibility Results for Concurrent Composition and a Non-Interactive Completeness Theorem for Secure Computation. - Shweta Agrawal 001; Vipul Goyal; Abhishek Jain 002; Manoj Prabhakaran 001; Amit Sahai (IACR Cryptol. ePrint Arch., 2012)

Robust Pseudorandom Generators. - Yuval Ishai; Eyal Kushilevitz; Xin Li 006; Rafail Ostrovsky; Manoj Prabhakaran 001; Amit Sahai; David Zuckerman (Electron. Colloquium Comput. Complex., 2013)

On the Power of Public-key Encryption in Secure Computation. - Mohammad Mahmoody; Hemanta K. Maji; Manoj Prabhakaran 001 (Electron. Colloquium Comput. Complex., 2013)

Function Private Functional Encryption and Property Preserving Encryption : New Definitions and Positive Results. - Shashank Agrawal; Shweta Agrawal 001; Saikrishna Badrinarayanan; Abishek Kumarasubramanian; Manoj Prabhakaran 001; Amit Sahai (IACR Cryptol. ePrint Arch., 2013)

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

On Fair Exchange, Fair Coins and Fair Sampling. - Shashank Agrawal; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2013)

Complexity of Multi-Party Computation Functionalities. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (IACR Cryptol. ePrint Arch., 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)

Complexity of Multi-Party Computation Functionalities. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (Secure Multi-Party Computation, 2013)

Controlled Functional Encryption. - Muhammad Naveed 001; Shashank Agrawal; Manoj Prabhakaran 001; XiaoFeng Wang 001; Erman Ayday; Jean-Pierre Hubaux; Carl A. Gunter (CCS, 2014)

Secure Computation Using Leaky Tokens. - Manoj Prabhakaran 001; Amit Sahai; Akshay Wadia (ICALP (1), 2014)

Tension Bounds for Information Complexity. - Manoj Prabhakaran 001; Vinod M. Prabhakaran (CoRR, 2014)

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)

Towards a Unified Theory of Cryptographic Agents. - Shashank Agrawal; Shweta Agrawal 001; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 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)

A Full Characterization of Completeness for Two-party Randomized Function Evaluation. - Daniel Kraschewski; Hemanta K. Maji; Manoj Prabhakaran 001; Amit Sahai (IACR Cryptol. ePrint Arch., 2014)

Dynamic Searchable Encryption via Blind Storage. - Muhammad Naveed 001; Manoj Prabhakaran 001; Carl A. Gunter (IACR Cryptol. ePrint Arch., 2014)

Assisted Common Information With an Application to Secure Two-Party Sampling. - Vinod M. Prabhakaran; Manoj Prabhakaran 001 (IEEE Trans. Inf. Theory, 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)

Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted Data. - Shashank Agrawal; Shweta Agrawal 001; Manoj Prabhakaran 001 (EUROCRYPT (2), 2015)

On the Practical Security of Inner Product Functional Encryption. - Shashank Agrawal; Shweta Agrawal 001; Saikrishna Badrinarayanan; Abishek Kumarasubramanian; Manoj Prabhakaran 001; Amit Sahai (Public Key Cryptography, 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)

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)

On the Communication Complexity of Secure Computation. - Deepesh Data; Manoj Prabhakaran 001; Vinod M. Prabhakaran (IACR Cryptol. ePrint Arch., 2015)

Circuits Resilient to Additive Attacks with Applications to Secure Computation. - Daniel Genkin; Yuval Ishai; Manoj Prabhakaran 001; Amit Sahai; Eran Tromer (IACR Cryptol. ePrint Arch., 2015)

Rényi Information Complexity and an Information Theoretic Characterization of the Partition Bound. - Manoj M. Prabhakaran 001; Vinod M. Prabhakaran (ICALP, 2016)

Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents. - Shashank Agrawal; Manoj Prabhakaran 001; Ching-Hua Yu (IACR Cryptol. ePrint Arch., 2016)

Secure Protocol Transformations. - Yuval Ishai; Eyal Kushilevitz; Manoj Prabhakaran 001; Amit Sahai; Ching-Hua Yu (IACR Cryptol. ePrint Arch., 2016)

All Complete Functionalities are Reversible. - Daniel Kraschewski; Dakshita Khurana; Hemanta K. Maji; Manoj Prabhakaran 001; Amit Sahai (IACR Cryptol. ePrint Arch., 2016)

Communication and Randomness Lower Bounds for Secure Computation. - Deepesh Data; Vinod M. Prabhakaran; Manoj M. Prabhakaran 001 (IEEE Trans. Inf. Theory, 2016)

Towards Characterizing Securely Computable Two-Party Randomized Functions. - Deepesh Data; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2017)

Reconciling Non-malleability with Homomorphic Encryption. - Manoj Prabhakaran 001; Mike Rosulek (J. Cryptol., 2017)

Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC. - Navneet Agarwal; Sanat Anand; Manoj Prabhakaran 001 (ICALP, 2018)

The Bottleneck Complexity of Secure Multiparty Computation. - Elette Boyle; Abhishek Jain 002; Manoj Prabhakaran 001; Ching-Hua Yu (ICALP, 2018)

An Introduction to the CellTree Paradigm (Invited Paper). - Anasuya Acharya; Manoj Prabhakaran 001; Akash Trehan (ICISS, 2019)

Optimality of a Protocol by Feige-Kilian-Naor for Three-Party Secure Computation. - Sibi Raj B. Pillai; Manoj Prabhakaran 001; Vinod M. Prabhakaran; Srivatsan Sridhar (INDOCRYPT, 2019)

CellTree: A New Paradigm for Distributed Data Repositories. - Anasuya Acharya; Manoj Prabhakaran 001; Akash Trehan (IACR Cryptol. ePrint Arch., 2019)

Uncovering Algebraic Structures in the MPC Landscape. - Navneet Agarwal; Sanat Anand; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2019)

A Practical Model for Collaborative Databases: Securely Mixing, Searching and Computing. - Shweta Agrawal 001; Rachit Garg 001; Nishant Kumar 001; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2019)

Cryptography from One-Way Communication: On Completeness of Finite Channels. - Shweta Agrawal 001; Yuval Ishai; Eyal Kushilevitz; Varun Narayanan; Manoj Prabhakaran 001; Vinod M. Prabhakaran; Alon Rosen (ASIACRYPT (3), 2020)

Witness Maps and Applications. - Suvradip Chakraborty; Manoj Prabhakaran 001; Daniel Wichs (IACR Cryptol. ePrint Arch., 2020)

Zero-Communication Reductions. - Varun Narayanan; Manoj Prabhakaran 001; Vinod M. Prabhakaran (IACR Cryptol. ePrint Arch., 2020)

Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration. - Shweta Agrawal 001; Yuval Ishai; Eyal Kushilevitz; Varun Narayanan; Manoj Prabhakaran 001; Vinod M. Prabhakaran; Alon Rosen (CRYPTO (2), 2021)

On Communication Models and Best-Achievable Security in Two-Round MPC. - Aarushi Goel; Abhishek Jain 002; Manoj Prabhakaran 001; Rajeev Raghunath (IACR Cryptol. ePrint Arch., 2021)

Group Structure in Correlations and its Applications in Cryptography. - Guru-Vamsi Policharla; Manoj Prabhakaran 001; Rajeev Raghunath; Parjanya Vyas (IACR Cryptol. ePrint Arch., 2021)

Flexible Accuracy for Differential Privacy. - Aman Bansal; Rahul Chunduru; Deepesh Data; Manoj Prabhakaran 001 (AISTATS, 2022)

SCALES: MPC with Small Clients and Larger Ephemeral Servers. - Anasuya Acharya; Carmit Hazay; Vladimir Kolesnikov; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2022)

Secure Non-Interactive Reduction and Spectral Analysis of Correlations. - Pratyush Agarwal; Varun Narayanan; Shreya Pathak; Manoj Prabhakaran 001; Vinod M. Prabhakaran; Mohammad Ali Rehan (IACR Cryptol. ePrint Arch., 2022)

Secure Non-Interactive Reducibility is Decidable. - Kaartik Bhushan; Ankit Kumar Misra; Varun Narayanan; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2022)

COA-Secure Obfuscation and Applications. - Ran Canetti; Suvradip Chakraborty; Dakshita Khurana; Nishant Kumar 001; Oxana Poburinnaya; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2022)

Oblivious-Transfer Complexity of Noisy Coin-Toss via Secure Zero Communication Reductions. - Saumya Goyal; Varun Narayanan; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2022)

Randomness Requirements for Three-Secret Sharing. - Hari Krishnan P. Anilkumar; Aayush Rajesh; Varun Narayanan; Manoj M. Prabhakaran 001; Vinod M. Prabhakaran (ISIT, 2023)

CASE: A New Frontier in Public-Key Authenticated Encryption. - Shashank Agrawal; Shweta Agrawal 001; Manoj Prabhakaran 001; Rajeev Raghunath; Jayesh Singla (IACR Cryptol. ePrint Arch., 2023)

Homomorphic Indistinguishability Obfuscation and its Applications. - Kaartik Bhushan; Venkata Koppula; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2023)

A Map of Witness Maps: New Definitions and Connections. - Suvradip Chakraborty; Manoj Prabhakaran 001; Daniel Wichs (IACR Cryptol. ePrint Arch., 2023)

Leakage-Resilient Incompressible Cryptography: Constructions and Barriers. - Kaartik Bhushan; Rishab Goyal; Venkata Koppula; Varun Narayanan; Manoj Prabhakaran 001; Mahesh Sreekumar Rajasree (ASIACRYPT (7), 2024)

Utilitarian Privacy and Private Sampling. - Aman Bansal; Rahul Chunduru; Deepesh Data; Manoj Prabhakaran 001 (ISIT, 2024)

R3PO: Reach-Restricted Reactive Program Obfuscation and Its Applications. - Kaartik Bhushan; Sai Lakshmi Bhavana Obbattu; Manoj Prabhakaran 001; Rajeev Raghunath (Public Key Cryptography (3), 2024)

Communication Complexity vs Randomness Complexity in Interactive Proofs. - Benny Applebaum; Kaartik Bhushan; Manoj Prabhakaran 001 (Electron. Colloquium Comput. Complex., 2024)

Malicious Security for SCALES: Outsourced Computation with Ephemeral Servers. - Anasuya Acharya; Carmit Hazay; Vladimir Kolesnikov; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2024)

Randomness in Private Sequential Stateless Protocols. - Hari Krishnan P. Anilkumar; Varun Narayanan; Manoj Prabhakaran 001; Vinod M. Prabhakaran (IACR Cryptol. ePrint Arch., 2024)

R3PO: Reach-Restricted Reactive Program Obfuscation and its Application to MA-ABE. - Kaartik Bhushan; Sai Lakshmi Bhavana Obbattu; Manoj Prabhakaran 001; Rajeev Raghunath (IACR Cryptol. ePrint Arch., 2024)