Public-Key Encryption from the MinRank Problem
This talk is about the Public-Key Encryption from the MinRank Problem and will describe a recent work with Changrui Mu and Dr. Prashant Nalini Vasudevan with the same title. We construct a public-key encryption scheme from the hardness of the (planted) MinRank problem over uniformly random instances. This corresponds to the hardness of decoding random linear rank-metric codes. Existing constructions of public-key encryption from such problems require hardness for structured instances arising from the masking of efficiently decodable codes. Central to our construction is the development of a new notion of duality for rank-metric codes. The current version of the work is available at: https://eprint.iacr.org/2025/1833.pdf.
Speaker Biography
Rohit is a postdoctoral research fellow at the School of Computing in NUS. He looks at the foundations of cryptographic primitives including complexity based characterizations of cryptographic hardness, and the interplay between basic cryptographic objects such as proofs, encryption schemes and one-way functions. He also works on post-quantum and some aspects of quantum cryptography. He is broadly interested in the intersection of theory CS and cryptography.
