3 papers
cs.CR2026
Overcoming the Randomness-Utility Trade-off in Answering Differentially Private Linear Queries
Surendra Ghentiyala, Pritish Kamath, Ravi Kumar +1
We study the question of answering linear queries with differential privacy using few (expected) random bits. We provide a randomness-efficient analog of the -norm m…
cs.CR2025
Efficient derandomization of differentially private counting queries
Surendra Ghentiyala
Differential privacy for the 2020 census required an estimated 90 terabytes of randomness [GL20], an amount which may be prohibitively expensive or entirely infeasible to generate.…
cs.CR2024
New constructions of pseudorandom codes
Surendra Ghentiyala, Venkatesan Guruswami
Introduced in [CG24], pseudorandom error-correcting codes (PRCs) are a new cryptographic primitive with applications in watermarking generative AI models. These are codes where a c…