Public-key encryption, local pseudorandom generators, and the low-degree method

DOI10.1007/978-3-031-48615-9_10zbMath1544.94228MaRDI QIDQ6581791

Pravesh K. Kothari, Alon Rosen, Andrej Bogdanov

Publication date: 1 August 2024

zbMATH Keywords

hypothesis testingpublic-key encryptionlocal cryptography

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• A dichotomy for local small-bias generators
• Probabilistic encryption
• Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio
• Public-key cryptography from different assumptions
• Candidate One-Way Functions Based on Expander Graphs
• Expander graphs and their applications
• Algebraic Attacks against Random Local Functions and Their Countermeasures
• A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
• Advances in Cryptology - EUROCRYPT 2004
• On ε‐biased generators in NC⁰

This page was built for publication: Public-key encryption, local pseudorandom generators, and the low-degree method