Search the dblp DataBase

Publications of Author

1. Ding Liu, Manoj Prabhakaran
   On Randomized Broadcasting and Gossiping in Radio Networks. [Citation Graph (0, 0)][DBLP]
   COCOON, 2002, pp:340-349 [Conf]
   
2. Yuval Ishai, Manoj Prabhakaran, Amit Sahai, David Wagner
   Private Circuits II: Keeping Secrets in Tamperable Circuits. [Citation Graph (0, 0)][DBLP]
   EUROCRYPT, 2006, pp:308-327 [Conf]
   
3. Ben Lynn, Manoj Prabhakaran, Amit Sahai
   Positive Results and Techniques for Obfuscation. [Citation Graph (0, 0)][DBLP]
   EUROCRYPT, 2004, pp:20-39 [Conf]
   
4. Yevgeniy Dodis, Shien Jin Ong, Manoj Prabhakaran, Amit Sahai
   On the (Im)possibility of Cryptography with Imperfect Randomness. [Citation Graph (0, 0)][DBLP]
   FOCS, 2004, pp:196-205 [Conf]
   
5. Manoj Prabhakaran, Alon Rosen, Amit Sahai
   Concurrent Zero Knowledge with Logarithmic Round-Complexity. [Citation Graph (0, 0)][DBLP]
   FOCS, 2002, pp:366-375 [Conf]
   
6. Boaz Barak, Manoj Prabhakaran, Amit Sahai
   Concurrent Non-Malleable Zero Knowledge. [Citation Graph (0, 0)][DBLP]
   FOCS, 2006, pp:345-354 [Conf]
   
7. Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, Amit Sahai, Abhi Shelat
   Approximating the smallest grammar: Kolmogorov complexity in natural models. [Citation Graph (0, 0)][DBLP]
   STOC, 2002, pp:792-801 [Conf]
   
8. Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran
   Concurrent general composition of secure protocols in the timing model. [Citation Graph (0, 0)][DBLP]
   STOC, 2005, pp:644-653 [Conf]
   
9. Manoj Prabhakaran, Amit Sahai
   New notions of security: achieving universal composability without trusted setup. [Citation Graph (0, 0)][DBLP]
   STOC, 2004, pp:242-251 [Conf]
   
10. Manoj Prabhakaran, Amit Sahai
    Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:104-127 [Conf]
    
11. Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang
    Resource Fairness and Composability of Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:404-428 [Conf]
    
12. Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, Amit Sahai, Abhi Shelat
    The smallest grammar problem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:7, pp:2554-2576 [Journal]
    
13. Manoj Prabhakaran, Mike Rosulek
    Rerandomizable RCCA Encryption. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:517-534 [Conf]
    
14. 
    Towards Robust Computation on Encrypted Data. [Citation Graph (, )][DBLP]
    
    
15. 
    Founding Cryptography on Oblivious Transfer - Efficiently. [Citation Graph (, )][DBLP]
    
    
16. 
    Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations. [Citation Graph (, )][DBLP]
    
    
17. 
    A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security. [Citation Graph (, )][DBLP]
    
    
18. 
    Statistically Hiding Sets. [Citation Graph (, )][DBLP]
    
    
19. 
    Attribute-Sets: A Practically Motivated Enhancement to Attribute-Based Encryption. [Citation Graph (, )][DBLP]
    
    
20. 
    Homomorphic Encryption with CCA Security. [Citation Graph (, )][DBLP]
    
    
21. 
    Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation. [Citation Graph (, )][DBLP]
    
    
22. 
    Secure Arithmetic Computation with No Honest Majority. [Citation Graph (, )][DBLP]
    
    
23. 
    Cryptographic Complexity Classes and Computational Intractability Assumptions. [Citation Graph (, )][DBLP]
    
    
24. 
    Secure Arithmetic Computation with No Honest Majority [Citation Graph (, )][DBLP]
    
    
25. 
    Assisted Common Information with Applications to Secure Two-Party Computation [Citation Graph (, )][DBLP]
    
    
26. 
    Cryptographic Complexity of Multi-party Computation Problems: Classifications and Separations. [Citation Graph (, )][DBLP]