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

On perfectly secret message transmission in digraphs tolerating dual failures. - Ravi Kishore; Chiranjeevi Vanarasa; Tushant Jha; Kannan Srinathan (ICDCN, 2016)

On minimal connectivity requirements for secure message transmission in directed networks. - Ravi Kishore; Chiranjeevi Vanarasa; Kannan Srinathan (Inf. Process. Lett., 2018)

Assuring BetterTimes. - Per A. Hallgren; Ravi Kishore; Martín Ochoa; Andrei Sabelfeld (J. Comput. Secur., 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)

Perfectly secure message transmission over partially synchronous networks. - Ravi Kishore; Anupriya Inumella; Kannan Srinathan (ICDCN, 2019)

CRAFT: Composable Randomness and Almost Fairness from Time. - Carsten Baum; Bernardo David; Rafael Dowsley; Ravi Kishore; Jesper Buus Nielsen; Sabine Oechsner (IACR Cryptol. ePrint Arch., 2020)

CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time. - Carsten Baum; Bernardo David; Rafael Dowsley; Ravi Kishore; Jesper Buus Nielsen; Sabine Oechsner (Public Key Cryptography (1), 2023)

Perfectly Secure Message Transmission Tolerating Omission Faults - Possibility Feasibility, and Optimality. - Ravi Kishore (ICDCN, 2025)