


Остановите войну!
for scientists:


default search action
Manoj Prabhakaran
Manoj M. Prabhakaran
Person information

- affiliation: University of Illinois, Urbana-Champaign
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [c74]Suvradip Chakraborty, Manoj Prabhakaran, Daniel Wichs:
A Map of Witness Maps: New Definitions and Connections. Public Key Cryptography (2) 2023: 635-662 - [i66]Hari Krishnan P. Anilkumar, Aayush Rajesh, Varun Narayanan, Manoj M. Prabhakaran, Vinod M. Prabhakaran:
Randomness Requirements for Three-Secret Sharing. CoRR abs/2304.14934 (2023) - [i65]Suvradip Chakraborty, Manoj Prabhakaran, Daniel Wichs:
A Map of Witness Maps: New Definitions and Connections. IACR Cryptol. ePrint Arch. 2023: 343 (2023) - 2022
- [c73]Aman Bansal, Rahul Chunduru, Deepesh Data, Manoj Prabhakaran:
Flexible Accuracy for Differential Privacy. AISTATS 2022: 3847-3882 - [c72]Ran Canetti, Suvradip Chakraborty, Dakshita Khurana, Nishant Kumar, Oxana Poburinnaya, Manoj Prabhakaran:
COA-Secure Obfuscation and Applications. EUROCRYPT (1) 2022: 731-758 - [c71]Pratyush Agarwal, Varun Narayanan, Shreya Pathak, Manoj Prabhakaran, Vinod M. Prabhakaran
, Mohammad Ali Rehan
:
Secure Non-interactive Reduction and Spectral Analysis of Correlations. EUROCRYPT (3) 2022: 797-827 - [c70]Saumya Goyal, Varun Narayanan, Manoj Prabhakaran:
Oblivious-Transfer Complexity of Noisy Coin-Toss via Secure Zero Communication Reductions. TCC (3) 2022: 89-118 - [c69]Kaartik Bhushan, Ankit Kumar Misra, Varun Narayanan, Manoj Prabhakaran:
Secure Non-interactive Reducibility is Decidable. TCC (2) 2022: 408-437 - [c68]Anasuya Acharya
, Carmit Hazay
, Vladimir Kolesnikov
, Manoj Prabhakaran:
SCALES - MPC with Small Clients and Larger Ephemeral Servers. TCC (2) 2022: 502-531 - [i64]Pratyush Agarwal, Varun Narayanan, Shreya Pathak, Manoj Prabhakaran, Vinod M. Prabhakaran, Mohammad Ali Rehan:
Secure Non-Interactive Reduction and Spectral Analysis of Correlations. IACR Cryptol. ePrint Arch. 2022: 262 (2022) - [i63]Anasuya Acharya, Carmit Hazay, Vladimir Kolesnikov, Manoj Prabhakaran:
SCALES: MPC with Small Clients and Larger Ephemeral Servers. IACR Cryptol. ePrint Arch. 2022: 751 (2022) - [i62]Kaartik Bhushan, Ankit Kumar Misra, Varun Narayanan, Manoj Prabhakaran:
Secure Non-Interactive Reducibility is Decidable. IACR Cryptol. ePrint Arch. 2022: 1457 (2022) - [i61]Saumya Goyal, Varun Narayanan, Manoj Prabhakaran:
Oblivious-Transfer Complexity of Noisy Coin-Toss via Secure Zero Communication Reductions. IACR Cryptol. ePrint Arch. 2022: 1539 (2022) - [i60]Ran Canetti, Suvradip Chakraborty, Dakshita Khurana, Nishant Kumar, Oxana Poburinnaya, Manoj Prabhakaran:
COA-Secure Obfuscation and Applications. IACR Cryptol. ePrint Arch. 2022: 1781 (2022) - 2021
- [c67]Guru-Vamsi Policharla, Manoj Prabhakaran, Rajeev Raghunath, Parjanya Vyas:
Group Structure in Correlations and Its Applications in Cryptography. ITC 2021: 1:1-1:23 - [c66]Shweta Agrawal, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran, Alon Rosen:
Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration. CRYPTO (2) 2021: 124-154 - [c65]Aarushi Goel, Abhishek Jain, Manoj Prabhakaran, Rajeev Raghunath:
On Communication Models and Best-Achievable Security in Two-Round MPC. TCC (2) 2021: 97-128 - [i59]Aman Bansal, Rahul Chunduru, Deepesh Data, Manoj Prabhakaran:
Flexible Accuracy for Differential Privacy. CoRR abs/2110.09580 (2021) - [i58]Guru-Vamsi Policharla, Manoj Prabhakaran, Rajeev Raghunath, Parjanya Vyas:
Group Structure in Correlations and its Applications in Cryptography. IACR Cryptol. ePrint Arch. 2021: 624 (2021) - [i57]Aarushi Goel, Abhishek Jain, Manoj Prabhakaran, Rajeev Raghunath:
On Communication Models and Best-Achievable Security in Two-Round MPC. IACR Cryptol. ePrint Arch. 2021: 690 (2021) - 2020
- [c64]Shweta Agrawal, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran, Alon Rosen:
Cryptography from One-Way Communication: On Completeness of Finite Channels. ASIACRYPT (3) 2020: 653-685 - [c63]Shweta Agrawal, Rachit Garg, Nishant Kumar, Manoj Prabhakaran:
A Practical Model for Collaborative Databases: Securely Mixing, Searching and Computing. ESORICS (1) 2020: 42-63 - [c62]Suvradip Chakraborty, Manoj Prabhakaran, Daniel Wichs:
Witness Maps and Applications. Public Key Cryptography (1) 2020: 220-246 - [c61]Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran:
Zero-Communication Reductions. TCC (3) 2020: 274-304 - [e2]Karthikeyan Bhargavan
, Elisabeth Oswald
, Manoj Prabhakaran:
Progress in Cryptology - INDOCRYPT 2020 - 21st International Conference on Cryptology in India, Bangalore, India, December 13-16, 2020, Proceedings. Lecture Notes in Computer Science 12578, Springer 2020, ISBN 978-3-030-65276-0 [contents] - [i56]Suvradip Chakraborty, Manoj Prabhakaran, Daniel Wichs:
Witness Maps and Applications. IACR Cryptol. ePrint Arch. 2020: 90 (2020) - [i55]Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran:
Zero-Communication Reductions. IACR Cryptol. ePrint Arch. 2020: 1341 (2020)
2010 – 2019
- 2019
- [c60]Navneet Agarwal, Sanat Anand, Manoj Prabhakaran:
Uncovering Algebraic Structures in the MPC Landscape. EUROCRYPT (2) 2019: 381-406 - [c59]Anasuya Acharya, Manoj Prabhakaran, Akash Trehan:
An Introduction to the CellTree Paradigm (Invited Paper). ICISS 2019: 137-153 - [c58]Sibi Raj B. Pillai, Manoj Prabhakaran, Vinod M. Prabhakaran
, Srivatsan Sridhar
:
Optimality of a Protocol by Feige-Kilian-Naor for Three-Party Secure Computation. INDOCRYPT 2019: 216-226 - [i54]Navneet Agarwal, Sanat Anand, Manoj Prabhakaran:
Uncovering Algebraic Structures in the MPC Landscape. IACR Cryptol. ePrint Arch. 2019: 278 (2019) - [i53]Anasuya Acharya, Manoj Prabhakaran, Akash Trehan:
CellTree: A New Paradigm for Distributed Data Repositories. IACR Cryptol. ePrint Arch. 2019: 516 (2019) - [i52]Shweta Agrawal, Rachit Garg, Nishant Kumar, Manoj Prabhakaran:
A Practical Model for Collaborative Databases: Securely Mixing, Searching and Computing. IACR Cryptol. ePrint Arch. 2019: 1262 (2019) - 2018
- [c57]Elette Boyle, Abhishek Jain, Manoj Prabhakaran, Ching-Hua Yu:
The Bottleneck Complexity of Secure Multiparty Computation. ICALP 2018: 24:1-24:16 - [c56]Navneet Agarwal, Sanat Anand, Manoj Prabhakaran:
Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC. ICALP 2018: 103:1-103:4 - [c55]Deepesh Data, Manoj Prabhakaran:
Towards Characterizing Securely Computable Two-Party Randomized Functions. Public Key Cryptography (1) 2018: 675-697 - 2017
- [j7]Manoj Prabhakaran, Mike Rosulek:
Reconciling Non-malleability with Homomorphic Encryption. J. Cryptol. 30(3): 601-671 (2017) - [i51]Deepesh Data, Manoj Prabhakaran:
Towards Characterizing Securely Computable Two-Party Randomized Functions. IACR Cryptol. ePrint Arch. 2017: 692 (2017) - 2016
- [j6]Deepesh Data, Vinod M. Prabhakaran
, Manoj M. Prabhakaran:
Communication and Randomness Lower Bounds for Secure Computation. IEEE Trans. Inf. Theory 62(7): 3901-3929 (2016) - [c54]Yuval Ishai, Eyal Kushilevitz, Manoj Prabhakaran, Amit Sahai, Ching-Hua Yu:
Secure Protocol Transformations. CRYPTO (2) 2016: 430-458 - [c53]Dakshita Khurana, Daniel Kraschewski, Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai:
All Complete Functionalities are Reversible. EUROCRYPT (2) 2016: 213-242 - [c52]Manoj M. Prabhakaran, Vinod M. Prabhakaran:
Rényi Information Complexity and an Information Theoretic Characterization of the Partition Bound. ICALP 2016: 88:1-88:14 - [c51]Shashank Agrawal, Manoj Prabhakaran, Ching-Hua Yu:
Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents. TCC (B2) 2016: 269-296 - [c50]Divesh Aggarwal, Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran:
Optimal Computational Split-state Non-malleable Codes. TCC (A2) 2016: 393-417 - [i50]Yuval Ishai, Eyal Kushilevitz, Manoj Prabhakaran, Amit Sahai, Ching-Hua Yu:
Secure Protocol Transformations. IACR Cryptol. ePrint Arch. 2016: 456 (2016) - [i49]Daniel Kraschewski, Dakshita Khurana, Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai:
All Complete Functionalities are Reversible. IACR Cryptol. ePrint Arch. 2016: 496 (2016) - [i48]Shashank Agrawal, Manoj Prabhakaran, Ching-Hua Yu:
Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents. IACR Cryptol. ePrint Arch. 2016: 819 (2016) - 2015
- [c49]Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran:
Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations. CRYPTO (1) 2015: 538-557 - [c48]Shashank Agrawal, Shweta Agrawal, Manoj Prabhakaran:
Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted Data. EUROCRYPT (2) 2015: 501-531 - [c47]Shashank Agrawal, Shweta Agrawal, Saikrishna Badrinarayanan, Abishek Kumarasubramanian, Manoj Prabhakaran, Amit Sahai:
On the Practical Security of Inner Product Functional Encryption. Public Key Cryptography 2015: 777-798 - [c46]Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran:
A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations. TCC (1) 2015: 375-397 - [c45]Omkant Pandey, Manoj Prabhakaran, Amit Sahai:
Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP. TCC (2) 2015: 638-667 - [i47]Manoj M. Prabhakaran, Vinod M. Prabhakaran:
Rényi Information Complexity and an Information Theoretic Characterization of the Partition Bound. CoRR abs/1511.07949 (2015) - [i46]Deepesh Data, Vinod M. Prabhakaran, Manoj M. Prabhakaran:
Communication and Randomness Lower Bounds for Secure Computation. CoRR abs/1512.07735 (2015) - [i45]Daniel Genkin, Yuval Ishai, Manoj Prabhakaran, Amit Sahai, Eran Tromer:
Circuits Resilient to Additive Attacks with Applications to Secure Computation. IACR Cryptol. ePrint Arch. 2015: 154 (2015) - [i44]Deepesh Data, Manoj Prabhakaran, Vinod M. Prabhakaran:
On the Communication Complexity of Secure Computation. IACR Cryptol. ePrint Arch. 2015: 391 (2015) - [i43]Divesh Aggarwal, Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran:
Optimal Computational Split-state Non-malleable Codes. IACR Cryptol. ePrint Arch. 2015: 1063 (2015) - 2014
- [j5]Vinod M. Prabhakaran, Manoj Prabhakaran:
Assisted Common Information With an Application to Secure Two-Party Sampling. IEEE Trans. Inf. Theory 60(6): 3413-3434 (2014) - [c44]Muhammad Naveed, Shashank Agrawal, Manoj Prabhakaran, XiaoFeng Wang, Erman Ayday, Jean-Pierre Hubaux, Carl A. Gunter:
Controlled Functional Encryption. CCS 2014: 1280-1291 - [c43]Deepesh Data, Manoj Prabhakaran, Vinod M. Prabhakaran:
On the Communication Complexity of Secure Computation. CRYPTO (2) 2014: 199-216 - [c42]Daniel Kraschewski, Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai:
A Full Characterization of Completeness for Two-Party Randomized Function Evaluation. EUROCRYPT 2014: 659-676 - [c41]Manoj Prabhakaran, Amit Sahai, Akshay Wadia:
Secure Computation Using Leaky Tokens. ICALP (1) 2014: 907-918 - [c40]Mohammad Mahmoody
, Hemanta K. Maji, Manoj Prabhakaran:
Limits of random oracles in secure computation. ITCS 2014: 23-34 - [c39]Muhammad Naveed, Manoj Prabhakaran, Carl A. Gunter:
Dynamic Searchable Encryption via Blind Storage. IEEE Symposium on Security and Privacy 2014: 639-654 - [c38]Daniel Genkin, Yuval Ishai, Manoj Prabhakaran, Amit Sahai, Eran Tromer:
Circuits resilient to additive attacks with applications to secure computation. STOC 2014: 495-504 - [c37]Mohammad Mahmoody
, Hemanta K. Maji, Manoj Prabhakaran:
On the Power of Public-Key Encryption in Secure Computation. TCC 2014: 240-264 - [c36]Shashank Agrawal, Prabhanjan Ananth, Vipul Goyal, Manoj Prabhakaran, Alon Rosen:
Lower Bounds in the Hardware Token Model. TCC 2014: 663-687 - [i42]Manoj Prabhakaran, Vinod M. Prabhakaran:
Tension Bounds for Information Complexity. CoRR abs/1408.6285 (2014) - [i41]Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran:
Explicit Non-Malleable Codes Resistant to Permutations. Electron. Colloquium Comput. Complex. TR14 (2014) - [i40]Daniel Kraschewski, Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai:
A Full Characterization of Completeness for Two-party Randomized Function Evaluation. IACR Cryptol. ePrint Arch. 2014: 80 (2014) - [i39]Muhammad Naveed, Manoj Prabhakaran, Carl A. Gunter:
Dynamic Searchable Encryption via Blind Storage. IACR Cryptol. ePrint Arch. 2014: 219 (2014) - [i38]Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran:
Explicit Non-Malleable Codes Resistant to Permutations. IACR Cryptol. ePrint Arch. 2014: 316 (2014) - [i37]Shashank Agrawal, Shweta Agrawal, Manoj Prabhakaran:
Towards a Unified Theory of Cryptographic Agents. IACR Cryptol. ePrint Arch. 2014: 480 (2014) - [i36]Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran:
Explicit Non-malleable Codes Resistant to Permutations and Perturbations. IACR Cryptol. ePrint Arch. 2014: 841 (2014) - [i35]Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran:
Explicit Optimal-Rate Non-malleable Codes Against Bit-wise Tampering and Permutations. IACR Cryptol. ePrint Arch. 2014: 842 (2014) - 2013
- [c35]Shashank Agrawal, Manoj Prabhakaran:
On Fair Exchange, Fair Coins and Fair Sampling. CRYPTO (1) 2013: 259-276 - [c34]Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman:
Robust Pseudorandom Generators. ICALP (1) 2013: 576-588 - [p1]Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
Complexity of Multi-Party Computation Functionalities. Secure Multi-Party Computation 2013: 249-283 - [e1]Manoj Prabhakaran, Amit Sahai:
Secure Multi-Party Computation. Cryptology and Information Security Series 10, IOS Press 2013, ISBN 978-1-61499-168-7 [contents] - [i34]Deepesh Data, Vinod M. Prabhakaran, Manoj Prabhakaran:
On the Communication Complexity of Secure Computation. CoRR abs/1311.7584 (2013) - [i33]Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman:
Robust Pseudorandom Generators. Electron. Colloquium Comput. Complex. TR13 (2013) - [i32]Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran:
On the Power of Public-key Encryption in Secure Computation. Electron. Colloquium Comput. Complex. TR13 (2013) - [i31]Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
Complexity of Multi-Party Computation Functionalities. IACR Cryptol. ePrint Arch. 2013: 42 (2013) - [i30]Shashank Agrawal, Manoj Prabhakaran:
On Fair Exchange, Fair Coins and Fair Sampling. IACR Cryptol. ePrint Arch. 2013: 442 (2013) - [i29]Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman:
Robust Pseudorandom Generators. IACR Cryptol. ePrint Arch. 2013: 671 (2013) - [i28]Shashank Agrawal, Shweta Agrawal, Saikrishna Badrinarayanan, Abishek Kumarasubramanian, Manoj Prabhakaran, Amit Sahai:
Function Private Functional Encryption and Property Preserving Encryption : New Definitions and Positive Results. IACR Cryptol. ePrint Arch. 2013: 744 (2013) - [i27]Omkant Pandey, Manoj Prabhakaran, Amit Sahai:
Obfuscation-based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP. IACR Cryptol. ePrint Arch. 2013: 754 (2013) - [i26]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
- [c33]Shweta Agrawal, Vipul Goyal, Abhishek Jain, Manoj Prabhakaran, Amit Sahai:
New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation. CRYPTO 2012: 443-460 - [c32]Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
A Unified Characterization of Completeness and Triviality for Secure Function Evaluation. INDOCRYPT 2012: 40-59 - [c31]Manoj Prabhakaran, Vinod M. Prabhakaran:
On secure multiparty sampling for more than two parties. ITW 2012: 99-103 - [i25]Mohammad Mahmoody
, Hemanta K. Maji, Manoj Prabhakaran:
Limits of Random Oracles in Secure Computation. CoRR abs/1205.3554 (2012) - [i24]Vinod M. Prabhakaran, Manoj Prabhakaran:
Assisted Common Information with an Application to Secure Two-Party Sampling. CoRR abs/1206.1282 (2012) - [i23]Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran:
Limits of Random Oracles in Secure Computation. Electron. Colloquium Comput. Complex. TR12 (2012) - [i22]Shweta Agrawal, Vipul Goyal, Abhishek Jain, Manoj Prabhakaran, Amit Sahai:
New Impossibility Results for Concurrent Composition and a Non-Interactive Completeness Theorem for Secure Computation. IACR Cryptol. ePrint Arch. 2012: 555 (2012) - 2011
- [j4]Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang:
Resource Fairness and Composability of Cryptographic Protocols. J. Cryptol. 24(4): 615-658 (2011) - [c30]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, Jürg Wullschleger:
Constant-Rate Oblivious Transfer from Noisy Channels. CRYPTO 2011: 667-684 - [c29]Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
Attribute-Based Signatures. CT-RSA 2011: 376-392 - [c28]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai:
Efficient Non-interactive Secure Computation. EUROCRYPT 2011: 406-425 - [c27]Hemanta K. Maji, Manoj Prabhakaran:
The Limits of Common Coins: Further Results. INDOCRYPT 2011: 344-358 - [c26]Vinod M. Prabhakaran, Manoj Prabhakaran:
Assisted common information: Further results. ISIT 2011: 2861-2865 - [c25]Hemanta K. Maji, Pichayoot Ouppaphan, Manoj Prabhakaran, Mike Rosulek:
Exploring the Limits of Common Coins Using Frontier Analysis of Protocols. TCC 2011: 486-503 - [i21]Vinod M. Prabhakaran, Manoj Prabhakaran:
Assisted Common Information: Further Results. CoRR abs/1105.6163 (2011) - [i20]Hemanta K. Maji, Pichayoot Ouppaphan, Manoj Prabhakaran, Mike Rosulek:
Exploring the Limits of Common Coins Using Frontier Analysis of Protocols. IACR Cryptol. ePrint Arch. 2011: 6 (2011) - 2010
- [j3]Rakeshbabu Bobba
, Omid Fatemieh, Fariba Khan, Arindam Khan, Carl A. Gunter, Himanshu Khurana, Manoj Prabhakaran:
Attribute-Based Messaging: Access Control and Confidentiality. ACM Trans. Inf. Syst. Secur. 13(4): 31:1-31:35 (2010) - [c24]Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security. CRYPTO 2010: 595-612 - [c23]Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai:
On the Computational Complexity of Coin Flipping. FOCS 2010: 613-622 - [c22]Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
Cryptographic Complexity Classes and Computational Intractability Assumptions. ICS 2010: 266-289 - [c21]Vinod M. Prabhakaran, Manoj Prabhakaran:
Assisted common information. ISIT 2010: 2602-2606 - [i19]Vinod M. Prabhakaran, Manoj Prabhakaran:
Assisted Common Information with Applications to Secure Two-Party Computation. CoRR abs/1002.1916 (2010) - [i18]Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
A Zero-One Law for Deterministic 2-Party Secure Computation. IACR Cryptol. ePrint Arch. 2010: 98 (2010) - [i17]Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
Attribute-Based Signatures. IACR Cryptol. ePrint Arch. 2010: 595 (2010)
2000 – 2009
- 2009
- [c20]Manoj Prabhakaran, Rui Xue:
Statistically Hiding Sets. CT-RSA 2009: 100-116 - [c19]Rakeshbabu Bobba, Himanshu Khurana, Manoj Prabhakaran:
Attribute-Sets: A Practically Motivated Enhancement to Attribute-Based Encryption. ESORICS 2009: 587-604 - [c18]Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation. TCC 2009: 256-273 - [c17]Yuval Ishai, Manoj Prabhakaran, Amit Sahai:
Secure Arithmetic Computation with No Honest Majority. TCC 2009: 294-314 - [i16]Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
Cryptographic Complexity Classes and Computational Intractability Assumptions. Electron. Colloquium Comput. Complex. TR09 (2009) - [i15]Rakeshbabu Bobba
, Himanshu Khurana, Manoj Prabhakaran:
Attribute-Sets: A Practically Motivated Enhancement to Attribute-Based Encryption. IACR Cryptol. ePrint Arch. 2009: 371 (2009) - 2008
- [c16]Manoj Prabhakaran, Mike Rosulek:
Towards Robust Computation on Encrypted Data. ASIACRYPT 2008: 216-233 - [c15]Manoj Prabhakaran, Mike Rosulek:
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations. CRYPTO 2008: 262-279 - [c14]Yuval Ishai, Manoj Prabhakaran, Amit Sahai:
Founding Cryptography on Oblivious Transfer - Efficiently. CRYPTO 2008: 572-591 - [c13]Manoj Prabhakaran, Mike Rosulek:
Homomorphic Encryption with CCA Security. ICALP (2) 2008: 667-678 - [i14]Yuval Ishai, Manoj Prabhakaran, Amit Sahai:
Secure Arithmetic Computation with No Honest Majority. CoRR abs/0811.0475 (2008) - [i13]Manoj Prabhakaran, Mike Rosulek:
Cryptographic Complexity of Multi-party Computation Problems: Classifications and Separations. Electron. Colloquium Comput. Complex. TR08 (2008) - [i12]Manoj Prabhakaran, Mike Rosulek:
Homomorphic Encryption with CCA Security. IACR Cryptol. ePrint Arch. 2008: 79 (2008) - [i11]Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
Attribute-Based Signatures: Achieving Attribute-Privacy and Collusion-Resistance. IACR Cryptol. ePrint Arch. 2008: 328 (2008) - [i10]Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
Complexity of Multiparty Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation. IACR Cryptol. ePrint Arch. 2008: 454 (2008) - [i9]Yuval Ishai, Manoj Prabhakaran, Amit Sahai:
Secure Arithmetic Computation with No Honest Majority. IACR Cryptol. ePrint Arch. 2008: 465 (2008) - 2007
- [j2]