EDBT 2026 Demo / reviewers in the wild / expert
Guru-Vamsi Policharla
dblp:276/0468
· DBLP profile ↗
9ranked-venue papers
0as first author
9since 2021 · last 2025
0009-0007-1494-8176ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 9 · 9 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Laconic PSI on Authenticated Inputs and Applications
James Bartusek, Sanjam Garg, Abhishek Jain 0002, Guru-Vamsi Policharla |
ASIACRYPT (5) | 4 |
| 2025 | A Framework for Witness Encryption from Linearly Verifiable SNARKs and Applications
Sanjam Garg, Mohammad Hajiabadi, Dimitris Kolonelos, Abhiram Kothapalli, Guru-Vamsi Policharla |
CRYPTO (3) | 5 |
| 2025 | Practical Mempool Privacy via One-time Setup Batched Threshold Encryption
Arka Rai Choudhuri, Sanjam Garg, Guru-Vamsi Policharla, Mingyuan Wang 0001 |
USENIX Security Symposium | 3 |
| 2024 | Improved Alternating-Moduli PRFs and Post-quantum Signatures
Navid Alamati, Guru-Vamsi Policharla, Srinivasan Raghuraman, Peter Rindal |
CRYPTO (8) | 2 |
| 2024 | Threshold Encryption with Silent Setup
Sanjam Garg, Dimitris Kolonelos, Guru-Vamsi Policharla, Mingyuan Wang 0001 |
CRYPTO (7) | 3 |
| 2024 | Mempool Privacy via Batched Threshold Encryption: Attacks and Defenses
Arka Rai Choudhuri, Sanjam Garg, Julien Piet, Guru-Vamsi Policharla |
USENIX Security Symposium | 4 |
| 2023 | Experimenting with Zero-Knowledge Proofs of TrainingabstractHow can a model owner prove they trained their model according to the correct specification? More importantly, how can they do so while preserving the privacy of the underlying dataset and the final model? We study this problem and formulate the notion of zero-knowledge proof of training (zkPoT), which formalizes rigorous security guarantees that should be achieved by a privacy-preserving proof of training. While it is theoretically possible to design zkPoT for any model using generic zero-knowledge proof systems, this approach results in extremely unpractical proof generation times. Towards designing a practical solution, we propose the idea of combining techniques from MPC-in-the-head and zkSNARKs literature to strike an appropriate trade-off between proof size and proof computation time. We instantiate this idea and propose a concretely efficient, novel zkPoT protocol for logistic regression. Sanjam Garg, Aarushi Goel, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Guru-Vamsi Policharla, Mingyuan Wang 0001 |
CCS | 6 |
| 2023 | End-to-End Secure Messaging with Traceability Only for Illegal Content
James Bartusek, Sanjam Garg, Abhishek Jain 0002, Guru-Vamsi Policharla |
EUROCRYPT (5) | 4 |
| 2023 | zkSaaS: Zero-Knowledge SNARKs as a Service
Sanjam Garg, Aarushi Goel, Abhishek Jain 0002, Guru-Vamsi Policharla, Sruthi Sekar |
USENIX Security Symposium | 4 |