Anubhav Baweja

I am a PhD student at the University of Pennsylvania, advised by Pratyush Mishra and Sampath Kannan. My research interests lie at the intersection of cryptography, streaming algorithms, and sublinear algorithms. Much of my recent work has focused on hash-based proof systems.

I obtained my BS and MS in computer science from Carnegie Mellon University in 2021, where I was advised by David Woodruff and Guy Blelloch. Before starting my PhD, I worked at Citadel Securities as a quantitative research analyst for two years.

Google Scholar DBLP LinkedIn abaweja [at] upenn [dot] edu

Publications

Field-Agnostic SNARKs with Small Proofs via Encode-Repeat-Accumulate (ERA) Codes

ASIACRYPT 2026 ePrint Code

Anubhav Baweja, Giacomo Fenzi, Pratyush Mishra, Tushar Mopuri

Also appeared at zkProof 8

Materials: Talk at zkProof 8

FICS and FACS: Fast IOPPs and Accumulation via Code-Switching

CRYPTO 2026 ePrint

Anubhav Baweja, Pratyush Mishra, Tushar Mopuri, Matan Shtepel

Also appeared at zkProof 8

Query-Optimal IOPPs for Linear-Time Encodable Codes

EUROCRYPT 2026 ePrint

Anubhav Baweja, Pratyush Mishra, Tushar Mopuri, Matan Shtepel

Also appeared at zkProof 8

Materials: Talk at EUROCRYPT 2026 EUROCRYPT 2026 Slides

Scribe: Low-memory SNARKs via Read-Write Streaming

USENIX Security 2026 Distinguished Paper Runner-Up ePrint Code

Anubhav Baweja, Pratyush Mishra, Tushar Mopuri, Karan Newatia, Steve Wang

Also appeared at zkProof 8 and zkSummit 11

Time-Space Trade-Offs for Sumcheck

TCC 2025 ePrint Code

Anubhav Baweja, Alessandro Chiesa, Elisabetta Fedele, Giacomo Fenzi, Pratyush Mishra, Tushar Mopuri, Andrew Zitek-Estrada

Also appeared at zkProof 8 and zkSummit 14

Materials: Talk at zkProof 8 Talk at zkSummit 14 TCC 2025 Slides

Average-Distortion Sketching

FOCS 2025 arXiv

Yiqiao Bao, Anubhav Baweja, Nicolas Menand, Erik Waingarten, Nathan White, Tian Zhang

An Efficient Semi-Streaming PTAS for Tournament Feedback Arc Set with Few Passes

ITCS 2022 arXiv

Anubhav Baweja, Justin Jia, David Woodruff

Materials: Talk at ITCS 2022

Efficient Parallel Self-Adjusting Computation

SPAA 2021 arXiv

Daniel Anderson, Guy Blelloch, Anubhav Baweja, Umut Acar

Service

External subreviewer for STOC 2024, ICALP 2024, APPROX 2024, CRYPTO 2025 and 2026, TCC 2026, and ASIACRYPT 2026.

Teaching

CIS 556: Cryptography

University of Pennsylvania · Teaching Assistant

Spring 2026

CIS 556: Cryptography

University of Pennsylvania · Teaching Assistant

Spring 2025

CIS 677: Randomized Algorithms

University of Pennsylvania · Teaching Assistant

Fall 2024

15-210: Parallel and Sequential Data Structures and Algorithms

Carnegie Mellon University · Head Teaching Assistant

Spring 2020

15-151: Mathematical Foundations for Computer Science

Carnegie Mellon University · Teaching Assistant

Fall 2019

15-122: Principles of Imperative Computation

Carnegie Mellon University · Teaching Assistant

Spring 2018