3 papers
cs.CR2026
Weak Zero-Knowledge and One-Way Functions
Rohit Chatterjee, Yunqi Li, Prashant Nalini Vasudevan
We study the implications of the existence of weak Zero-Knowledge (ZK) protocols for worst-case hard languages. These are protocols that have completeness, soundness, and zero-know…
cs.CC2025
Decoding Balanced Linear Codes With Preprocessing
Andrej Bogdanov, Rohit Chatterjee, Yunqi Li +1
Prange's information set algorithm is a decoding algorithm for arbitrary linear codes. It decodes corrupted codewords of any -linear code of message length up…
cs.CR2025
Public-Key Encryption from the MinRank Problem
Rohit Chatterjee, Changrui Mu, Prashant Nalini Vasudevan
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…