Demo Data from SIGIR 2026 / 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
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
9 papers |
Cryptographic primitives and cryptanalysis · 45% Cryptographic protocols and secure computation · 33% Blockchain and cryptocurrency security · 11% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 100% |
Topics — the 17 heaviest of 17, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
threshold encryption |
2.4 | 3 | 2025 | Practical Mempool Privacy via One-time Setup Batched Threshold Encryption · USENIX Security Symposium 2025 Mempool Privacy via Batched Threshold Encryption: Attacks and Defenses · USENIX Security Symposium 2024 Threshold Encryption with Silent Setup · CRYPTO (7) 2024 |
Blockchain and cryptocurrency security › privacy-preserving blockchain
mempool privacy |
1.6 | 2 | 2025 | Practical Mempool Privacy via One-time Setup Batched Threshold Encryption · USENIX Security Symposium 2025 Mempool Privacy via Batched Threshold Encryption: Attacks and Defenses · USENIX Security Symposium 2024 |
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs |
1.6 | 3 | 2025 | zkSaaS: Zero-Knowledge SNARKs as a Service · USENIX Security Symposium 2023 Experimenting with Zero-Knowledge Proofs of Training · CCS 2023 A Framework for Witness Encryption from Linearly Verifiable SNARKs and Applications · CRYPTO (3) 2025 |
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption › threshold encryption
batched threshold encryption |
0.9 | 1 | 2025 | Practical Mempool Privacy via One-time Setup Batched Threshold Encryption · USENIX Security Symposium 2025 |
Cryptographic protocols and secure computation
private set intersection |
0.9 | 1 | 2025 | Laconic PSI on Authenticated Inputs and Applications · ASIACRYPT (5) 2025 |
Cryptographic primitives and cryptanalysis › encryption
witness encryption |
0.9 | 1 | 2025 | A Framework for Witness Encryption from Linearly Verifiable SNARKs and Applications · CRYPTO (3) 2025 |
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures |
0.8 | 1 | 2024 | Improved Alternating-Moduli PRFs and Post-quantum Signatures · CRYPTO (8) 2024 |
Cryptographic primitives and cryptanalysis
post-quantum cryptography |
0.8 | 1 | 2024 | Improved Alternating-Moduli PRFs and Post-quantum Signatures · CRYPTO (8) 2024 |
Cryptographic primitives and cryptanalysis
pseudorandom functions |
0.8 | 1 | 2024 | Improved Alternating-Moduli PRFs and Post-quantum Signatures · CRYPTO (8) 2024 |
Privacy and data protection
privacy-preserving machine learning |
0.7 | 1 | 2023 | Experimenting with Zero-Knowledge Proofs of Training · CCS 2023 |
Security and privacy of machine learning › verifiable machine learning
proof of learning |
0.7 | 1 | 2023 | Experimenting with Zero-Knowledge Proofs of Training · CCS 2023 |
Cryptographic protocols and secure computation
secure messaging |
0.7 | 1 | 2023 | End-to-End Secure Messaging with Traceability Only for Illegal Content · EUROCRYPT (5) 2023 |
Cryptographic protocols and secure computation
traceability |
0.7 | 1 | 2023 | End-to-End Secure Messaging with Traceability Only for Illegal Content · EUROCRYPT (5) 2023 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
zero-knowledge proof of training |
0.7 | 1 | 2023 | Experimenting with Zero-Knowledge Proofs of Training · CCS 2023 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › non-interactive zero-knowledge proofs
zk-SNARK |
0.3 | 1 | 2025 | A Framework for Witness Encryption from Linearly Verifiable SNARKs and Applications · CRYPTO (3) 2025 |
Systems and software security
content moderation |
0.2 | 1 | 2023 | End-to-End Secure Messaging with Traceability Only for Illegal Content · EUROCRYPT (5) 2023 |
Cloud and datacenter computing
secure outsourcing |
0.2 | 1 | 2023 | zkSaaS: Zero-Knowledge SNARKs as a Service · USENIX Security Symposium 2023 |
Methods — techniques the papers use, named apart from their topics
zero-knowledge proofs · 1.3SNARKs · 1.3one-time setup · 0.9cryptanalysis · 0.8alternating moduli · 0.8zk-SNARK · 0.7end-to-end encryption · 0.7MPC-in-the-head · 0.7
| 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 |