~/talk

On the Assumptions Used for Obfuscation

links:none on file
slides:none on file

Survey compares four concrete assumptions used to build obfuscation: LWE, SXDH, local PRGs, and LPN. Gives concrete regimes for LPN (constant noise + linear samples → exponential best attacks; inverse‑poly noise → subexponential attacks via low‑weight kernel vectors and BKW variants), proves decision→search via Goldreich‑Levin, and describes Zq/LPN lifting that lets one “plant” a short kernel vector for CCA‑style keys. Shows local PRGs from sparse LPN require expansion and resilient, high‑degree predicates, and orders primitives by available homomorphism: none → bounded addition → bilinear → full.

AI-written summary · about

  1. 0:00Intro
  2. 0:48Obfuscation
  3. 4:24Learning Parity with Noise [BFKL94]
  4. 6:15Decoding Random Linear Code GKLE
  5. 13:52Known Attacks
  6. 19:09Simple Distinguishing Attack
  7. 24:33Pseudorandomness
  8. 30:51Random Self-Reducibility
  9. 31:22Dual Version: Syndrome Decoding
  10. 32:44Corollary: Planting Short Vector in Kerne
  11. 34:02LPN: Evidence for Hardness
  12. 38:17LPN: Features
  13. 40:47Variants
  14. 52:59Learning with Errors Variant Regevos
  15. 54:05Locally Computable Functions (NC) Each output depends on constant number of inputs
  16. 54:46Lin-PRGs in NC
  17. 56:53Poly-Stretch PRG in NC
  18. 59:09Generalization to Long Output
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.