Pratyay Mukherjee

Staff Research Scientist

Focus areas: Cryptography, Security, and Theory of Computation

Biography

Dr. Pratyay Mukherjee joined Visa Research as a Staff Research Scientist in March 2017. Pratyay received his Ph.D. and M. Tech. in Computer Science from Aarhus University and Indian Institute of Technology, Kharagpur in 2015 and 2011, respectively. He received his B.E. in Engineering, Electronics and Telecommunications Engineering from Jadavpur University in 2008. Prior to joining Visa, Pratyay was a Postdoctoral Researcher at UC Berkeley. 

As a member of the Security team, his research interests are cryptography and security, and its interplay with theory of computation. He has served as a program committee member for numerous conferences, including Asiacrypt, Theory of Cryptography Conference (TCC), International Association for Cryptologic Research International Conference on Practice and Theory of Public-Key Cryptography (IACR PKC) and others. With over 700 citations, he has published more than 15 papers in several international conferences and journals, including Crypto, Eurocrypt, Asiacrypt, Association for Computing Machinery Conference on Computer and Communications Security (CCS) and others. 

Conferences

  • Chen, Y., Genise, N., & Mukherjee, P. (2019, December). Approximate Trapdoors for Lattices and Smaller Hash-and-Sign Signatures. In International Conference on the Theory and Application of Cryptology and Information Security (pp. 3-32). Springer, Cham.
  • Chen, B., Chen, Y., Hostáková, K., & Mukherjee, P. (2019, August). Continuous space-bounded non-malleable codes from stronger proofs-of-space. In Annual International Cryptology Conference (pp. 467-495). Springer, Cham.
  • Agrawal, S., Mohassel, P., Mukherjee, P., & Rindal, P. (2018, January). DiSE: distributed symmetric-key encryption. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (pp. 1993-2010).
  • Agrawal, S., Miao, P., Mohassel, P., & Mukherjee, P. (2018, January). PASTA: password-based threshold authentication. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (pp. 2042-2059).
  • Döttling, N., Garg, S., Gupta, D., Miao, P., & Mukherjee, P. (2018, December). Obfuscation from low noise multilinear maps. In International Conference on Cryptology in India (pp. 329-352). Springer, Cham.

  • Faust, S., Hostáková, K., Mukherjee, P., & Venturi, D. (2017). Non-Malleable Codes for Space-Bounded Tampering. Advances in Cryptology – CRYPTO 2017, 95–126.
  • Apon, D., Döttling, N., Garg, S., & Mukherjee, P. (2017). Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13. International Colloquium on Automata, Languages and Programming.
  • Garg, S., Miles, E., Mukherjee, P., Sahai, A., Srinivasan, A., & Zhandry, M. (2016). Secure Obfuscation in a Weak Multilinear Map Model. Theory of Cryptography, 241–268.
  • Chandran, N., Goyal, V., Mukherjee, P., Omkant, P., & Upadhyay, J. (2016). Block-wise Non-malleable Codes. International Colloquium on Automata, Languages, and Programming.
  • Mukherjee, P., & Wichs, D. (2016). Two Round Multiparty Computation via Multi-key FHE. Advances in Cryptology – EUROCRYPT 2016, 735–763.
  • Garg, S., Mukherjee, P., Pandey, O., & Polychroniadou, A. (2016). The Exact Round Complexity of Secure Computation. Advances in Cryptology – EUROCRYPT 2016, 448–476.
  • Damgård, I., Faust, S., Mukherjee, P., & Venturi, D. (2015). The Chaining Lemma and Its Application. International Conference on Information-Theoretic Security. 
  • Faust, S., Mukherjee, P., Nielsen, J. B., & Venturi, D. (2015). A Tamper and Leakage Resilient von Neumann Architecture. International Conference on Practice and Theory of Public-Key Cryptography.
  • Bhattacharyya, R., & Mukherjee, P. (2015). Non-adaptive programmability of random oracle. Theoretical Computer Science, 592, 97–114.
  • Faust, S., Mukherjee, P., Venturi, D., & Wichs, D. (2016). Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits. IEEE Transactions on Information Theory, 62(12), 7179–7194.
  • Faust, S., Mukherjee, P., Buus Nielsen, J., Venturi, D., Epfl, & Switzerland. (2014). Continuous Non-malleable Codes. IACR Theory of Cryptography Conference.
  • Damgård, I., Faust, S., Mukherjee, P., & Venturi, D. (2015). Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier. Journal of Cryptology, 30(1), 152–190.

Back to Visa Research page