| Work efficient parallel algorithms for large graph exploration on emerging heterogeneous architectures DS Banerjee, A Kumar, M Chaitanya, S Sharma, K Kothapalli Journal of Parallel and Distributed Computing 76, 81-93, 2015 | 10 | 2015 |
| Non-Malleable Secret Sharing V Goyal, A Kumar ACM SIGACT Symposium on Theory of Computing, 685-698, 2018 | 8 | 2018 |
| Non-malleable secret sharing for general access structures V Goyal, A Kumar Annual International Cryptology Conference, 501-530, 2018 | 5 | 2018 |
| Round-optimal perfectly secret message transmission with linear communication complexity R Kishore, A Kumar, C Vanarasa, S Kannan International Conference on Information Theoretic Security, 33-50, 2015 | 4 | 2015 |
| Non-malleable commitments from non-malleable extractors V Goyal, A Kumar, S Park, S Richelson, A Srinivasan Manuscript, accessed via personal communication, 2018 | 3 | 2018 |
| On the Price of Proactivizing Round-Optimal Perfectly Secret Message Transmission R Kishore, A Kumar, C Vanarasa, K Srinathan IEEE Transactions on Information Theory 64 (2), 1404-1422, 2018 | 2 | 2018 |
| Leakage-resilient secret sharing A Kumar, R Meka, A Sahai Cryptology ePrint Archive, Report 2018/1138, 2018. https://eprint. iacr. org …, 0 | 2 | |