Mahesh Sreekumar Rajasree
Research Subjects
Mahesh Sreekumar Rajasree has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Venkata Koppula
IIT Delhi
3 shared publications - Rishab Goyal
University of Wisconsin-Madison
2 shared publications - Abhinav Kumar
IIT Delhi
1 shared publication - Anne Müller
CISPA Helmholtz Center for Information Security
1 shared publication Dhairya Gupta
Indian Institute of Technology
1 shared publication- Felix Rohrbach
CISPA Helmholtz Center for Information Security
1 shared publication
Latest Publications
- 31 October 2026
- Published by Springer Nature
- p. 290-334
On Robust Combiners for Pseudorandom Codes and PKE with Pseudorandom Ciphertexts
- 31 October 2026
- Published by Springer Nature
- p. 290-334
On Robust Combiners for Pseudorandom Codes and PKE with Pseudorandom Ciphertexts
- 5 December 2025
- Published by Springer Nature
- p. 225-257
Separating Pseudorandom Codes from Local Oracles
- 5 December 2025
- Published by Springer Nature
- p. 225-257
Separating Pseudorandom Codes from Local Oracles
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 101-136
A Note on Adaptive Security in Hierarchical Identity-Based Encryption
- 17 August 2025
- Published by Springer Nature
- p. 101-136
Open AccessA Note on Adaptive Security in Hierarchical Identity-Based Encryption
- Open Access
- 7 July 2025
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (2)
Incompressible Encryption Beyond CPA/CCA Security
An incompressible encryption scheme offers protection against adversaries who possess the entire secret key but can store only a portion of the ciphertext. In recent years, there has been growing interest in developing such primitives in both public-key and secret-key settings, as well as in the multi-user scenario. In this work, we extend the concept of incompressible encryption to incorporate anonymity and key-dependent message security. We introduce the following schemes: 1. The first key-dependent message incompressible SKE scheme secure against unbounded adversaries. 2.The first anonymous incompressible SKE scheme secure against unbounded encryption queries. Furthermore, we present the public key versions of these schemes.
- 7 July 2025
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (2)
Open AccessIncompressible Encryption Beyond CPA/CCA Security
An incompressible encryption scheme offers protection against adversaries who possess the entire secret key but can store only a portion of the ciphertext. In recent years, there has been growing interest in developing such primitives in both public-key and secret-key settings, as well as in the multi-user scenario. In this work, we extend the concept of incompressible encryption to incorporate anonymity and key-dependent message security. We introduce the following schemes: 1. The first key-dependent message incompressible SKE scheme secure against unbounded adversaries. 2.The first anonymous incompressible SKE scheme secure against unbounded encryption queries. Furthermore, we present the public key versions of these schemes.
- 5 May 2025
- Published by Springer Nature
- p. 158-193
Non-committing Identity Based Encryption: Constructions and Applications
- 5 May 2025
- Published by Springer Nature
- p. 158-193
Non-committing Identity Based Encryption: Constructions and Applications
- 13 December 2024
- Published by Springer Nature
- p. 234-257
Leakage-Resilient Key-Dependent Message Secure Encryption Schemes
- 13 December 2024
- Published by Springer Nature
- p. 234-257
Leakage-Resilient Key-Dependent Message Secure Encryption Schemes