Succinct PPRFs via Memory-Tight Reductions
Joël Alwen, Chris Brzuska, Jérôme Govinden, Patrick Harasser, Stefano Tessaro
2025Year
3Citations
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 9ba465ba-cff6-4117-8ae7-33a3603a317eRelated papers
- Succinct Arguments for RAM Programs via Projection CodesYuval Ishai, Rafail Ostrovsky, Akash ShahCRYPTO 2023 · 2 citations
- Hiding in Plain Sight: Memory-Tight Proofs via Randomness ProgrammingAshrujit Ghoshal, Riddhi Ghosal, Joseph Jaeger, Stefano TessaroEUROCRYPT 2022 · 5 citations
- NTPIR: Efficient Silent-Preprocessing PIR using NTRUZhihao Li, Cheng HongCCS 2026
- Succinct Non-interactive Arguments for DistributionsZhengzhong Jin, Mingqi Lu, Bo Peng, Yue YuCRYPTO 2026
- Pseudorandom Functions with Weak Programming Privacy and Applications to Private Information RetrievalAshrujit Ghoshal, Mingxun Zhou, Elaine Shi, Bo PengEUROCRYPT 2025 · 2 citations
