About Me
I'm Aditya! I work in the High Frequency Trading industry in Chicago! Prior to this, I studied post-quantum cryptographic proof systems at the University of Wisconsin-Madison and earned an M.S. (Research) in Computer Sciences. Even before this, I worked in Singapore for over three years building low-latency trading systems. I got my B.Tech. in Computer Science and Engineering from Indian Institute of Technology (I.I.T.) Indore in 2019.
Publications
Succinct Arguments for BatchQMA and Friends under 8 rounds
International Conference on Cryptology (CRYPTO), 2025
We study the problem of minimizing round complexity in the context of succinct classical argument systems for quantum computation. All prior works either require at least 8 rounds of interaction between the quantum prover and classical verifier, or rely on the idealized quantum random oracle model (QROM). We design:
(1) A 4-round public-coin (except for the first message) argument system for batchQMA lan- guages. Under the post-quantum hardness of functional encryption and learning with errors (LWE), we achieve optimal communication complexity (i.e., all message sizes are independent of batch size). If we only rely on the post-quantum hardness of LWE, we can make all messages except the verifier's first message to be independent of the batch size.
(2) A 6-round private-coin argument system for monotone policy batchQMA languages, under the post-quantum hardness of LWE. The communication complexity is independent of the batch size as well as the monotone circuit size.
Unlike all previous works, we do not rely on "state-preserving" succinct arguments of knowledge (AoKs) for NP to prove soundness. Our main technical contribution is a new approach to prove soundness without rewinding cheating provers. We bring the notion of straight-line partial extractability to argument systems for quantum computation.
Seasons
Contact
You can reach me at: ajain365 [at] outlook [dot] com