Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity. - Ravi Kishore; Ashutosh Kumar 002; Chiranjeevi Vanarasa; Kannan Srinathan (ICITS, 2015)

Work efficient parallel algorithms for large graph exploration on emerging heterogeneous architectures. - Dip Sankar Banerjee; Ashutosh Kumar 002; Meher Chaitanya; Shashank Sharma; Kishore Kothapalli (J. Parallel Distributed Comput., 2015)

Leakage-Resilient Secret Sharing. - Ashutosh Kumar 002; Raghu Meka; Amit Sahai (Electron. Colloquium Comput. Complex., 2018)

Non-Malleable Secret Sharing. - Vipul Goyal; Ashutosh Kumar 002 (IACR Cryptol. ePrint Arch., 2018)

Non-Malleable Secret Sharing for General Access Structures. - Vipul Goyal; Ashutosh Kumar 002 (IACR Cryptol. ePrint Arch., 2018)

On the Price of Proactivizing Round-Optimal Perfectly Secret Message Transmission. - Ravi Kishore; Ashutosh Kumar 002; Chiranjeevi Vanarasa; Kannan Srinathan (IEEE Trans. Inf. Theory, 2018)

Leakage-Resilient Secret Sharing Against Colluding Parties. - Ashutosh Kumar 002; Raghu Meka; Amit Sahai (FOCS, 2019)

Extractors and Secret Sharing Against Bounded Collusion Protocols. - Eshan Chattopadhyay; Jesse Goodman; Vipul Goyal; Ashutosh Kumar 002; Xin Li 006; Raghu Meka; David Zuckerman (FOCS, 2020)

Bounded Collusion Protocols, Cylinder-Intersection Extractors and Leakage-Resilient Secret Sharing. - Ashutosh Kumar 002; Raghu Meka; David Zuckerman (Electron. Colloquium Comput. Complex., 2020)