Demo Data from VLDB 2026 / reviewers in the wild / expert
Tarakaram Gollamudi
dblp:417/5450
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0002-7035-2218ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 first-author · 1 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
1 paper |
Cryptographic primitives and cryptanalysis · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Programming languages and type systems · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › homomorphic encryption
fully homomorphic encryption |
0.9 | 1 | 2025 | ILA: Correctness via Type Checking for Fully Homomorphic Encryption · CCS 2025 |
Programming languages and type systems
type checking |
0.9 | 1 | 2025 | ILA: Correctness via Type Checking for Fully Homomorphic Encryption · CCS 2025 |
Methods — techniques the papers use, named apart from their topics
type checking · 1.7static analysis · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | ILA: Correctness via Type Checking for Fully Homomorphic EncryptionabstractRLWE-based Fully Homomorphic Encryption (FHE) schemes add some small noise to the message during encryption. The noise accumulates with each homomorphic operation. When the noise exceeds a critical value, the FHE circuit produces an incorrect output. This makes developing FHE applications quite subtle, as one must closely track the noise to ensure correctness. However, existing libraries and compilers offer limited support to statically track the noise. Additionally, FHE circuits are also plagued by wraparound errors that are common in finite modulus arithmetic. These two limitations of existing compilers and libraries make FHE applications too difficult to develop with confidence. Tarakaram Gollamudi, Anitha Gollamudi, Joshua Gancher |
CCS | 1 |