Manoj Prabhakaran
Manoj Prabhakaran
Computer Science and Engineering, IIT Bombay
Geverifieerd e-mailadres voor
Geciteerd door
Geciteerd door
Attribute-based signatures
H Maji, M Prabhakaran, M Rosulek
Topics in Cryptology–CT-RSA 2011, 376-392, 2011
The smallest grammar problem
M Charikar, E Lehman, D Liu, R Panigrahy, M Prabhakaran, A Sahai, ...
Information Theory, IEEE Transactions on 51 (7), 2554-2576, 2005
Founding cryptography on oblivious transfer–efficiently
Y Ishai, M Prabhakaran, A Sahai
Annual international cryptology conference, 572-591, 2008
Dynamic searchable encryption via blind storage
M Naveed, M Prabhakaran, CA Gunter
2014 IEEE Symposium on Security and Privacy, 639-654, 2014
Positive results and techniques for obfuscation
B Lynn, M Prabhakaran, A Sahai
International conference on the theory and applications of cryptographic …, 2004
Concurrent zero knowledge with logarithmic round-complexity
M Prabhakaran, A Rosen, A Sahai
Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE …, 2002
Attribute-sets: A practically motivated enhancement to attribute-based encryption
R Bobba, H Khurana, M Prabhakaran
European Symposium on Research in Computer Security, 587-604, 2009
Private circuits II: Keeping secrets in tamperable circuits
Y Ishai, M Prabhakaran, A Sahai, D Wagner
Annual International Conference on the Theory and Applications of …, 2006
New notions of security: achieving universal composability without trusted setup
M Prabhakaran, A Sahai
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
Secure arithmetic computation with no honest majority
Y Ishai, M Prabhakaran, A Sahai
Theory of Cryptography Conference, 294-314, 2009
Efficient non-interactive secure computation
Y Ishai, E Kushilevitz, R Ostrovsky, M Prabhakaran, A Sahai
Annual International Conference on the Theory and Applications of …, 2011
On the (im) possibility of cryptography with imperfect randomness
Y Dodis, SJ Ong, M Prabhakaran, A Sahai
45th Annual IEEE Symposium on Foundations of Computer Science, 196-205, 2004
Concurrent non-malleable zero knowledge
B Barak, M Prabhakaran, A Sahai
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006
Resource fairness and composability of cryptographic protocols
J Garay, P MacKenzie, M Prabhakaran, K Yang
Theory of Cryptography Conference, 404-428, 2006
Concurrent general composition of secure protocols in the timing model
YT Kalai, Y Lindell, M Prabhakaran
Proceedings of the thirty-seventh annual ACM Symposium on Theory of …, 2005
Circuits resilient to additive attacks with applications to secure computation
D Genkin, Y Ishai, MM Prabhakaran, A Sahai, E Tromer
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
Rerandomizable RCCA encryption
M Prabhakaran, M Rosulek
Annual International Cryptology Conference, 517-534, 2007
On randomized broadcasting and gossiping in radio networks
D Liu, M Prabhakaran
International Computing and Combinatorics Conference, 340-349, 2002
A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations
S Agrawal, D Gupta, HK Maji, O Pandey, M Prabhakaran
Theory of Cryptography Conference, 375-397, 2015
Secure multi-party computation
MM Prabhakaran, A Sahai
IOS press, 2013
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20