Hemanta K. Maji
Hemanta K. Maji
Department of Computer Science, Purdue University
Geverifieerd e-mailadres voor purdue.edu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Attribute-based signatures
HK Maji, M Prabhakaran, M Rosulek
Cryptographers’ track at the RSA conference, 376-392, 2011
4842011
Attribute-Based Signatures: Achieving Attribute-Privacy and Collusion-Resistance.
HK Maji, M Prabhakaran, M Rosulek
IACR Cryptol. ePrint Arch. 2008, 328, 2008
2512008
Zeroizing without low-level zeroes: New MMAP attacks and their limitations
JS Coron, C Gentry, S Halevi, T Lepoint, HK Maji, E Miles, M Raykova, ...
Annual Cryptology Conference, 247-266, 2015
1692015
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
652015
Complexity of multi-party computation problems: The case of 2-party symmetric secure function evaluation
HK Maji, M Prabhakaran, M Rosulek
Theory of Cryptography Conference, 256-273, 2009
532009
Zeroizing without zeroes: Cryptanalyzing multilinear maps without encodings of zero.
C Gentry, S Halevi, HK Maji, A Sahai
IACR Cryptol. ePrint Arch. 2014, 929, 2014
522014
Optimal computational split-state non-malleable codes
D Aggarwal, S Agrawal, D Gupta, HK Maji, O Pandey, M Prabhakaran
Theory of Cryptography Conference, 393-417, 2016
502016
Explicit non-malleable codes against bit-wise tampering and permutations
S Agrawal, D Gupta, HK Maji, O Pandey, M Prabhakaran
Annual Cryptology Conference, 538-557, 2015
492015
A zero-one law for cryptographic complexity with respect to computational UC security
HK Maji, M Prabhakaran, M Rosulek
Annual Cryptology Conference, 595-612, 2010
322010
A unified characterization of completeness and triviality for secure function evaluation
HK Maji, M Prabhakaran, M Rosulek
International Conference on Cryptology in India, 40-59, 2012
292012
Computational complexity of statistical machine translation
R Udupa, HK Maji
11th Conference of the European Chapter of the Association for Computational …, 2006
252006
On the computational complexity of coin flipping
HK Maji, M Prabhakaran, A Sahai
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 613-622, 2010
242010
Stateless cryptographic protocols
V Goyal, HK Maji
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 678-687, 2011
222011
Explicit Non-Malleable Codes Resistant to Permutations.
S Agrawal, D Gupta, HK Maji, O Pandey, M Prabhakaran
Electronic Colloquium on Computational Complexity (ECCC) 21, 69, 2014
212014
Limits of random oracles in secure computation
M Mahmoody, HK Maji, M Prabhakaran
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
202014
Limits of random oracles in secure computation
M Mahmoody, HK Maji, M Prabhakaran
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
202014
Explicit Non-malleable Codes Resistant to Permutations and Perturbations.
S Agrawal, D Gupta, HK Maji, O Pandey, M Prabhakaran
IACR Cryptol. ePrint Arch. 2014, 841, 2014
202014
A full characterization of completeness for two-party randomized function evaluation
D Kraschewski, HK Maji, M Prabhakaran, A Sahai
Annual International Conference on the Theory and Applications of …, 2014
172014
Bounded-communication leakage resilience via parity-resilient circuits
V Goyal, Y Ishai, HK Maji, A Sahai, AA Sherstov
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 1-10, 2016
162016
Cryptographic Complexity Classes and Computational Intractability Assumptions.
HK Maji, M Prabhakaran, M Rosulek
ICS, 266-289, 2010
152010
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20